Exploration ability study of harmony search algorithm and its modification
Haibin Ouyang · Control theory & applications · 2014
Harmony search(HS) algorithm often generates solutions that are only local optimal.To conquer this disadvantage,the distance bandwidth adjusting methods that were proposed in recent publications are deeply studied.At first,the exploration ability of HS improvisation is investigated.Secondly,the relationship between improvisation exploration and each parameter under asymmetric interval is deduced.Finally,the effects of the parameter bw on the exploration ability and convergence of HS are discussed,and the iterative convergence sufficiency of the iteration equation which consists of variance expectation and mean expectation is theoretically proven.Based on the above analyses and proof,a modified harmony search(MHS) algorithm is proposed.The effects of the key parameters HMS,PAR and HMCR on the performance of MHS algorithm are also discussed in detail.Experimental results demonstrated that the proposed MHS algorithm has better performance than HS and the other eight state-of-the-art HS variants that were recently proposed.