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

基于两阶段策略的粒子群优化研究
引用本文:徐俊杰,忻展红. 基于两阶段策略的粒子群优化研究[J]. 北京邮电大学学报, 2007, 29(1): 136-139
作者姓名:徐俊杰  忻展红
作者单位:北京邮电大学,经济管理学院,北京,100876
摘    要:提出了一种基于传统粒子群优化的两阶段实施方案,通过对一组测试函数的仿真表明,该方案以适当增加的计算量为代价,提高了搜索成功率. 对比实验表明,两阶段方案几乎在各种最大可迭代次数的约束下都能获得更好的搜索成功率,且对学习速度参数的敏感性降低,算法的搜索性能更稳健.实施该策略时原则上子群数量宜选取一个适中的数值,以综合考虑可靠性与计算成本两个因素.

关 键 词:粒子群优化  优化算法  全局优化  计算智能  群体智能
文章编号:1007-5321(2007)01-0136-04
收稿时间:2006-03-10
修稿时间:2006-03-10

Research of Particle Swarm Optimization Based on a Two-Stage Strategy
XU Jun-jie,XIN Zhan-hong. Research of Particle Swarm Optimization Based on a Two-Stage Strategy[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 29(1): 136-139
Authors:XU Jun-jie  XIN Zhan-hong
Affiliation:Economics and Management School, Beijing University of Posts and Telecommunications, Beijing 100876, China
Abstract:A two-stage implementation strategy based on canonical particle swarm optimization was proposed. With the cost of acceptably additional evaluations, this strategy achieved higher success rate which were demonstrated by a suite of benchmark functions. The simulation showed that two-stage implementation strategy could bring forward relatively higher success rate under different upper limita- tion of iterations. At the same time the proposed strategy reduced the sensitivity of learning rate and presented a stable performance. It was revealed experimentally that the number of sub-populations should be set at a moderate value to consider both the reliability and the computation cost.
Keywords:particle swarm optimization   optimization algorithm   global optimization   computational intelligence   swarm intelligence
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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