汤可宗, 柳炳祥, 杨静宇, 孙廷凯. 双中心粒子群优化算法[J]. 计算机研究与发展, 2012, 49(5): 1086-1094.
 引用本文: 汤可宗, 柳炳祥, 杨静宇, 孙廷凯. 双中心粒子群优化算法[J]. 计算机研究与发展, 2012, 49(5): 1086-1094.
Tang Kezong, Liu Bingxiang, Yang Jingyu, Sun Tingkai. Double Center Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2012, 49(5): 1086-1094.
 Citation: Tang Kezong, Liu Bingxiang, Yang Jingyu, Sun Tingkai. Double Center Particle Swarm Optimization Algorithm[J]. Journal of Computer Research and Development, 2012, 49(5): 1086-1094.

## Double Center Particle Swarm Optimization Algorithm

• 摘要: 粒子群优化(PSO)算法是一种新兴的群体智能优化技术,由于其原理简单、参数少、效果好等优点已经广泛应用于求解各类复杂优化问题.而影响该算法收敛速度和精度的2个主要因素是粒子个体极值与全局极值的更新方式.通过分析粒子的飞行轨迹和引入广义中心粒子和狭义中心粒子,提出双中心粒子群优化(double center particle swarm optimization, DCPSO)算法,在不增加算法复杂度条件下对粒子的个体极值和全局极值更新方式进行更新,从而改善了算法的收敛速度和精度.采用Rosenbrock和Rastrigrin等6个经典测试函数,按照固定迭达次数和固定时间长度运行2种方式进行测试,验证了新算法的可行性和有效性.

Abstract: Particle swarm optimization (PSO) algorithm is a new promising swarm intelligence optimization technology, and it has been extensively applied to solve all kinds of complex optimization problems because of its advantages of simpler theory, less parameter and better performance. However, each particle's individual minimum and population's minimum are two major factors to affect the algorithm's convergence speed and precision. This paper proposes a double center particle swarm optimization algorithm (DCPSO). We analyze particle's flying trajectory and introduce general center particle and special center particle in the DCPSO, which consequently improves PSO algorithm's converging speed and precision without increasing computing complexity. Six classical test functions, including Rosenbrock, Rastrigrin and so on, are used to verify the proposed algorithm in two ways: fixed iteration number test and fixed time length test. Experimental results show that the proposed algorithm is feasible and efficient.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈