ScholarLens Back to search
2011•Journal of Gansu Lianhe UniversityRequires access

An Improved Adaptive Harmony Search Algorithm

Gao Yue-lin

Open publisher page 1 citations

Abstract

Harmony Search(HS) is a heuristic optimization method.Based on the purpose of avoiding the disadvantage of improved harmony search(IHS) algorithm,a new adaptive harmony search algorithm is presented.Adaptive harmony memory consideration rate,pitch adjusting rate and band width are used to produce new solutions.In each iteration,several solutions are generated.It makes full use of information of harmony memory.Finally,the proposed algorithm is tested by five benchmark function and contrasted with HIS,AHSPSO.The test results show the favorable abilities of accuracy and escaping local minimums.

About this research paper

What this paper is about

Harmony Search(HS) is a heuristic optimization method.Based on the purpose of avoiding the disadvantage of improved harmony search(IHS) algorithm,a new adaptive harmony search algorithm is presented.Adaptive harmony memory consideration rate,pitch adjusting rate and band width are used to produce new solutions.In each iteration,several solutions are generated.It makes full use of information of harmony memory.Finally,the proposed algorithm is tested by five benchmark function and contrasted with HIS,AHSPSO.The test results show the favorable abilities of accuracy and escaping local minimums.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Harmony Search(HS) is a heuristic optimization method.Based on the purpose of avoiding the disadvantage of improved harmony search(IHS) algorithm,a new adaptive harmony search algorithm is presented.Adaptive harmony memory consideration rate,pitch adjusting rate and band width are used to produce new solutions.In each iteration,several solutions are generated.It makes full use of information of harmony memory.Finally,the proposed algorithm is tested by five benchmark function and contrasted with HIS,AHSPSO.The test results show the favorable abilities of accuracy and escaping local minimums.

Key concepts: Harmony search, Harmony (color), Benchmark (surveying), Computer science, Algorithm, Mathematical optimization, Heuristic, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved Adaptive Harmony Search Algorithm — Research Paper | ScholarLens