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

计算机工程 ›› 2007, Vol. 33 ›› Issue (18): 222-223,. doi: 10.3969/j.issn.1000-3428.2007.18.078

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

一种基于种群熵的自适应粒子群算法

段晓东1,3,高红霞2,3,刘向东3,张学东2   

  1. (1. 东北大学信息科学与工程学院,沈阳 110004;2. 鞍山科技大学计算机科学与工程学院,鞍山 114044; 3. 大连民族学院非线性信息技术研究所,大连 116600 )
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-20 发布日期:2007-09-20

Adaptive Particle Swarm Optimization Algorithm Based on Population Entropy

DUAN Xiao-dong 1,3, GAO Hong-xia 2,3, LIU Xiang-dong 3, ZHANG Xue-dong2   

  1. (1. Faculty of Information Science and Engineering, Northeastern University, Shenyang 110004; 2. Faculty of Computer Science and Engineering, Anshan University of Science and Technology, Anshan 114044; 3. Research Institute of Nonlinear Information Technology, Dalian Nationalities University, Dalian 116600)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-20 Published:2007-09-20

摘要: 提出了一种基于种群熵的自适应粒子群算法,采用2个基准函数对新算法进行了测试。测试结果表明,新算法有效地均衡了算法的探测和开采能力,在解决复杂多峰函数优化问题时,与基本粒子群算法相比,具有更强的摆脱局部极值点的能力,且执行效率降低不多。

关键词: 群智能, 粒子群优化, 种群熵, 元胞

Abstract: This paper proposes an adaptive particle swarm optimization algorithm and two benchmarks are used to test it. The results show that the algorithm can keep good balance between the exploration and the exploitation. When solving the problem of multi-modal function optimization, the algorithm has better capability of jumping out of local optimum than basic particle swarm optimization algorithm, and the executing efficiency does not reduce distinctly.

Key words: swarm intelligence, particle swarm optimization, population entropy, cellular

中图分类号: