A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem
Debels, Dieter Vanhoucke, Mario
Debels, Dieter
Vanhoucke, Mario
Citations
Altmetric:
Publication Type
Journal article with impact factor
Editor
Supervisor
Publication Year
2007
Journal
Operations Research
Book
Publication Volume
55
Publication Issue
3
Publication Begin page
457
Publication End page
469
Publication NUmber of pages
Collections
Abstract
In the last few decades, the resource-constrained project-scheduling problem has become a popular problem type in operations research. However, due to its strongly NP-hard status, the effectiveness of exact optimisation procedures is restricted to relatively small instances. In this paper, we present a new genetic algorithm (GA) for this problem that is able to provide near-optimal heuristic solutions. This GA procedure has been extended by a so-called decomposition-based genetic algorithm (DBGA) that iteratively solves subparts of the project. We present computational experiments on two data sets. The first benchmark set is used to illustrate the performance of both the GA and the DBGA. The second set is used to compare the results with current state-of-the-art heuristics and to show that the procedure is capable of producing consistently good results for challenging problem instances. We illustrate that the GA outperforms all state-of-the-art heuristics and that the DBGA further improves the performance of the GA.
Research Projects
Organizational Units
Journal Issue
Keywords
Programme & Portfolio Management