计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (3): 34-37.DOI: 10.3778/j.issn.1002-8331.2011.03.010

• 研究、探讨 • 上一篇    下一篇

质心粒子群优化算法

汪永生,李均利   

  1. 宁波大学 信息与工程学院,浙江 宁波 315211
  • 收稿日期:2009-05-11 修回日期:2009-07-03 出版日期:2011-01-21 发布日期:2011-01-21
  • 通讯作者: 汪永生

Centroid particle swarm optimization algorithm

WANG Yongsheng,LI Junli   

  1. Information and Engineering College,Ningbo University,Ningbo,Zhejiang 315211,China
  • Received:2009-05-11 Revised:2009-07-03 Online:2011-01-21 Published:2011-01-21
  • Contact: WANG Yongsheng

摘要: 为了加快粒子群算法收敛速度,提出了质心粒子群优化算法(CPSO)。算法通过计算种群所有个体最优记录所构成的一个群体的质心,对种群个体当前的最优记录和全局最优记录进行比较、替换或更新等操作,从而加快算法的收敛速度。仿真实验表明,在求解相同精度的情况下,质心粒子群优化算法的收敛速度优于线性递减惯性权重粒子群优化算法(LDWPSO)。

关键词: 粒子群优化算法, 质心, 收敛速度

Abstract: In order to improve convergence speed of Particle Swarm Optimization(PSO),Centroid Particle Swarm Optimization Algorithm(CPSO) is presented.Computing the centroid of the population consisted of all individuals’ best records,all the current individuals’best records and the global record are compared,replaced or updated by it.The method can mainly pick up convergence speed of the algorithm.Simulation results show that CPSO is much better than Linear Decreasing Weight PSO(LDWPSO) in convergence speed in the same accuracy of solution case.

Key words: Particle Swarm Optimization(PSO), centroid, convergence speed

中图分类号: