Annealing Evolutionary Programming Algorithm and Its Convergence
Qiqiang Li · Jisuanji fangzhen · 2006
Selecting pattern based on ranking in Evolutionary Programming Algorithm causes the population's searching space to become narrower and narrower to some degree,which will result in premature convergence.To this problem,annealing probability formation was introduced into the selection of EP and a new algorithm:annealing EP(AEP)was got.Then the time-dependent Markov chains were described and the convergence of AEP was proved.It is proved that the algorithm always converges globally and the numerical test shows that AEP can converge soon and it can better avoid premature convergence and local optimum.