全局最优位置变异粒子群优化算法

The Particle Swarm Optimization Algorithm of Global Optimum Location Mutation

针对粒子群优化算法的早熟收敛,容易陷入局部最优且搜索精度不高等缺点,在现有的粒子群优化算法的基础上对其进行了若干改进,提出了避免微粒群陷入局部最优的全局最优位置变异的粒子群算法,并与其他算法做了比较,体现了其优越性.

In order to overcome some disadvantages of PSO such as being easily trapped in the local optimum, easily being premature and having bad local search capability, this paper puts forward some relevant strategies on the basis of the current PSO. In order to avoid being trapped in the local optimum, a new global optimum location mutation PSO algorithm is proposed. It has priority over the other algorithms.