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


GÖRKEMLİ BAYRAM B., Kaya E., KARABOĞA D., AKAY B.

Journal of Combinatorial Optimization, cilt.49, sa.4, 2025 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 49 Sayı: 4
  • Basım Tarihi: 2025
  • Doi Numarası: 10.1007/s10878-025-01296-1
  • Dergi Adı: Journal of Combinatorial Optimization
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Applied Science & Technology Source, Chimica, Compendex, Computer & Applied Sciences, INSPEC, zbMATH
  • Anahtar Kelimeler: Artificial bee colony, ABC, Scheduling problem, Combinatorial optimization
  • Erciyes Üniversitesi Adresli: Evet

Özet

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.