多粒子角色协同作用的混合粒子群优化算法.docVIP

多粒子角色协同作用的混合粒子群优化算法 　　摘要：针对粒子群优化（PSO）算法易陷入局部最优和后期收敛速度慢的问题，提出一种多粒子角色协同作用的混合粒子群算法（MPRPSO）。引入粒子角色的概念，将种群粒子分成探索粒子（EP）、巡逻粒子（PP）和局部开发粒子（LEP）三类角色，在每次迭代中利用探索粒子以标准PSO算法搜索解空间，用基于混沌的巡逻粒子加强全局搜索，并在陷入局部最优时替代部分探索粒子，恢复种群活力。最后通过局部开发粒子的单维异步邻域搜索加强算法局部搜索能力，加快收敛。实验独立运行30次，所提算法在粒子角色比例为0.8∶0.1∶0.1的条件下，在Sphere、Rosenbrock、Ackley和Quadric函数中获得的平均值分别为2.352E-72、4.678E-29、7.780E-14和2.909E-14，尤其在Rastrigrin与Griewank函数中能收敛到最优解0，优于其他对比算法。实验结果表明，所提算法在优化性能上有所提高，并有一定的鲁棒性。 　　关键词：粒子群优化算法；粒子角色；混沌；邻域搜索；协同 　　中图分类号： TP301.6； TP18 　　文献标志码：A 　　Abstract： Concerning the problem that Particle Swarm Optimization （PSO） falls into local minima easily and converges slowly at the last stage， a kind of hybrid PSO algorithm with cooperation of multiple particle roles （MPRPSO） was proposed. The concept of particle roles was introduced into the algorithm to divide the population into three roles： Exploring Particle （EP）， Patrolling Particle （PP） and Local Exploiting Particle （LEP）. In each iteration， EP was used to search the solution space by the standard PSO algorithm， and then PP which was based on chaos was used to strengthen the global search capability and replace some EPs to restore population vitality when the algorithm trapped in local optimum. Finally， LEP was used to strengthen the local search to accelerate convergence by unidimensional asynchronous neighborhood search. The 30 times independent runs in the experiment show that， the proposed algorithm in the conditions that particle roles ratio is 0.8∶0.1∶0.1 has the mean value of 2.352E-72，4.678E-29，7.780E-14 and 2.909E-14 respectively in Sphere， Rosenbrock， Ackley and Quadric， and can converge to the optimal solution of 0 in Rastrigrin and Griewank， which is better than the other contrastive algorithms. The experimental results show that proposed algorithm improves the optimal performance with certain robustness. 　　Key words： Particle Swarm Optimization （PSO） algorithm； particle role； chaos； neighborhood search； cooperation 　　0引言 　　粒子群优化（Particle