Particle Swarm Optimization Based on Self-adaptive Acceleration Factors

Gai-yun Wang, Dong-xue Han
{"title":"Particle Swarm Optimization Based on Self-adaptive Acceleration Factors","authors":"Gai-yun Wang, Dong-xue Han","doi":"10.1109/WGEC.2009.55","DOIUrl":null,"url":null,"abstract":"The particle swarm optimization (PSO), which goes right after Ant Colony Algorithm, is another new swarm intelligence algorithm. PSO has the same drawbacks as other optimization algorithms in spite of its predominance in some fields. That is easily falling into local optimization solution and low convergence velocity in the final stage. An improved algorithm called acceleration factors self-adaptive PSO (ASAPSO) was proposed for the drawbacks. The constant acceleration coefficients in the standard PSO were changed into self-adaptive acceleration factors in the progress of evolution. By controlling the acceleration factors, the particles have stronger global search capability in the early stage and are less likely to be impacted by the current global optimum position and the particles fly to global optimum position more rapidly in the final stage, thus achieved enhanced the convergence velocity. From the numerous experimental results on 4 widely used benchmark functions, we can show that ASAPSO outperforms other three improved PSO.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third International Conference on Genetic and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WGEC.2009.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The particle swarm optimization (PSO), which goes right after Ant Colony Algorithm, is another new swarm intelligence algorithm. PSO has the same drawbacks as other optimization algorithms in spite of its predominance in some fields. That is easily falling into local optimization solution and low convergence velocity in the final stage. An improved algorithm called acceleration factors self-adaptive PSO (ASAPSO) was proposed for the drawbacks. The constant acceleration coefficients in the standard PSO were changed into self-adaptive acceleration factors in the progress of evolution. By controlling the acceleration factors, the particles have stronger global search capability in the early stage and are less likely to be impacted by the current global optimum position and the particles fly to global optimum position more rapidly in the final stage, thus achieved enhanced the convergence velocity. From the numerous experimental results on 4 widely used benchmark functions, we can show that ASAPSO outperforms other three improved PSO.
基于自适应加速因子的粒子群优化
粒子群算法(PSO)是继蚁群算法之后发展起来的又一种新型群体智能算法。粒子群优化算法虽然在某些领域占有优势地位,但与其他优化算法一样存在着不足。在最后阶段容易陷入局部最优解,收敛速度慢。针对其不足,提出了一种改进的加速因子自适应粒子群算法(ASAPSO)。在进化过程中,标准粒子群中的恒定加速度系数转变为自适应加速度因子。通过控制加速度因子,粒子在早期具有更强的全局搜索能力,不容易受到当前全局最优位置的影响,粒子在后期更快地飞向全局最优位置,从而提高了收敛速度。从4个广泛使用的基准函数的大量实验结果可以看出,ASAPSO优于其他三种改进的PSO。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信