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

新型分阶段粒子群优化算法
引用本文:曾传华,申元霞.新型分阶段粒子群优化算法[J].计算机工程与应用,2008,44(24):81-82.
作者姓名:曾传华  申元霞
作者单位:1.重庆文理学院 数学与计算机科学系,重庆 402160 2.西南交通大学 信息科学与技术学院,成都 610031
摘    要:针对粒子群优化算法的“早熟”问题,提出了一种新型分阶段粒子群优化算法。该算法通过调整惯性权重和加速系数使粒子自组织地跟踪局部吸引域和全局吸引域来扩大粒子的搜索空间和提高粒子的收敛精度,同时根据粒子处于不同的阶段实施相应的变异策略来增加种群的多样性。通过经典函数的测试结果表明,新算法的全局搜索能力有了显著提高,并且能够有效避免早熟问题。

关 键 词:粒子群优化算法  惯性权重  加速系数  
收稿时间:2007-10-25
修稿时间:2008-1-17  

Novel multistage Particle Swarm Optimization algorithm
ZENG Chuan-hua,SHENG Yuan-xia.Novel multistage Particle Swarm Optimization algorithm[J].Computer Engineering and Applications,2008,44(24):81-82.
Authors:ZENG Chuan-hua  SHENG Yuan-xia
Affiliation:1.Department of Mathematic & Computer Science,Chongqing University of Arts and Science,Chongqing 402160,China 2.Department of Information Science and Technology,Southwest Jiaotong University,Chengdu 610031,China
Abstract:A novel multistage particle swarm optimization is developed for solving premature convergence of particle swarm optimization.The particles are organized to track the domain of attraction of local optimum for enlarging search space and the domain of attraction of global optimum for improving convergence performance by adaptively adjusting the acceleration coefficients and the inertia weight.Meanwhile the corresponding strategies with mutation are adopted in different stages of the new algorithm to further enhance diversity of population.Experimental results for complex function optimization show this algorithm improves the global convergence ability and efficiently prevents the algorithm from the local optimization and early maturation.
Keywords:Particle Swarm Optimization(PSO)  inertia weight  acceleration coefficients
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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