Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (30): 59-61.

• 学术探讨 • Previous Articles     Next Articles

Cooperative particle swarm optimization algorithm based on particle’s spatial extension

LAO Ling-ying,HU Xiao-bing   

  1. School of Mathematics & Science,Chongqing University,Chongqing 400044,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-21 Published:2007-10-21
  • Contact: LAO Ling-ying

基于粒子空间扩展的协同微粒群优化算法

劳玲英,胡小兵   

  1. 重庆大学 数理学院,重庆 400044
  • 通讯作者: 劳玲英

Abstract: Aiming at the stagnation exists in the cooperative particle swarm optimization,presents a new kind of the cooperative particle swarm optimization algorithm based on particle’s spatial extension.This algorithm can decide whether or not collision happens between particles by introducing the radius of particle.Once two particles collide,they can jump out of their original location according to location update formula given in advance,which can avoid trapping in stagnation.The test of the new algorithm on three typical functions shows that new algorithm not only can conquer the stagnation effectively,but can effectively improve the ability of searching better solutions and robustness.

摘要: 针对协同微粒群优化存在的停滞现象,提出了一种新的基于粒子空间扩展的协同微粒群优化算法。该算法通过引入粒子半径来确定粒子间是否发生相互碰撞,如果两个粒子一旦发生碰撞,则按预先设定的位置更新公式跳出原来的位置,从而避免陷入停滞状态。对三个典型函数的测试结果表明,新算法不仅能够有效地克服了停滞现象,而且显著提高了搜索更优解的能力和鲁棒性。