A Self-adaptive Artificial Bee Colony Algorithm with Symmetry Initialization

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yu Xue, Jiongming Jiang, Tinghuai Ma, Jingfa Liu, Wei Pang
{"title":"A Self-adaptive Artificial Bee Colony Algorithm with Symmetry Initialization","authors":"Yu Xue, Jiongming Jiang, Tinghuai Ma, Jingfa Liu, Wei Pang","doi":"10.3966/160792642018091905007","DOIUrl":null,"url":null,"abstract":"The Artificial Bee Colony (ABC) algorithm is an optimization algorithm inspired by the foraging behavior of bee swarms. Similar to some evolutionary algorithms, there is a main limitation in ABC, i.e., in many problems, ABC is good at exploration but poor at exploitation. Thus, in order to overcome this limitation and improve the performance of ABC when dealing with various kinds of optimization problems, we proposed a self-adaptive artificial bee colony algorithm with symmetry initialization (SABC-SI). In our SABC-SI algorithm, a novel population initialization method based on half space and symmetry is designed, and such method can increase the diversity of initial solutions. Besides, a self- adaptive search mechanism and several new Candidate Solution Generating Strategies (CSGSes) have also been developed. Consequently, the evolutionary strategies can be selected dynamically according to their search performance. Moreover, the selection operator is improved by eliminating some of the poor solutions and making good use of the two best solutions in both the current and previous generations. The novel algorithm was tested on 25 different benchmark functions. The experimental results show that SABC-SI outperforms several state-of-the-art algorithms, which indicates that it has great potential to be applied to a wide range of optimization problems.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1347-1362"},"PeriodicalIF":0.9000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3966/160792642018091905007","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 4

Abstract

The Artificial Bee Colony (ABC) algorithm is an optimization algorithm inspired by the foraging behavior of bee swarms. Similar to some evolutionary algorithms, there is a main limitation in ABC, i.e., in many problems, ABC is good at exploration but poor at exploitation. Thus, in order to overcome this limitation and improve the performance of ABC when dealing with various kinds of optimization problems, we proposed a self-adaptive artificial bee colony algorithm with symmetry initialization (SABC-SI). In our SABC-SI algorithm, a novel population initialization method based on half space and symmetry is designed, and such method can increase the diversity of initial solutions. Besides, a self- adaptive search mechanism and several new Candidate Solution Generating Strategies (CSGSes) have also been developed. Consequently, the evolutionary strategies can be selected dynamically according to their search performance. Moreover, the selection operator is improved by eliminating some of the poor solutions and making good use of the two best solutions in both the current and previous generations. The novel algorithm was tested on 25 different benchmark functions. The experimental results show that SABC-SI outperforms several state-of-the-art algorithms, which indicates that it has great potential to be applied to a wide range of optimization problems.
对称初始化的自适应人工蜂群算法
人工蜂群(ABC)算法是一种受蜂群觅食行为启发的优化算法。与一些进化算法类似,ABC也有一个主要的局限性,即在许多问题中,ABC善于探索,但不善于开发。因此,为了克服这一限制,提高ABC在处理各种优化问题时的性能,我们提出了一种具有对称初始化的自适应人工蜂群算法(SABC-SI)。在我们的SABC-SI算法中,设计了一种新的基于半空间和对称性的种群初始化方法,这种方法可以增加初始解的多样性。此外,还开发了一种自适应搜索机制和几种新的候选解决方案生成策略。因此,进化策略可以根据它们的搜索性能来动态选择。此外,通过消除一些较差的解决方案并充分利用当前和上一代中的两个最佳解决方案,对选择算子进行了改进。该新算法在25个不同的基准函数上进行了测试。实验结果表明,SABC-SI优于几种最先进的算法,这表明它在广泛的优化问题中具有巨大的应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Internet Technology
Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
3.20
自引率
18.80%
发文量
112
审稿时长
13.8 months
期刊介绍: The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.
×
引用
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学术官方微信