Multi-dimensional function optimization based on global-best harmony annealing algorithm
ZHANG Feng-rong1,PAN Quan-ke1,PANG Rong-bo2,LI Huan1
(1.School of Computer Science, Liaocheng University, Liaocheng Shandong 252059, China;2.College of Dongchang, Liaocheng University, Liaocheng Shandong 252000, China)
Abstract:This paper put forward a kind of hybrid optimization algorithm:harmony annealing algorithm,which was based on harmony search and simulated annealing algorithm for multidimensional function optimization problem. Improved the algorithm the search mechanism of HS,selected the reasonable values about harmony memory considering rate(HMCR) and dynamic pitch adjusting rate(PAR). Searched the new vector randomly in the HM, then executed a Metropolis algorithm. It could improve the efficiency of the exploration and reduce the probability of trapped by local minimum value. The simulation results demonstrate the effectiveness and good quality of the proposed procedure,and better than those of harmony search and simulated annealing algorithm. ......