The median routing problem for simultaneous planning of emergency response and non-emergency jobs

This paper studies a setting in emergency logistics where emergency responders must also perform a set of known, non-emergency jobs in the network when there are no active emergencies going on. These jobs typically have a preventive function, and allow the responders to use their idle time much more productively than in the current standard. When an emergency occurs, the nearest responder must abandon whatever job he or she is doing and go to the emergency. This leads to the optimisation problem of timetabling jobs and moving responders over a discrete network such that the expected emergency response time remains minimal. Our model, the Median Routing Problem, addresses this complex problem by minimising the expected response time to the next emergency and allowing for re-solving after this. We describe a mixed-integer linear program and a number of increasingly refined heuristics for this problem. We created a large set of benchmark instances, both from real-life case study data and from a generator. On the real-life case study instances, the best performing heuristic finds on average a solution only 3.4% away from optimal in a few seconds. We propose an explanation for the success of this heuristic, with the most pivotal conclusion being the importance of solving the underlying p-Medians Problem.

[1]  P. Pardalos,et al.  The p-Median Problem , 2013 .

[2]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[3]  G. Maróti,et al.  Maintenance Routing for Train Units: The Transition Model , 2005, Transp. Sci..

[4]  Moshe Dror,et al.  Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework , 2002, Transp. Sci..

[5]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[6]  Yue Wang,et al.  Cooperative Vision-Based Multi-Vehicle Dynamic Coverage Control for Underwater Applications , 2007, 2007 IEEE International Conference on Control Applications.

[7]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[8]  Nenad Mladenovic,et al.  New exact method for large asymmetric distance-constrained vehicle routing problem , 2013, Eur. J. Oper. Res..

[9]  Nacima Labadie,et al.  On the combined maintenance and routing optimization problem , 2016, Reliab. Eng. Syst. Saf..

[10]  René Sitters,et al.  Routing Under Uncertainty: The a priori Traveling Repairman Problem , 2014, WAOA.

[11]  Hanif D. Sherali,et al.  A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem , 2013, Transp. Sci..

[12]  Charles ReVelle,et al.  Central Facilities Location , 2010 .

[13]  Franziska Abend,et al.  Facility Location Concepts Models Algorithms And Case Studies , 2016 .

[14]  S. Raghavan,et al.  The capacitated mobile facility location problem , 2019, Eur. J. Oper. Res..

[15]  Barrett W. Thomas,et al.  Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits , 2013, Oper. Res..

[16]  Rodrigo Palma-Behnke,et al.  A Microgrid Energy Management System Based on the Rolling Horizon Strategy , 2013, IEEE Transactions on Smart Grid.

[17]  Michel Gendreau,et al.  Waiting Strategies for Regular and Emergency Patient Transportation , 2009 .

[18]  Michael Drexl,et al.  A survey of variants and extensions of the location-routing problem , 2015, Eur. J. Oper. Res..

[19]  Dines Bjørner,et al.  Train Maintenance Routing , 2003 .

[20]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[21]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  R. Ravi,et al.  Approximation algorithms for distance constrained vehicle routing problems , 2012, Networks.

[24]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[25]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[26]  Zhe Liang,et al.  The Aircraft Maintenance Routing Problem , 2009 .

[27]  S. J. Claasen,et al.  An integrated and intelligent metaheuristic for constrained vehicle routing , 2007 .

[28]  Christelle Guéret,et al.  An event-driven optimization framework for dynamic vehicle routing , 2012, Decis. Support Syst..

[29]  Rico Zenklusen,et al.  A 1.5-Approximation for Path TSP , 2018, SODA.

[30]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[31]  Andrés L. Medaglia,et al.  Combined maintenance and routing optimization for large-scale sewage cleaning , 2020, Ann. Oper. Res..

[32]  Florent de Dinechin,et al.  Hardware Implementations of Fixed-Point Atan2 , 2015, 2015 IEEE 22nd Symposium on Computer Arithmetic.

[33]  Pieter L. van den Berg,et al.  Scheduling Non-Urgent Patient Transportation While Maximizing Emergency Coverage , 2019, Transp. Sci..

[34]  Rajan Batta,et al.  A branch-and-price approach for operational aircraft maintenance routing , 2006, Eur. J. Oper. Res..

[35]  Kalyan T. Talluri,et al.  The Four-Day Aircraft Maintenance Routing Problem , 1998, Transp. Sci..

[36]  Shaligram Pokharel,et al.  Optimization models in emergency logistics: A literature review , 2012 .

[37]  Donald R. Plane,et al.  Mathematical Programming and the Location of Fire Companies for the Denver Fire Department , 1977, Oper. Res..

[38]  Cynthia Barnhart,et al.  Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions , 2003, Oper. Res..

[39]  Meng Joo Er,et al.  Rectilinear workspace partitioning for parallel coverage using multiple unmanned aerial vehicles , 2007, Adv. Robotics.

[40]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[41]  Chandra Ade Irawan,et al.  Optimisation of maintenance routing and scheduling for offshore wind farms , 2017, Eur. J. Oper. Res..

[42]  Shu Zhang,et al.  A priori orienteering with time windows and stochastic wait times at customers , 2014, Eur. J. Oper. Res..

[43]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[44]  Ümit Bilge,et al.  Operational aircraft maintenance routing problem with remaining time consideration , 2014, Eur. J. Oper. Res..

[45]  Michel Gendreau,et al.  Managing a Fleet of Ambulances to Respond to Emergency and Transfer Patient Transportation Demands , 2014 .

[46]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[47]  Li Shu,et al.  A Sweep Coverage Scheme Based on Vehicle Routing Problem , 2013 .

[48]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[49]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[50]  Elias Koutsoupias,et al.  The k-server problem , 2009, Comput. Sci. Rev..

[51]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[52]  A. J.,et al.  Analysis of Christofides ' heuristic : Some paths are more difficult than cycles , 2002 .

[53]  Roland Siegwart,et al.  Optimal surveillance coverage for teams of micro aerial vehicles in GPS-denied environments using onboard vision , 2012, Auton. Robots.

[54]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .