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.
A metaheuristic approach to the reliable location routing problem under disruptions
2015
Article (Journal)
English
Reliable Location-Routing Design Under Probabilistic Facility Disruptions
Online Contents | 2016
|Reliable Location-Routing Design Under Probabilistic Facility Disruptions
British Library Online Contents | 2016
|Hybrid metaheuristic solutions to inventory location routing problem
Online Contents | 2014
|Hybrid metaheuristic solutions to inventory location routing problem
Elsevier | 2014
|