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

计算机工程 ›› 2010, Vol. 36 ›› Issue (4): 193-194. doi: 10.3969/j.issn.1000-3428.2010.04.067

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

动态粒子群优化算法

于雪晶1,麻肖妃2,夏 斌2   

  1. (1. 长春工业大学信息传播工程学院,长春 130012;2. 94580部队,蚌埠 233000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-02-20 发布日期:2010-02-20

Dynamic Particle Swarm Optimization Algorithm

YU Xue-jing1, MA Xiao-fei2, XIA Bin2   

  1. (1. College of Information Broadcast Engineering, Changchun Industry University, Changchun 130012; 2. 94580 Army, Bengbu 233000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-02-20 Published:2010-02-20

摘要: 针对普通粒子群优化算法难以在动态环境下有效逼近最优位置的问题,提出一种动态粒子群优化算法。设置敏感粒子和响应阈值,当敏感粒子的适应度值变化超过响应阈值时,按一定比例重新初始化种群和粒子速度。设计双峰DF1动态模型,用于验证该算法的性能,仿真实验结果表明其动态极值跟踪能力较强。

关键词: 粒子群优化算法, 动态, 双峰DF1模型, 敏感粒子

Abstract: Aiming at the problem that normal Particle Swarm Optimization(PSO) algorithm can not approach the best position effectively in dynamic environment, this paper proposes a dynamic PSO algorithm. It sets sensing particle and response threshold. When sensing particle’s fitness change exceeds response threshold, the algorithm reinitializes the swarm and particle velocity. It designs double-hump DF1 dynamic model to validate the capability of this algorithm. Simulation experimental results show that it has high ability of dynamic extremum tracing.

Key words: Particle Swarm Optimization(PSO) algorithm, dynamic, double-hump DF1 model, sensitive particle

中图分类号: