A Study of Harmony Search Algorithm Based CEC2014 Benchmark Functions
As a group-based intelligent optimization algorithm,the harmony search(HS)algorithm attracts continuous attention from many researchers due to its advantages of fewer control parameters,strong robustness,and simple structure,etc.However,with the continuous deepening of the research work,HS has the weaknesses of premature convergence and easily falling into the local optimum.To solve the drawbacks of HS,many researchers from home and abroad propose a series of improved HSs.According to the improvement ideas,the improved HSs can be summarized into 3 types,which include improvements of setting control parameters,the search operator,and combining with other algorithms.In addition,a comparison experiment is designed on the CEC2014 benchmark functions to compare the performance of five representative HSs.Afterwards,the performances of five representative HSs on unimodal,multimodal,hybrid,and composition functions are analyzed based on the experimental results.Suggestions for five representative HSs in engineering optimization problems with different function types are provided.
万方数据
维普
