A continuous approximation approach for assessment routing in disaster relief

In this paper, we focus on the assessment routing problem which routes teams to different communities to assess damage and relief needs following a disaster. To address time-sensitivity, the routing problem is modeled with the objective of minimizing the sum of arrival times to beneficiaries. We propose a continuous approximation approach which uses aggregated instance data to develop routing policies and cost approximations. Numerical tests are performed that demonstrate the effectiveness of the cost approximations at predicting the true implementation costs of the policies and compare the policies against more complex solution approaches. The continuous approximation approach yields solutions which can be easily implemented; further, this approach reduces the need for detailed data and the computational requirements to solve the problem.

[1]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[2]  Carlos F. Daganzo,et al.  Design of multiple-vehicle delivery tours--I a ring-radial network , 1986 .

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

[4]  David P. Williamson,et al.  A Faster, Better Approximation Algorithm for the Minimum Latency Problem , 2008, SIAM J. Comput..

[5]  Carlos F. Daganzo,et al.  Logistics Systems Analysis , 1991 .

[6]  Karen Renee Smilowitz,et al.  Modeling Techniques for Periodic Vehicle Routing Problems , 2006 .

[7]  Carlos F. Daganzo,et al.  The length of tours in zones of different shapes , 1984 .

[8]  Vedat Verter,et al.  A continuous analysis framework for the solution of location-allocation problems with dense demand , 2008, Comput. Oper. Res..

[9]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[10]  Yanfeng Ouyang,et al.  Design of vehicle routing zones for large-scale distribution systems , 2007 .

[11]  Michal Tzur,et al.  Flexibility and complexity in periodic distribution problems , 2007 .

[12]  André Langevin,et al.  CONTINUOUS APPROXIMATIONA MODELS IN FREIGHT DISTRIBUTION: AN OVERVIEW , 1996 .

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

[14]  R. L. Collins,et al.  A Minimal Technology Routing System for Meals on Wheels , 1983 .

[15]  Gülay Barbarosoglu,et al.  An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations , 2002, Eur. J. Oper. Res..

[16]  Satish Rao,et al.  The k-traveling repairmen problem , 2007, ACM Trans. Algorithms.

[17]  A. Kárpáti,et al.  Needs assessment of the displaced population following the August 1999 earthquake in Turkey. , 2001, Disasters.

[18]  R. Russell,et al.  An assignment routing problem , 1979, Networks.

[19]  Peter Tatham,et al.  An investigation into the suitability of the use of unmanned aerial vehicle systems (UAVS) to support the initial needs assessment process in rapid onset humanitarian disasters , 2009 .

[20]  Ali Haghani,et al.  Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations , 1996 .

[21]  Bruce L. Golden,et al.  The Consistent Vehicle Routing Problem , 2009, Manuf. Serv. Oper. Manag..

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

[23]  Yanfeng Ouyang,et al.  Reliable Facility Location Design Under the Risk of Disruptions , 2010, Oper. Res..

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

[25]  Maciek Nowak,et al.  Workforce Management in Periodic Delivery Operations , 2013, Transp. Sci..

[26]  Gülay Barbarosoglu,et al.  A two-stage stochastic programming framework for transportation planning in disaster response , 2004, J. Oper. Res. Soc..

[27]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[28]  Russell Bent,et al.  Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution , 2010, CPAIOR.

[29]  Carlos F. Daganzo,et al.  Continuum approximation techniques for the design of integrated package distribution systems , 2007 .

[30]  Maged Dessouky,et al.  A two-stage vehicle routing model for large-scale bioterrorism emergencies , 2009 .

[31]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

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

[33]  Gordon F. Newell Design of multiple-vehicle delivery tours—III valuable goods , 1986 .

[34]  Yanfeng Ouyang,et al.  A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions , 2010 .

[35]  Michel Gendreau,et al.  A continuous approximation model for the fleet composition problem , 2012 .

[36]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[37]  Randolph W. Hall,et al.  Territory Planning and Vehicle Dispatching with Driver Learning , 2007, Transp. Sci..