Competition harmony search algorithm with dimension selection for continuous optimization probems

In order to enhance the performance of harmony search algorithm, a competition harmony search algorithm is presented in this paper. The proposed algorithm has three modifications. Firstly, a parallel search mechanism is designed in the improvisation process, which is aim to accelerate searching speed. second, a novel dimension selection strategy is presented for improving searching efficiency. Moreover, estimation of distribution operation is used based on history information. Besides competition updating operation is used to replace the original updating strategy. Experiment results demonstrated that the proposed algorithm has better performance than the state-of-the-art HS algorithms.