计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (19): 51-54.DOI: 10.3778/j.issn.1002-8331.2010.19.014

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

多种群粒子群优化算法

罗德相,周永权,黄华娟,韦杏琼   

  1. 广西民族大学数学与计算机科学学院,南宁530006
  • 收稿日期:2009-01-04 修回日期:2009-03-17 出版日期:2010-07-01 发布日期:2010-07-01
  • 通讯作者: 罗德相

Multi-colony particle swarm optimization algorithm

LUO De-xiang,ZHOU Yong-quan,HUANG Hua-juan,WEI Xing-qiong   

  1. College of Mathematics and Computer Science,Guangxi University for Nationalities,Nanning 530006,China
  • Received:2009-01-04 Revised:2009-03-17 Online:2010-07-01 Published:2010-07-01
  • Contact: LUO De-xiang

摘要: 将一定规模的粒子群平分成三个子群,并分别按基本粒子优化算法、ω自线性调整策略的粒子群算法和云自适应粒子群算法三种不同规则进化,既保持各个子群和算法的独立性和优越性,又不增加算法的复杂性,并提出“超社会”部分,重新定义了速度更换式子,同时还引入了扩张变异方法和扰动操作。实验仿真结果表明,给出算法的全局搜索能力、收敛速度,精度和稳定性均有了显著提高。

Abstract: A certain number particle swarm is subdivided into three equal groups,then they evolve with different rules,
which are particle swarm optimizer,a modified particle swam optimizer and a cloud adaptive particle swarm optimizer.It not
only keeps the independence of the particle swarm and the superiority of the optimizer,but also not increases the complexity
of algorithm.Meanwhile,the super-society parts are put forward and then the velocity formula is redefined.At the same
time,variation expansion methods and disturbance operation are introduced.The experimental results show that the new algorithm
has advantages of convergence property,convergence speed,accuracy and the stability of convergence effective.

中图分类号: