Competition-Based Distributed Differential Evolution

Yong-Feng Ge, Wei-jie Yu, Zhi-hui Zhan, Jun Zhang
{"title":"Competition-Based Distributed Differential Evolution","authors":"Yong-Feng Ge, Wei-jie Yu, Zhi-hui Zhan, Jun Zhang","doi":"10.1109/CEC.2018.8477758","DOIUrl":null,"url":null,"abstract":"Differential evolution (DE) is a simple and efficient evolutionary algorithm for global optimization. In distributed differential evolution (DDE), the population is divided into several sub-populations and each sub-population evolves independently for enhancing algorithmic performance. Through sharing elite individuals between sub-populations, effective information is spread. However, the information exchanged through individuals is still too limited. To address this issue, a competition-based strategy is proposed in this paper to achieve comprehensive interaction between sub-populations. Two operators named opposition-invasion and cross-invasion are designed to realize the invasion from good performing sub-populations to bad performing subpopulations. By utilizing opposite invading sub-population, the search efficiency at promising regions is improved by opposition-invasion. In cross-invasion, information from both invading and invaded sub-populations is combined and population diversity is maintained. Moreover, the proposed algorithm is implemented in a parallel master-slave manner. Extensive experiments are conducted on 15 widely used large-scale benchmark functions. Experimental results demonstrate that the proposed competition-based DDE (DDE-CB) could achieve competitive or even better performance compared with several state-of-the-art DDE algorithms. The effect of proposed competition-based strategy cooperation with well-known DDE variants is also verified.","PeriodicalId":212677,"journal":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2018.8477758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Differential evolution (DE) is a simple and efficient evolutionary algorithm for global optimization. In distributed differential evolution (DDE), the population is divided into several sub-populations and each sub-population evolves independently for enhancing algorithmic performance. Through sharing elite individuals between sub-populations, effective information is spread. However, the information exchanged through individuals is still too limited. To address this issue, a competition-based strategy is proposed in this paper to achieve comprehensive interaction between sub-populations. Two operators named opposition-invasion and cross-invasion are designed to realize the invasion from good performing sub-populations to bad performing subpopulations. By utilizing opposite invading sub-population, the search efficiency at promising regions is improved by opposition-invasion. In cross-invasion, information from both invading and invaded sub-populations is combined and population diversity is maintained. Moreover, the proposed algorithm is implemented in a parallel master-slave manner. Extensive experiments are conducted on 15 widely used large-scale benchmark functions. Experimental results demonstrate that the proposed competition-based DDE (DDE-CB) could achieve competitive or even better performance compared with several state-of-the-art DDE algorithms. The effect of proposed competition-based strategy cooperation with well-known DDE variants is also verified.
基于竞争的分布式差异进化
差分进化算法是一种简单、高效的全局优化进化算法。在分布式差分进化(DDE)中,为了提高算法的性能,将种群划分为若干个子种群,每个子种群独立进化。通过在亚种群之间分享精英个体,有效信息得以传播。然而,通过个人交换的信息仍然非常有限。为了解决这一问题,本文提出了一种基于竞争的策略来实现子种群之间的全面互动。设计了对立入侵算子和交叉入侵算子,实现了从表现良好的子种群向表现较差的子种群的入侵。利用对向入侵子群,通过对向入侵提高有希望区域的搜索效率。在交叉入侵中,入侵亚种群和被入侵亚种群的信息相互结合,保持了种群的多样性。此外,该算法采用主从并行方式实现。对15个广泛使用的大规模基准函数进行了大量的实验。实验结果表明,与几种最先进的DDE算法相比,本文提出的基于竞争的DDE (DDE- cb)算法可以达到竞争甚至更好的性能。并验证了所提出的基于竞争的策略与知名DDE变体的合作效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信