作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (9): 192-194. doi: 10.3969/j.issn.1000-3428.2010.09.067

• 人工智能及识别技术 • 上一篇    下一篇

一种新的粒子群优化算法

代 军,李 国,徐 晨,陶 艾   

  1. (深圳大学数学与计算科学学院,深圳 518060)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-05-05 发布日期:2010-05-05

New Particle Swarm Optimization Algorithm

DAI Jun, LI Guo, XU Chen, TAO Ai   

  1. (College of Mathematics and Computational Science, Shenzhen University, Shenzhen 518060)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-05-05 Published:2010-05-05

摘要: 针对传统粒子群优化算法容易早熟、收敛精度低等缺点,提出一种改进方案,使用随机惯性权重,在每一次迭代中,对可能陷入局部极值的粒子进行有效的随机初始化。通过对7个经典测试函数的数值仿真实验证明,该新算法能提高粒子群优化算法的寻优能力,并在维数较高时也能获得较好的优化效果。

关键词: 粒子群优化, 权重, 随机初始化

Abstract: To overcome the disadvantages of Particle Swarm Optimization(PSO) algorithm such as premature, bad convergence precision, a new improvement scheme is presented. In the new algorithm, random inertia weight is used, and at each iteration, the particles which may fall into the local extremum area are randomly initialized renewedly in an effective method. The numeric experiments of seven classic benchmark functions indicate that the new algorithm greatly improves the particles’ ability of searching global optimal value, and has good results in higher dimensions.

Key words: Particle Swarm Optimization(PSO), weight, random initialization

中图分类号: