Abstract
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 [19] 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.
| Original language | English |
|---|---|
| Title of host publication | MIC 2009: The VIII Metaheuristics International Conference |
| Publication date | 2009 |
| Publication status | Published - 2009 |
| Event | MIC 2009: The VIII Metaheuristics International Conference - Hamburg, Germany Duration: 1 Jan 2009 → … |
Conference
| Conference | MIC 2009: The VIII Metaheuristics International Conference |
|---|---|
| City | Hamburg, Germany |
| Period | 01/01/2009 → … |