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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A metaheuristic approach to the reliable location routing problem under disruptions




    Publication date :

    2015



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    A metaheuristic approach to the reliable location routing problem under disruptions

    Zhang, Ying / Qi, Mingyao / Lin, Wei-Hua et al. | Elsevier | 2015



    Reliable Location-Routing Design Under Probabilistic Facility Disruptions

    Xie, Weijun / Ouyang, Yanfeng / Wong, Sze Chun | British Library Online Contents | 2016



    Hybrid metaheuristic solutions to inventory location routing problem

    Zhang, Ying / Qi, Mingyao / Miao, Lixin et al. | Elsevier | 2014