{"title":"A review on the versions of artificial bee colony algorithm for scheduling problems","authors":"Beyza Gorkemli, Ebubekir Kaya, Dervis Karaboga, Bahriye Akay","doi":"10.1007/s10878-025-01296-1","DOIUrl":null,"url":null,"abstract":"<p>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.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"96 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01296-1","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
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.
期刊介绍：
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
