Escapable particle swarm optimization based on simulated annealing algorithm
基于模拟退火算法的可逃逸粒子群算法

This paper guaranteed to converge to the globe optimum by using the simulated annealing algorithm,when the optimum information of the warm was stagnant,the position escapable mechanism could maintain the characteristic of fast speed in the early convergence phase.Experimental simulations show that the proposed method can not only effectively converge to the globe optimum,but also significantly speed up the convergence.