Modified particle swarm optimization algorithm
一种改进的微粒群算法*

To deal with the problem of premature convergence and slow search speed,this paper proposed a new particle swarm optimization(PSO).The new method was based on clearing of mines,which was guaranteed to converge to the global optimization solution with probability one.In addition,combined the new method with rotating direction method,which was beneficial for the convergence speed. Through the calculation of three typical function, and made comparison with other improvement particle swarm optimization algorithm, they show that the new method which solves the problem of premature convergence and slow search speed.