一种改进的双群粒子群优化算法

Ting Li, X. Lai, Min Wu
{"title":"一种改进的双群粒子群优化算法","authors":"Ting Li, X. Lai, Min Wu","doi":"10.1109/WCICA.2006.1712943","DOIUrl":null,"url":null,"abstract":"Basic particle swarm optimization (PSO) algorithm are susceptible to being trapped into local optimum and premature convergence happens. Inspired by the idea of genetic algorithm (GA), a new two-swarm based PSO algorithm (TSPSO) with roulette wheel selection is proposed. With different parameter settings, the two swarms have different flying trajectory, explore solution space as possible as they can, and enhance the global exploration ability. Roulette-wheel-selection based stochastic selection scheme make particles searching in the neighborhood of better feasible solution intensively and enhances the local exploitation ability. The proposed algorithm is tested on three benchmark test functions. The results show that the proposed algorithm is superior to PSO and GA in the solution of complex optimization problems","PeriodicalId":375135,"journal":{"name":"2006 6th World Congress on Intelligent Control and Automation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"An Improved Two-Swarm Based Particle Swarm Optimization Algorithm\",\"authors\":\"Ting Li, X. Lai, Min Wu\",\"doi\":\"10.1109/WCICA.2006.1712943\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Basic particle swarm optimization (PSO) algorithm are susceptible to being trapped into local optimum and premature convergence happens. Inspired by the idea of genetic algorithm (GA), a new two-swarm based PSO algorithm (TSPSO) with roulette wheel selection is proposed. With different parameter settings, the two swarms have different flying trajectory, explore solution space as possible as they can, and enhance the global exploration ability. Roulette-wheel-selection based stochastic selection scheme make particles searching in the neighborhood of better feasible solution intensively and enhances the local exploitation ability. The proposed algorithm is tested on three benchmark test functions. The results show that the proposed algorithm is superior to PSO and GA in the solution of complex optimization problems\",\"PeriodicalId\":375135,\"journal\":{\"name\":\"2006 6th World Congress on Intelligent Control and Automation\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 6th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2006.1712943\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 6th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2006.1712943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

基本粒子群优化算法容易陷入局部最优,容易出现过早收敛。摘要受遗传算法思想的启发,提出了一种新的基于双群的轮盘赌轮选择粒子群优化算法。在不同的参数设置下,两个蜂群具有不同的飞行轨迹,尽可能地探索解空间,增强全局探索能力。基于轮盘-轮选择的随机选择方案使粒子在较优可行解的邻域中集中搜索,增强了局部开发能力。在三个基准测试函数上对该算法进行了测试。结果表明,该算法在求解复杂优化问题方面优于粒子群算法和遗传算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Two-Swarm Based Particle Swarm Optimization Algorithm
Basic particle swarm optimization (PSO) algorithm are susceptible to being trapped into local optimum and premature convergence happens. Inspired by the idea of genetic algorithm (GA), a new two-swarm based PSO algorithm (TSPSO) with roulette wheel selection is proposed. With different parameter settings, the two swarms have different flying trajectory, explore solution space as possible as they can, and enhance the global exploration ability. Roulette-wheel-selection based stochastic selection scheme make particles searching in the neighborhood of better feasible solution intensively and enhances the local exploitation ability. The proposed algorithm is tested on three benchmark test functions. The results show that the proposed algorithm is superior to PSO and GA in the solution of complex optimization problems
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Decentralized Robust H∞Output Feedback Control for Value Bounded Uncertain Large-scale Interconnected Systems Predictions of System Marginal Price of Electricity Using Recurrent Neural Network Data Association Method Based on Fractal Theory Periodicity Locomotion Control Based on Central Pattern Generator An Improved Fuzzy Fault Diagnosis Method for Complex System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1