Roulette selection self adaptive harmony search algorithm

This paper proposed a roulette selection self adaptive harmony search algorithm for solving numerical optimization problems.It replaced the completely random choice of harmony search(HS) algorithm and the greedy choice of global best harmony search(GHS) algorithm with roulette selection in order to speed up convergence of HS and also to avoid premature of GHS.As for parameters setting,it involved population fitness variance to generate the parameter PAR,and then designed an automatic step adjustment according to harmony information,scope of variable and current iteration number.It designed a special function to prove effectiveness of roulette selection mechanism and the premature of GHS,further simulations of four functions show that the proposed algorithm is superior in convergence speed and precision to the HS and IHS algorithm.