{"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.