IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v232y2014icp216-234.html
   My bibliography  Save this article

Co-evolving bee colonies by forager migration: A multi-swarm based Artificial Bee Colony algorithm for global search space

Author

Listed:
  • Biswas, Subhodip
  • Das, Swagatam
  • Debchoudhury, Shantanab
  • Kundu, Souvik

Abstract

Swarm intelligent algorithms focus on imitating the collective intelligence of a group of simple agents that can work together as a unit. Such algorithms have particularly significant impact in the fields like optimization and artificial intelligence (AI). This research article focus on a recently proposed swarm-based metaheuristic called the Artificial Bee Colony (ABC) algorithm and suggests modification to the algorithmic framework in order to enhance its performance. The proposed ABC variant shall be referred to as Migratory Multi-swarm Artificial Bee Colony (MiMSABC) algorithm. Different perturbation schemes of ABC function differently in varying landscapes. Hence to maintain the basic essence of all these schemes, MiMSABC deploys a multiple swarm populations that are characterized by different and unique perturbation strategies. The concept of reinitializing foragers around a depleted food source using a limiting parameter, as often used conventionally in ABC algorithms, has been avoided. Instead a performance based set of criteria has been introduced to thoroughly detect subpopulations that have shown limited progress to eke out the global optimum. Once failure is detected in a subpopulation provisions have been made so that constituent foragers can migrate to a better performing subpopulation, maintaining, however, a minimum number of members for successful functioning of a subpopulation. To evaluate the performance of the algorithm, we have conducted comparative study involving 8 algorithms for testing the problems on 25 benchmark functions set proposed in the Special Session on IEEE Congress on Evolutionary Competition 2005. Thorough a detailed analysis we have highlighted the statistical superiority of our proposed MiMSABC approach over a set of population based metaheuristics.

Suggested Citation

  • Biswas, Subhodip & Das, Swagatam & Debchoudhury, Shantanab & Kundu, Souvik, 2014. "Co-evolving bee colonies by forager migration: A multi-swarm based Artificial Bee Colony algorithm for global search space," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 216-234.
  • Handle: RePEc:eee:apmaco:v:232:y:2014:i:c:p:216-234
    DOI: 10.1016/j.amc.2013.12.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630031301299X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2013.12.023?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Ma, Shuidong & Fang, Yiming & Zhao, Xiaodong & Liu, Zhendong, 2023. "Multi-swarm improved Grey Wolf Optimizer with double adaptive weights and dimension learning for global optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 205(C), pages 619-641.
    2. Yetgin, Zeki & Abaci, Hüseyin, 2021. "Honey formation optimization framework for design problems," Applied Mathematics and Computation, Elsevier, vol. 394(C).
    3. Xiang, Liu, 2017. "Energy network dispatch optimization under emergency of local energy shortage with web tool for automatic large group decision-making," Energy, Elsevier, vol. 120(C), pages 740-750.
    4. Yurtkuran, Alkın & Emel, Erdal, 2015. "An adaptive artificial bee colony algorithm for global optimization," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 1004-1023.

    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:eee:apmaco:v:232:y:2014:i:c:p:216-234. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.