This paper examines a reliable capacitated location-routing problem in which depots are randomly disrupted. Customers whose depots fail must be reinserted into the routes of surviving depots. We present a scenario-based mixed-integer programming model to optimize depot location, outbound delivery routing, and backup plans. We design a metaheuristic algorithm that is based on a maximum-likelihood sampling method, route-reallocation improvement, two-stage neighborhood search and simulated annealing. Numerical tests show that the heuristic is able to generate results that would keep operating costs and failure costs well balanced. Managerial insights on scenario identification, facility deployment and model simplification are drawn.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A metaheuristic approach to the reliable location routing problem under disruptions



    Erschienen in:

    Erscheinungsdatum :

    2015



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    BKL:    85.00 / 55.82 Güterverkehr