Capitalizing Diversity for Efficiency Enhancement in Multi-Population Swarm Algorithms

R. Chaudhary, H. Banati
{"title":"Capitalizing Diversity for Efficiency Enhancement in Multi-Population Swarm Algorithms","authors":"R. Chaudhary, H. Banati","doi":"10.1109/icccnt45670.2019.8944872","DOIUrl":null,"url":null,"abstract":"Swarm algorithms are an efficient means to optimize various real-life problems. Their efficiency is influenced by diversity, which helps it to escape any local optima. There are multiple ways to increase diversity like mutation, repulsion, multi-population, replacement, etc. Of these, multi-population and replacement based techniques work without changing the internal functioning of any algorithm. In this paper we study three different replacement based techniques for multi-population swarm algorithms. The paper also proposes techniques (variant/new) to improve diversity in a multi-population scenario. All the techniques:-studied and proposed are subsequently tested with bat algorithm over 30 benchmark functions. The most efficient amongst them is further tested over six other swarm algorithms. The comparative results indicate that the identified technique is significantly better in terms of efficiency and diversity for most algorithms. Hence it can be concluded that it is an efficient means to improve the diversity and efficiency of a multi-population swarm algorithm.","PeriodicalId":438405,"journal":{"name":"2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icccnt45670.2019.8944872","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Swarm algorithms are an efficient means to optimize various real-life problems. Their efficiency is influenced by diversity, which helps it to escape any local optima. There are multiple ways to increase diversity like mutation, repulsion, multi-population, replacement, etc. Of these, multi-population and replacement based techniques work without changing the internal functioning of any algorithm. In this paper we study three different replacement based techniques for multi-population swarm algorithms. The paper also proposes techniques (variant/new) to improve diversity in a multi-population scenario. All the techniques:-studied and proposed are subsequently tested with bat algorithm over 30 benchmark functions. The most efficient amongst them is further tested over six other swarm algorithms. The comparative results indicate that the identified technique is significantly better in terms of efficiency and diversity for most algorithms. Hence it can be concluded that it is an efficient means to improve the diversity and efficiency of a multi-population swarm algorithm.
利用多样性提高多种群群算法的效率
群算法是优化各种现实问题的有效手段。它们的效率受到多样性的影响,这有助于它们摆脱任何局部最优。有多种方法可以增加多样性,如突变、排斥、多种群、替代等。其中,基于多种群和替换的技术在不改变任何算法内部功能的情况下工作。本文研究了三种不同的基于替换的多种群群算法。本文还提出了在多种群情景下提高多样性的技术(变体/新技术)。研究和提出的所有技术随后都用bat算法在30多个基准函数上进行了测试。其中最有效的算法将在其他六种群算法上进行进一步测试。对比结果表明,该识别方法在效率和多样性方面明显优于大多数算法。由此可见,这是提高多种群群算法的多样性和效率的有效手段。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书