IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3102628.html
   My bibliography  Save this article

An Improved Artificial Bee Colony Algorithm Based on Factor Library and Dynamic Search Balance

Author

Listed:
  • Wenjie Yu
  • Xunbo Li
  • Hanbin Cai
  • Zhi Zeng
  • Xiang Li

Abstract

The artificial bee colony (ABC) algorithm is a relatively new optimization technique for simulating the honey bee swarms foraging behavior. Due to its simplicity and effectiveness, it has attracted much attention in recent years. However, ABC search equation is good at global search but poor at local search. Some different search equations are developed to tackle this problem, while there is no particular algorithm to substantially attain the best solution for all optimization problems. Therefore, we proposed an improved ABC with a new search equation, which incorporates the global search factor based on the optimization problem dimension and the local search factor based on the factor library (FL). Furthermore, aimed at preventing the algorithm from falling into local optima, dynamic search balance strategy is proposed and applied to replace the scout bee procedure in ABC. Thus, a hybrid, fast, and enhanced algorithm, HFEABC, is presented. In order to verify its effectiveness, some comprehensive tests among HFEABC and ABC and its variants are conducted on 21 basic benchmark functions and 20 complicated functions from CEC 2017. The experimental results show HFEABC offers better compatibility for different problems than ABC and some of its variants. The HFEABC performance is very competitive.

Suggested Citation

  • Wenjie Yu & Xunbo Li & Hanbin Cai & Zhi Zeng & Xiang Li, 2018. "An Improved Artificial Bee Colony Algorithm Based on Factor Library and Dynamic Search Balance," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-16, January.
  • Handle: RePEc:hin:jnlmpe:3102628
    DOI: 10.1155/2018/3102628
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/3102628.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2018/3102628.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/3102628?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ivona Brajević, 2021. "A Shuffle-Based Artificial Bee Colony Algorithm for Solving Integer Programming and Minimax Problems," Mathematics, MDPI, vol. 9(11), pages 1-20, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:3102628. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.