Dynamic truck and trailer routing problem for last mile distribution in disaster response

The purpose of this paper is to investigate the application of the dynamic vehicle routing problem for last mile distribution during disaster response. The authors explore a model that involves limited heterogeneous vehicles, multiple trips, locations with different accessibilities, uncertain demands, and anticipating new locations that are expected to build responsive last mile distribution systems.,The modified simulated annealing algorithm with variable neighborhood search for local search is used to solve the last mile distribution model based on the criterion of total travel time. A dynamic simulator that accommodates new requests from demand nodes and a sample average estimator was added to the framework to deal with the stochastic and dynamicity of the problem.,This study illustrates some practical complexities in last mile distribution during disaster response and shows the benefits of flexible vehicle routing by considering stochastic and dynamic situations.,This study only focuses day-to-day distribution on road/land transportation for distribution, and additional transportation modes need to be considered further.,The proposed model offers operational insights for government disaster agencies by highlighting the dynamic model concept for supporting relief distribution decisions. The result suggests that different characteristics and complexities of affected areas might require different distribution strategies.,This study modifies the concept of the truck and trailer routing problem to model locations with different accessibilities while anticipating the information gap for demand size and locations. The results show the importance of flexible distribution systems during a disaster for minimizing the disaster risks.

[1]  Enrique Alba,et al.  Variable neighborhood search for the stochastic and dynamic vehicle routing problem , 2016, Ann. Oper. Res..

[2]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[3]  Stephan Scheuerer,et al.  A tabu search heuristic for the truck and trailer routing problem , 2006, Comput. Oper. Res..

[4]  Walter J. Gutjahr,et al.  A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis , 2007, SAGA.

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  Ulrich Derigs,et al.  Truck and trailer routing - Problems, heuristics and computational experience , 2013, Comput. Oper. Res..

[7]  Nilay Noyan,et al.  A Stochastic Optimization Model for Designing Last Mile Relief Networks , 2016, Transp. Sci..

[8]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[9]  Puca Huachi Vaz Penna,et al.  Vehicle routing problems for last mile distribution after major disaster , 2018, J. Oper. Res. Soc..

[10]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[11]  Shuo-Yan Chou,et al.  Solving the truck and trailer routing problem based on a simulated annealing heuristic , 2009, Comput. Oper. Res..

[12]  Wei Yi,et al.  Ant Colony Optimization for Disaster Relief Operations , 2007 .

[13]  Uwe Clausen,et al.  Dynamic vehicle routing with anticipation in disaster relief , 2012 .

[14]  Peter A. Rogerson,et al.  A logistics model for emergency supply of critical items in the aftermath of a disaster , 2011 .

[15]  R. Oloruntoba.  An analysis of the Cyclone Larry emergency relief chain: Some key success factors , 2010 .

[16]  Chung-Cheng Lu,et al.  Real-time relief distribution in the aftermath of disasters – A rolling horizon approach , 2016 .

[17]  Nubia Velasco,et al.  A matheuristic for the truck and trailer routing problem , 2013, Eur. J. Oper. Res..

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[20]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[21]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[22]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[23]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[24]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[25]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[26]  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 .

[27]  Benita M. Beamon,et al.  Last Mile Distribution in Humanitarian Relief , 2008, J. Intell. Transp. Syst..

[28]  Nubia Velasco,et al.  A GRASP with evolutionary path relinking for the truck and trailer routing problem , 2011, Comput. Oper. Res..

[29]  Benita M. Beamon,et al.  Facility location in humanitarian relief , 2008 .

[30]  Linet Özdamar,et al.  Emergency Logistics Planning in Natural Disasters , 2004, Ann. Oper. Res..

[31]  Gregorio Tirado,et al.  A GRASP metaheuristic for humanitarian aid distribution , 2016, J. Heuristics.

[32]  Graham Coates,et al.  A multi-objective combinatorial model of casualty processing in major incident response , 2013, Eur. J. Oper. Res..

[33]  Linet Özdamar,et al.  A hierarchical clustering and routing procedure for large scale disaster relief logistics planning , 2012 .

[34]  Ping Chen,et al.  Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..

[35]  Fritz Gehbauer,et al.  Optimized resource allocation for emergency response after earthquake disasters , 2000 .

[36]  Jing Liu,et al.  A multi-objective evolutionary algorithm for multi-period dynamic emergency resource scheduling problems , 2017 .

[37]  I-Ming Chao,et al.  A tabu search method for the truck and trailer routing problem , 2002, Comput. Oper. Res..

[38]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[39]  Nubia Velasco,et al.  GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots , 2010, Eng. Appl. Artif. Intell..

[40]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[41]  Manuel Laguna,et al.  Tabu Search , 1997 .

[42]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

[43]  Jiuh-Biing Sheu,et al.  Dynamic Relief-Demand Management for Emergency Logistics Operations Under Large-Scale Disasters , 2010 .

[44]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[45]  Haijun Wang,et al.  Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake , 2014 .

[46]  Gwo-Hshiung Tzeng,et al.  Multi-objective optimal planning for designing relief delivery systems , 2007 .

[47]  Nezih Altay,et al.  OR/MS research in disaster operations management , 2006, Eur. J. Oper. Res..

[48]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[49]  Michel Gendreau,et al.  A dynamic vehicle routing problem with multiple delivery routes , 2011, Annals of Operations Research.