首页 | 本学科首页   官方微博 | 高级检索  
     

粒子群优化算法分析
引用本文:姚耀中,徐玉如.粒子群优化算法分析[J].哈尔滨工程大学学报,2007,28(11):1242-1246.
作者姓名:姚耀中  徐玉如
作者单位:哈尔滨工程大学,水下智能机器人实验室,黑龙江,哈尔滨,150001
摘    要:粒子群优化算法是一种基于群体智能的随机全局优化技术,尽管其原理简单易、于实现且功能强大,但目前研究人员还没有对它的工作原理做出足够的解释.将群体优化过程看成一个动态系统的演变,采用线性离散时间系统的分析方法对算法的收敛性进行了分析,导出了简化PSO算法的收敛条件.考虑到参数是影响算法性能和效率的关键因素,利用标准测试函数对算法的参数选择进行了详细的分析,并给出一些指导性原则.

关 键 词:粒子群优化  群体智能  全局优化
文章编号:1006-7043(2007)11-1242-05
修稿时间:2007年8月27日

Parameter analysis of particle swarm optimization algorithm
YAO Yao-zhong,XU Yu-ru.Parameter analysis of particle swarm optimization algorithm[J].Journal of Harbin Engineering University,2007,28(11):1242-1246.
Authors:YAO Yao-zhong  XU Yu-ru
Abstract:Particle swarm optimization(PSO) algorithm is a swarm-intelligence-based stochastic global optimization technique originating from artificial life and evolutionary computation.Though the algorithm has been shown to perform well,the researchers haven't adequately explained how it works.In this paper,the swarm optimization was considered as the evolution of a dynamical system.The convergence property of PSO was analyzed by using the linear discrete time system method.The convergence conditions for simplified PSO algorithm were derived.Since the parameters were very important to the performance and efficiency of PSO,the selection of parameters was systematically discussed through several benchmark functions,and some instructional suggestions were also presented.
Keywords:particle swarm optimization(PSO)  swarn intelligence  global optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号