A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem

Authors:
Dieter Debels;Mario Vanhoucke
Affiliations:
Faculty of Economics and Business Administration, Ghent University, Ghent, Belgium;Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Ghent, Belgium
Venue:
Operations Research
Year:
2007

Citing 0
Cited 12

A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
An efficient hybrid algorithm for resource-constrained project scheduling

Information Sciences: an International Journal
A Neurogenetic approach for the resource-constrained project scheduling problem

Computers and Operations Research
Grids-based data parallel computing for learning optimization in a networked learning control systems

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part I
An artificial bee colony with random key for resource-constrained project scheduling

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part II
An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem

Computers and Operations Research
A hybrid estimation of distribution algorithm for solving the resource-constrained project scheduling problem

Expert Systems with Applications: An International Journal
Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm

Expert Systems with Applications: An International Journal
A (μ, λ)-coordination mechanism for agent-based multi-project scheduling

OR Spectrum
A hybrid evolutionary algorithm for the resource-constrained project scheduling problem

Artificial Life and Robotics
Simulation-based multi-mode resource-constrained project scheduling of semiconductor equipment installation and qualification

Proceedings of the Winter Simulation Conference
Integrating iterative crossover capability in orthogonal neighborhoods for scheduling resource-constrained projects

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.