%A ZHOU Kaiqing, LI Hangcheng, MO Liping %T Adaptive harmony search algorithm based on global optimization %0 Journal Article %D 2021 %J Journal of Shandong University(Engineering Science) %R 10.6040/j.issn.1672-3961.0.2020.395 %P 47-56 %V 51 %N 2 %U {http://gxbwk.njournal.sdu.edu.cn/CN/abstract/article_2021.shtml} %8 %X An adaptive harmony search algorithm utilizing global optimal mechanism (AGOHS) was proposed to overcome the drawbacks of harmony search (HS) algorithm, such as slow convergence speed and low search accuracy. The modifications of AGOHS was classified into the following aspects. In the improvisation phase, the bandwidth (BW) was represented by the difference between the optimal harmony variable and the worst harmony variable in the current harmony, so that the BW had the ability to adapt to specific situations, and saved a random harmony variable in the optimal harmony every time. A novel harmony variable was generated randomly by using the intrapopulation difference while the obtained random number was greater than the reconciliation probability of harmony memory storage. To improve the search ability and the robustness, a novel harmony was randomly generated from the minimum value to the maximum value of harmony in the current population. The best harmony with the smallest error among the gained harmonies in this phase was selected and used to update the harmony memory. The proposed algorithm was compared with three improved harmony search algorithms on 13 test functions, experimental results revealed that the AGOHS had better global search capability and convergence speed.