Improving artificial Bee colony algorithm using a new neighborhood selection mechanism

被引:126
作者
Wang, Hui [1 ]
Wang, Wenjun [2 ]
Xiao, Songyi [1 ]
Cui, Zhihua [3 ]
Xu, Minyang [1 ]
Zhou, Xinyu [4 ]
机构
[1] Nanchang Inst Technol, Jiangxi Prov Key Lab Water Informat Cooperat Sens, Nanchang 330099, Jiangxi, Peoples R China
[2] Nanchang Inst Technol, Sch Business Adm, Nanchang 330099, Jiangxi, Peoples R China
[3] Taiyuan Univ Sci & Technol, Sch Comp Sci & Technol, Taiyuan 030024, Shanxi, Peoples R China
[4] Jiangxi Normal Univ, Coll Comp & Informat Engn, Nanchang 330022, Jiangxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Artificial bee colony (ABC); Neighborhood selection; Probability selection; Ring topology; Opposition-based learning; Optimization; PARTICLE SWARM OPTIMIZATION; FIREFLY ALGORITHM; STRATEGY;
D O I
10.1016/j.ins.2020.03.064
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Artificial bee colony (ABC) and its most modifications use a probability method to select good food sources (called solutions) in the onlooker bee search phase. However, the probability selection does not work with increasing of iterations, because the fitness values cannot be used to distinguish two different solutions. In order to tackle this problem, this paper proposes a new ABC (called NSABC), in which a new selection method based on neighborhood radius is used. Unlike the probability selection in the original ABC, NSABC chooses the best solution in the neighborhood radius to generate offspring. Based on the neighborhood radius, two new solution search strategies are modified. The scout bee search phase is improved by using opposition-based learning and the neighborhood radius. To evaluate the search ability of NSABC, there are 22 benchmark problems used in the experiments. Performance comparison shows NSABC achieves better results than five other ABC algorithms. Keywords: Artificial bee colony (ABC) Neighborhood selection Probability selection Ring topology Opposition-based learning Optimization (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:227 / 240
页数:14
相关论文
共 49 条
[41]   Multi-strategy ensemble artificial bee colony algorithm [J].
Wang, Hui ;
Wu, Zhijian ;
Rahnamayan, Shahryar ;
Sun, Hui ;
Liu, Yong ;
Pan, Jeng-shyang .
INFORMATION SCIENCES, 2014, 279 :587-603
[42]   Gaussian Bare-Bones Differential Evolution [J].
Wang, Hui ;
Rahnamayan, Shahryar ;
Sun, Hui ;
Omran, Mahamed G. H. .
IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (02) :634-647
[43]   Diversity enhanced particle swarm optimization with neighborhood search [J].
Wang, Hui ;
Sun, Hui ;
Li, Changhe ;
Rahnamayan, Shahryar ;
Pan, Jeng-shyang .
INFORMATION SCIENCES, 2013, 223 :119-135
[44]   An Improved Artificial Bee Colony Algorithm Based on Elite Strategy and Dimension Learning [J].
Xiao, Songyi ;
Wang, Wenjun ;
Wang, Hui ;
Tan, Dekun ;
Wang, Yun ;
Yu, Xiang ;
Wu, Runxiu .
MATHEMATICS, 2019, 7 (03)
[45]   Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification [J].
Xue, Yu ;
Xue, Bing ;
Zhang, Mengjie .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2019, 13 (05)
[46]   A self-adaptive artificial bee colony algorithm based on global best for global optimization [J].
Xue, Yu ;
Jiang, Jiongming ;
Zhao, Binping ;
Ma, Tinghuai .
SOFT COMPUTING, 2018, 22 (09) :2935-2952
[47]   Hybrid multi-objective cuckoo search with dynamical local search [J].
Zhang, Maoqing ;
Wang, Hui ;
Cui, Zhihua ;
Chen, Jinjun .
MEMETIC COMPUTING, 2018, 10 (02) :199-208
[48]   Gaussian bare-bones artificial bee colony algorithm [J].
Zhou, Xinyu ;
Wu, Zhijian ;
Wang, Hui ;
Rahnamayan, Shahryar .
SOFT COMPUTING, 2016, 20 (03) :907-924
[49]   Gbest-guided artificial bee colony algorithm for numerical function optimization [J].
Zhu, Guopu ;
Kwong, Sam .
APPLIED MATHEMATICS AND COMPUTATION, 2010, 217 (07) :3166-3173