An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem

Laurent Flindt Muller

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    748 Downloads (Pure)

    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 languageEnglish
    Title of host publicationMIC 2009: The VIII Metaheuristics International Conference
    Publication date2009
    Publication statusPublished - 2009
    EventMIC 2009: The VIII Metaheuristics International Conference - Hamburg, Germany
    Duration: 1 Jan 2009 → …

    Conference

    ConferenceMIC 2009: The VIII Metaheuristics International Conference
    CityHamburg, Germany
    Period01/01/2009 → …

    Cite this