计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (34): 61-63.

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

PSO算法全局收敛性分析

张慧斌,王鸿斌,胡志军   

  1. 忻州师范学院 计算机科学与技术系,山西 忻州 034000
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-12-01 发布日期:2011-12-01

Analysis of Particle Swarm Optimization algorithm global convergence method

ZHANG Huibin,WANG Hongbin,HU Zhijun   

  1. Department of Computer Science and Technology,Xinzhou Teachers College,Xinzhou,Shanxi 034000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-12-01 Published:2011-12-01

摘要: 为了解决PSO算法能否搜索到全局最优解这类主要理论问题,对随机优化算法的全局收敛性准则作了详细解释,并应用此全局收敛性准则对PSO算法的全局收敛性进行了理论分析;指出了PSO算法并不满足随机优化算法的全局收敛性准则应具备的两个条件,并证明了PSO算法是不能保证全局收敛的。

关键词: PSO算法, 随机优化算法, 全局收敛性, 全局最优解

Abstract: In order to find out whether the PSO algorithm can search for global optimal solution,detailed explanation to global convergence criteria of random optimal algorithm is made.The theoretical analysis of global convergence of PSO algorithm is also done applying this global convergence criteria.The result of the PSO algorithm does not satisfy two conditions which the global convergence criteria of random optimization algorithm should have.This paper proves that the PSO algorithm does not guarantee global convergence.

Key words: PSO algorithm, random optimal algorithm, global convergence, global optimal solution