| 注册
首页|期刊导航|计算机工程与应用|PSO算法全局收敛性分析

PSO算法全局收敛性分析

张慧斌 王鸿斌 胡志军

计算机工程与应用2011,Vol.47Issue(34):61-63,3.
计算机工程与应用2011,Vol.47Issue(34):61-63,3.DOI:10.3778/j.issn.1002-8331.2011.34.015

PSO算法全局收敛性分析

Analysis of Particle Swarm Optimization algorithm global convergence method

张慧斌 1王鸿斌 1胡志军1

作者信息

  • 1. 忻州师范学院 计算机科学与技术系,山西 忻州 034000
  • 折叠

摘要

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.

关键词

PSO算法/随机优化算法/全局收敛性/全局最优解

Key words

PSO algorithm/random optimal algorithm/global convergence/global optimal solution

分类

信息技术与安全科学

引用本文复制引用

张慧斌,王鸿斌,胡志军..PSO算法全局收敛性分析[J].计算机工程与应用,2011,47(34):61-63,3.

基金项目

山西省自然科学基金(the Natural Science Foundation of Shanxi Province of China under Grant No.2009011018-4). (the Natural Science Foundation of Shanxi Province of China under Grant No.2009011018-4)

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文