Particle swarm optimization with a novel mutation operator

Lei Chen
{"title":"Particle swarm optimization with a novel mutation operator","authors":"Lei Chen","doi":"10.1109/MEC.2011.6025626","DOIUrl":null,"url":null,"abstract":"Particle swarm optimization (PSO) is a recently proposed intelligent algorithm which is motivated by swarm intelligence. PSO has been shown to perform well on many benchmark and real-world optimization problems, it easily falls into local optima when solving complex multimodal problems. This paper aims to enhance the performance of PSO in complex optimization problems and proposes an improved PSO variant by incorporating a novel mutation operator. Experimental studies on some well-known benchmark problems show that our approach achieves promising results.","PeriodicalId":386083,"journal":{"name":"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEC.2011.6025626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Particle swarm optimization (PSO) is a recently proposed intelligent algorithm which is motivated by swarm intelligence. PSO has been shown to perform well on many benchmark and real-world optimization problems, it easily falls into local optima when solving complex multimodal problems. This paper aims to enhance the performance of PSO in complex optimization problems and proposes an improved PSO variant by incorporating a novel mutation operator. Experimental studies on some well-known benchmark problems show that our approach achieves promising results.
一种新型变异算子的粒子群优化
粒子群优化(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学术官方微信