| 一种保证全局收敛的PSO算法 |
| |
| 引用本文： | 曾建潮,崔志华.一种保证全局收敛的PSO算法[J].计算机研究与发展,2004,41(8):1333-1338. |
| |
| 作者姓名： | 曾建潮 崔志华 |
| |
| 作者单位： | 太原重型机械学院系统仿真与计算机应用研究所,太原,030024 |
| |
| 基金项目： | 教育部科学技术研究重点项目 ( 2 0 40 18) |
| |
| 摘 要： | 在对基本PSO算法分析的基础上，提出了一种能够保证以概率1收敛于全局最优解的PSO算法——随机PSO算法(stochastic PSO，SPSO)，并利用Solis和Wets的研究结果对其全局收敛性进行了理论分析，给出了两种停止进化微粒的重新产生方法．最后以典型优化问题的实例仿真验证了SPSO算法的有效性．
|
| 关 键 词： | 微粒群算法（PSO算法） 全局最优性 收敛性 模拟退火 |
A Guaranteed Global Convergence Particle Swarm Optimizer |
| |
| ZENG Jian-Chao and CUI Zhi-Hua.A Guaranteed Global Convergence Particle Swarm Optimizer[J].Journal of Computer Research and Development,2004,41(8):1333-1338. |
| |
| Authors: | ZENG Jian-Chao and CUI Zhi-Hua |
| |
| Abstract: | A new particle swarm optimizer, called stochastic PSO, that is guaranteed to converge to the global optimization solution with probability one, is presented based on the analysis of the standard PSO. And the global convergence analysis is made using the Solis and Wets' research results, and two methods of stopping evolution particle to be regenerated are given. Finally, several examples are simulated to show that SPSO is more efficient than the standard PSO. |
| |
| Keywords: | particle swarm optimizer global optimility convergence simulated annealing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
