An Amended Harmony Search Algorithm for Unconstrained Optimization Problems
Harmony search (HS) algorithm is a new mate heuristic algorithm, which is conceptualized using the musical improvisation process of searching for a perfect state of harmony.Its own potential and shortage, one of its main disadvantages is that it easily trapped into local optima and converges very slowly.Based on the conception of swarm intelligence, this paper presents an amended harmony search (AHS) algorithm.AHS introduces a novel position updating strategy for generating new solution vectors, which enhances solution accuracy and convergence rate of algorithm.Several standard benchmark optimization functions are to be test and compare the performance of the AHS.The results revealed the superiority of the proposed method to the HS and its three improved algorithms (IHS, GHS and NGHS).
Harmony search algorithm local optima swarm intelligence amended harmony search algorithm position updating
LI Ruoping OUYANG Haibin GAO Liqun
Information & Science College Northeastern University Shenyang 110004,China
国际会议
the 3nd International Conference on Digital Manufacturing & Automation (第三届数字制造与自动化国际会议(ICDMA 2012))
桂林
英文
911-914
2012-08-01(万方平台首次上网日期,不代表论文的发表时间)