IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i4d10.1007_s10878-025-01296-1.html
   My bibliography  Save this article

A review on the versions of artificial bee colony algorithm for scheduling problems

Author

Listed:
  • Beyza Gorkemli

    (Erciyes University)

  • Ebubekir Kaya

    (Nevsehir Haci Bektas Veli University)

  • Dervis Karaboga

    (Erciyes University)

  • Bahriye Akay

    (Erciyes University)

Abstract

Today, artificial bee colony (ABC) algorithm is one of the most popular swarm intelligence based optimization techniques. Although it was originally introduced to work on continuous space for numerical optimization problems, several researchers also successfully use the ABC for other problem types. In this study, variants of the ABC for scheduling problems are surveyed. Since the scheduling problems are combinatorial type problems, generally some modifications related to the solution representation or neighborhood search operators are introduced in these studies. Additionally, several enhancement ideas are also presented for the ABC algorithm such as the improvements of initialization, employed bee, onlooker bee, scout bee phases and hybrid usage with other metaheuristics or local search methods. This paper evaluates the literature, provides some analyses on its current state and gaps, and addresses possible future works. It is hoped that this review study would be beneficial for the researchers interested in this field.

Suggested Citation

  • Beyza Gorkemli & Ebubekir Kaya & Dervis Karaboga & Bahriye Akay, 2025. "A review on the versions of artificial bee colony algorithm for scheduling problems," Journal of Combinatorial Optimization, Springer, vol. 49(4), pages 1-46, May.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01296-1
    DOI: 10.1007/s10878-025-01296-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01296-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01296-1?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.

    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:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01296-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.