Solving the resource-constrained project scheduling problem with large neighbourhood search

Solving the resource-constrained project scheduling problem with large neighbourhood search

0.00 Avg rating0 Votes
Article ID: iaor2005902
Country: Netherlands
Volume: 131
Issue: 1
Start Page Number: 237
End Page Number: 257
Publication Date: Oct 2004
Journal: Annals of Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

This paper presents the Local Search with Subproblem Exact Resolution (LSSPER) method based on large neighbourhood search for solving the resource-constrained project scheduling problem (RCPSP). At each step of the method, a subpart of the current solution is fixed while the other part defines a subproblem solved externally by a heuristic or an exact solution approach (using either constraint programming techniques or mathematical programming techniques). Hence, the method can be seen as a hybrid scheme. The key point of the method deals with the choice of the subproblem to be optimized. In this paper, we investigate the application of the method to the RCPSP. Several strategies for generating the subproblem are proposed. In order to evaluate these strategies, and, also, to compare the whole method with current state-of-the-art heuristics, extensive numerical experiments have been performed. The proposed method appears to be very efficient.

Reviews

Required fields are marked *. Your email address will not be published.