An Efficient Hybrid Artificial Bee Colony Algorithm for the Resource-Constrained Project Scheduling Problem

The Artificial Bee Colony (ABC) is a widely used metaheuristic optimisation algorithm due to its simplicity, adaptability, and efficiency. However, it has a notable drawback of limited local search capability for combinatorial optimisation problems such as the Resource Constrained Project Scheduling Problem (RCPSP). This study employs a line search method to strengthen the local search process, focusing on refining candidate solutions in a given direction. Furthermore, Constraint Programming is embedded to deal with the large number of constraints in RCPSP and explore the complex and discrete solution space efficiently. The computational results on 1560 instances from the well-known library PSPLIB with 30, 60, and 120 tasks, indicate that the proposed algorithm yields superior outcomes compared to the state-of-the-art algorithms.

Authors

Institutions

Publication Details

Journal
SN Computer Science
Published
2026-04-13
DOI
https://doi.org/10.1007/s42979-026-04843-7
Primary Topic
Resource-Constrained Project Scheduling
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Hybrid Artificial Bee Colony Algorithm for the Resource-Constrained Project Scheduling Problem

Alireza Etminaniesfahani, Hanyu Gu
SN Computer Science
Resource-Constrained Project Scheduling
article

An Efficient Hybrid Artificial Bee Colony Algorithm for the Resource-Constrained Project Scheduling Problem

Alireza Etminaniesfahani, Hanyu Gu
article en

Abstract

The Artificial Bee Colony (ABC) is a widely used metaheuristic optimisation algorithm due to its simplicity, adaptability, and efficiency. However, it has a notable drawback of limited local search capability for combinatorial optimisation problems such as the Resource Constrained Project Scheduling Problem (RCPSP). This study employs a line search method to strengthen the local search process, focusing on refining candidate solutions in a given direction. Furthermore, Constraint Programming is embedded to deal with the large number of constraints in RCPSP and explore the complex and discrete solution space efficiently. The computational results on 1560 instances from the well-known library PSPLIB with 30, 60, and 120 tasks, indicate that the proposed algorithm yields superior outcomes compared to the state-of-the-art algorithms.

SN Computer ScienceVol. 7(4)
University of Technology Sydney (AU)
University of Technology Sydney
Decent work and economic growth
Openalex Percentile: Top 22%
Resource-Constrained Project Scheduling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Efficient Hybrid Artificial Bee Colony Algorithm for the Resource-Constrained Project Scheduling Problem — Alireza Etminaniesfahani, Hanyu Gu · SN Computer Science (2026) | TGRS Research Map | TGRS