Improved Harmony Search algorithm with better local convergence speed

The basic Harmony Search (HS) algorithm has good global search performance, but it also has the disadvantage of slow local convergence speed especially when the iteration solution approaches to the optimal solution. Considering this disadvantage, the Accelerated Harmony Search (AHS) algorithm is proposed. The local convergence speed of the AHS algorithm is improved, using chaos disturbance strategy, parameter adaptive strategy and cluster analysis. The validity of the AHS algorithm is tested by five Benchmark functions. The results indicate that the AHS algorithm has better local convergence speed compared with those already proposed HS algorithms.