Adaptive harmony search with best-based search strategy

• Published in: Soft computing (Berlin, Germany) Vol. 22; no. 4; pp. 1335 - 1349
• Main Authors: Guo, Zhaolu, Yang, Huogen, Wang, Shenwen, Zhou, Caiying, Liu, Xiaosheng
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2018; Springer Nature B.V
• Subjects: Adaptive control; Artificial Intelligence; Computational Intelligence; Control; Engineering; Evolutionary algorithms; Genetic algorithms; Improvisation; Mathematical Logic and Foundations; Mechatronics; Methodologies and Application; Optimization techniques; Parameters; Robotics; Search methods; Search process; Search strategy; Harmony search; Adaptive; Evolutionary algorithm
• ISSN: 1432-7643; 1433-7479
• DOI: 10.1007/s00500-016-2424-3

Harmony search (HS) is a new evolutionary algorithm inspired by the process of music improvisation. During the past decade, HS has shown excellent performance in many fields. However, its search strategy often demonstrates insufficient exploitation ability when facing some complex practical problems. Moreover, the HS performance is significantly influenced by its control parameters. To enhance the search efficiency, an adaptive harmony search with best-based search strategy (ABHS) is proposed. In the search process, ABHS exploits the beneficial information from the global-best solution to improve the search ability, while it adaptively tunes its control parameters according to the feedback from the search process. Experiments are conducted on a set of classical test functions. The experimental results show that ABHS significantly enhances the search efficiency of HS.