A late-mover genetic algorithm for resource-constrained project-scheduling problems

Yongping Liu, Lizhen Huang*, Xiufeng Liu, Guomin Ji, Xu Cheng, Erling Onstein

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

87 Downloads (Pure)

Abstract

The Resource-Constrained Project Scheduling Problem (RCPSP) plays a critical role in various management applications. Despite its importance, research efforts are still ongoing to improve lower bounds and reduce deviation values. This study aims to develop an innovative and straightforward algorithm for RCPSPs by integrating the “1+1” evolution strategy into a genetic algorithm framework. Unlike most existing studies, the proposed algorithm eliminates the need for parameter tuning and utilizes real-valued numbers and path representation as chromosomes. Consequently, it does not require priority rules to construct a feasible schedule. The algorithm's performance is evaluated using the RCPSP benchmark and compared to alternative algorithms, such as cWSA, Hybrid PSO, and EESHHO. The experimental results demonstrate that the proposed algorithm is competitive, while the exploration capability remains a challenge for further investigation.

Original languageEnglish
Article number119164
JournalInformation Sciences
Volume642
Number of pages14
ISSN0020-0255
DOIs
Publication statusPublished - 2023

Keywords

  • GA
  • Heuristic algorithm
  • Optimization
  • RCPSP

Fingerprint

Dive into the research topics of 'A late-mover genetic algorithm for resource-constrained project-scheduling problems'. Together they form a unique fingerprint.

Cite this