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

Beyza Gorkemli (), Ebubekir Kaya (), Dervis Karaboga () and Bahriye Akay ()
Additional contact information
Beyza Gorkemli: Erciyes University
Ebubekir Kaya: Nevsehir Haci Bektas Veli University
Dervis Karaboga: Erciyes University
Bahriye Akay: Erciyes University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 4, No 9, 46 pages

Abstract: 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.

Keywords: Artificial bee colony; ABC; Scheduling problem; Combinatorial optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01296-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01296-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01296-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().