We present an application of an Adaptive Large Neighborhood Search (ALNS) algorithm to the Resource-constrained Project Scheduling Problem (RCPSP). The ALNS framework was first proposed by Pisinger and Røpke  and can be described as a large neighborhood search algorithm with an adaptive layer, where a set of destroy/repair neighborhoods compete to modify the current solution in each iteration of the algorithm. Experiments are performed on the wellknown J30, J60 and J120 benchmark instances, which show that the proposed algorithm is competitive and confirms the strength of the ALNS framework previously reported for different variants of the Vehicle Routing Problem.
|Title of host publication||MIC 2009: The VIII Metaheuristics International Conference|
|Publication status||Published - 2009|
|Event||MIC 2009: The VIII Metaheuristics International Conference - Hamburg, Germany|
Duration: 1 Jan 2009 → …
|Conference||MIC 2009: The VIII Metaheuristics International Conference|
|Period||01/01/2009 → …|
Muller, L. F. (2009). An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem. In MIC 2009: The VIII Metaheuristics International Conference http://www.diku.dk/hjemmesider/ansatte/laurent/pdf/mic09-152-Muller_b.pdf