A fast heuristic for routing in post-disaster humanitarian relief logistics

Abstract In the last decades, natural disasters have been affecting the human life of millions of people. The impressive scale of these disasters has pointed out the need for an effective management of the relief supply operations. One of the crucial issues in this context is the routing of vehicles carrying critical supplies and help to disaster victims. This problem poses unique logistics challenges, including damaged transportation infrastructure and limited knowledge on the road travel times. In such circumstances, selecting more reliable paths could help the rescue team to provide fast services to those in needs. The classic cost-minimizing routing problems do not properly reflect the relevant issue of the arrival time, which clearly has a serious impact on the survival rate of the affected community. In this paper, we focus specifically on the arrival time objective function in a multi-vehicle routing problem where stochastic travel times are taken into account. The considered problem should be solved promptly in the aftermath of a disaster, hence we propose a fast heuristic that could be applied to solve the problem.

[1]  Raha Akhavan-Tabatabaei,et al.  OR models with stochastic components in disaster operations management: A literature survey , 2015, Comput. Ind. Eng..

[2]  Herbert Peremans,et al.  Vehicle routing with stochastic time-dependent travel times , 2009, 4OR.

[3]  Patrizia Beraldi,et al.  A stochastic programming approach for the optimal management of aggregated distributed energy resources , 2018, Comput. Oper. Res..

[4]  Burcu Balcik,et al.  Site selection and vehicle routing for post-disaster rapid needs assessment , 2017 .

[5]  Giuseppe Musolino,et al.  Freight vehicle routing with reliable link travel times: a method based on network fundamental diagram , 2018 .

[6]  Yuval Hadas,et al.  Developing a model for the stochastic time-dependent vehicle-routing problem , 2009, 2009 International Conference on Computers & Industrial Engineering.

[7]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[8]  Thibaut Vidal,et al.  A simple and effective metaheuristic for the Minimum Latency Problem , 2012, Eur. J. Oper. Res..

[9]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[10]  Patrizia Beraldi,et al.  Designing robust routes for demand-responsive transport systems , 2014 .

[11]  Patrizia Beraldi,et al.  Capital rationing problems under uncertainty and risk , 2012, Comput. Optim. Appl..

[12]  Antonino Vitetta,et al.  Vehicle routing in urban areas: an optimal approach with cost function calibration , 2014 .

[13]  Elham Pourrahmani,et al.  Optimization of an evacuation plan with uncertain demands using fuzzy credibility theory and genetic algorithm , 2015 .

[14]  Nenad Mladenovic,et al.  Variable neighborhood search for the travelling deliveryman problem , 2011, 4OR.

[15]  Peter Goos,et al.  Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem , 2011, 4OR.

[16]  Patrizia Beraldi,et al.  Balancing efficiency and equity in location-allocation models with an application to strategic EMS design , 2016, Optim. Lett..

[17]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[18]  Abbas Seifi,et al.  A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: A case study on San Francisco district , 2015 .

[19]  Patrizia Beraldi,et al.  The optimal energy procurement problem: a stochastic programming approach , 2017 .

[20]  Giuseppe Musolino,et al.  Estimation of the Network Fundamental Diagram (NFD): An Urban Application in Emergency Conditions , 2014 .

[21]  Tom Van Woensel,et al.  The time-dependent vehicle routing problem with soft time windows and stochastic travel times , 2014 .

[22]  Babak Abbasi,et al.  Robust stochastic vehicle routing and scheduling for bushfire emergency evacuation: An Australian case study , 2017 .

[23]  David L. Woodruff,et al.  The stochastic vehicle routing problem, a literature review, Part II: solution methods , 2017, EURO J. Transp. Logist..

[24]  Demetrio Laganà,et al.  The mixed capacitated general routing problem under uncertainty , 2015, Eur. J. Oper. Res..

[25]  Babak Abbasi,et al.  Possibilistic scheduling routing for short-notice bushfire emergency evacuation under uncertainties: An Australian case study , 2017 .

[26]  Frits C. R. Spieksma,et al.  Heuristics for the traveling repairman problem with profits , 2013, Comput. Oper. Res..

[27]  Giuseppe Musolino,et al.  The Vehicle Routing Problem In Urban Networks: An Approach Based On A Network Fundamental Diagram , 2014 .

[28]  Said Salhi,et al.  The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search , 2017 .

[29]  Karen Renee Smilowitz,et al.  Models for Relief Routing: Equity, Efficiency and Efficacy , 2011 .

[30]  J. Marcos Moreno-Vega,et al.  A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem , 2016, J. Oper. Res. Soc..

[31]  P. Beraldi,et al.  A Stochastic Programming Approach for the Traveling Purchaser Problem , 2017 .

[32]  Guido Perboli,et al.  A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times , 2017 .

[33]  Maria Elena Bruni,et al.  A Hybrid Greedy Randomized Adaptive Search Heuristic to Solve the Dial-a-Ride Problem , 2013, Asia Pac. J. Oper. Res..

[34]  M. E. Bruni,et al.  Emergency medical services and beyond: Addressing new challenges through a wide literature review , 2017, Comput. Oper. Res..