Artificial bee colony algorithm with efficient search strategy based on random neighborhood structure

被引:26
|
作者
Ye, Tingyu [1 ]
Wang, Wenjun [2 ]
Wang, Hui [1 ]
Cui, Zhihua [3 ]
Wang, Yun [1 ]
Zhao, Jia [1 ]
Hu, Min [1 ]
机构
[1] Nanchang Inst Technol, Sch Informat Engn, 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, Peoples R China
关键词
Artificial bee colony (ABC); Swarm intelligence; Search strategy; Neighborhood search; Global optimization; OPTIMIZATION;
D O I
10.1016/j.knosys.2022.108306
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As a popular swarm intelligence algorithm, artificial bee colony (ABC) achieves excellent optimization performance, but it has some shortcomings. In order to strengthen the performance of ABC, a new ABC with efficient search strategy based on random neighborhood structure (called RNSABC) is proposed. In RNSABC, a new random neighborhood structure (RNS) is constructed. Each solution has an independent and random neighborhood size. An improved search strategy is designed on the basic of RNS. Moreover, a depth first search method is utilized to enhance the role of the onlooker bee phase. To study the optimization capability of RNSABC, a set of 57 benchmark problems including classical problems, CEC 2013 complex problems, and polynomial problems are tested. Experimental results show RNSABC can obtain competitive performance when compared with nine other recent ABC variants.(C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] Quick artificial bee colony algorithm with symbiotic search strategy for global optimization
    Wei, Xuan
    Chen, Xu
    Ding, Yuhan
    Yang, Guanxue
    Wang, Zhaowei
    [J]. 2019 CHINESE AUTOMATION CONGRESS (CAC2019), 2019, : 2123 - 2127
  • [42] Search Experience-Based Search Adaptation in Artificial Bee Colony Algorithm
    Li, Xianneng
    Yan, Guangfei
    Kiran, Mustafa Servet
    [J]. 2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2524 - 2531
  • [43] An improved artificial bee colony algorithm with modified-neighborhood-based update operator and independent-inheriting-search strategy for global optimization
    Zhong, Fuli
    Li, Hui
    Zhong, Shouming
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 58 : 134 - 156
  • [44] A Simple and Efficient Artificial Bee Colony Algorithm
    Xu, Yunfeng
    Fan, Ping
    Yuan, Ling
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [45] An Improved Artificial Bee Colony Algorithm based on Beetle Antennae Search
    Cheng, Long
    Yu, Muzhou
    Yang, Junfeng
    Wang, Yan
    [J]. PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 2312 - 2316
  • [46] A hybrid artificial bee colony algorithm based on different search mechanisms
    School of Information Engineering, Nanchang Institute of Technology, Nanchang
    330099, China
    不详
    330099, China
    [J]. Int. J. Wireless Mobile Comput., 4 (383-390):
  • [47] Parameters identification of chaotic systems based on artificial bee colony algorithm combined with cuckoo search strategy
    Ding, ZhengHao
    Lu, ZhongRong
    Liu, JiKe
    [J]. SCIENCE CHINA-TECHNOLOGICAL SCIENCES, 2018, 61 (03) : 417 - 426
  • [48] Parameters identification of chaotic systems based on artificial bee colony algorithm combined with cuckoo search strategy
    ZhengHao Ding
    ZhongRong Lu
    JiKe Liu
    [J]. Science China Technological Sciences, 2018, 61 : 417 - 426
  • [49] Parameters identification of chaotic systems based on artificial bee colony algorithm combined with cuckoo search strategy
    DING ZhengHao
    LU ZhongRong
    LIU JiKe
    [J]. Science China(Technological Sciences)., 2018, 61 (03) - 426
  • [50] Parameters identification of chaotic systems based on artificial bee colony algorithm combined with cuckoo search strategy
    DING ZhengHao
    LU ZhongRong
    LIU JiKe
    [J]. Science China Technological Sciences, 2018, (03) : 417 - 426