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).