A RESILIENT PARTICLE SWARM OPTIMIZATION ALGORITHM BASED ON CHAOS AND APPLYING IT TO OPTIMIZE THE FERMENTATION PROCESS
Gao Leifu, Xuwang Liu · 2009
Abstract. When an individual is closed to the optimal particle, its velocity will approximate to zero. This is the main reason why the particle swarm optimization algorithm is prone to trap into local minima, therefore using a strategy in which the velocity is not dependent on the size of distance between the individual and the optimal particle but only dependent on its direction, an adaptive scheme is adopted to adjust the magnitude of the velocity re-siliently. At the sametime, by making the best of the ergodicity, stochastic property and regularity of chaos. A resilient particle swarm global optimiza-tion algorithm based on chaos is proposed, succeed in applying it to optimize the fermentation process, demonstrate that the new algorithm has the ability to avoid being trapped in local minima, and improves computational precision and convergence ratio. Key Words. operational research, nonlinear optimization, global optimiza-tion, particle swarm,chaos optimization and resilient adjustment.