Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information

Abstract Emergency response systems should respond to disasters in a timely and cost-effective manner. One of the most complicated tasks facing managers is debris management. During post-disaster operations, response teams must make road network connections between supplier nodes and demand (population) nodes in order to protect human health and safety. The effectiveness of response operations depends on positioning of relief supplies in anticipation of new clearance equipment requests at new locations, as well as with relocation of clearance equipment items to rebalance the use of items post disaster. To solve this problem, a novel dynamic post-disaster debris clearance problem is introduced—one that features non-myopic positioning of clearance equipment items based on a queuing formulation that is compatible with the maximum-weighted flow problem under incomplete information proposed by Celik et al., (2015). By including a clearance equipment positioning strategy, we improve the strategy of the stochastic debris clearance problem, with a new framework on dynamically optimizing the post-disaster debris clearance strategy with limited observable information about the disaster-relief resources located on the road network. The proposed dynamic debris clearance approach sets out to satisfy the need for debris clearance and relief services by using the connection between the demand nodes and the supplier nodes in a case where information on the disaster region is only partially observable. An empirical study of Hurricane Harvey in the City of Houston was performed to obtain concepts into the impacts of dynamic programming model and parameters in order to supply the needed relief via a positioning strategy for clearance equipment items.

[1]  J.R. Artalejo,et al.  G-networks: A versatile approach for work removal in queueing networks , 2000, Eur. J. Oper. Res..

[2]  W. Eric L. Grimson,et al.  Construction of Dependent Dirichlet Processes based on Poisson Processes , 2010, NIPS.

[3]  Linet Özdamar,et al.  A dynamic logistics coordination model for evacuation and support in disaster response activities , 2007, Eur. J. Oper. Res..

[4]  David B. Dunson,et al.  Bayesian Data Analysis , 2010 .

[5]  Melih Çelik,et al.  Network restoration and recovery in humanitarian operations: Framework, literature review, and research directions , 2016 .

[6]  Hamid R. Sayarshad,et al.  A non-myopic dynamic inventory routing and pricing problem , 2018 .

[7]  Melih Çelik,et al.  Pre-positioning of relief items under road/facility vulnerability with concurrent restoration and relief transportation , 2019, IISE Trans..

[8]  Elise Miller-Hooks,et al.  Measuring the performance of transportation infrastructure systems in disasters: a comprehensive review , 2015 .

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

[10]  F. Sibel Salman,et al.  Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity , 2017, Eur. J. Oper. Res..

[11]  Martin W. P. Savelsbergh,et al.  Incremental Network Design with Maximum Flows , 2015, Eur. J. Oper. Res..

[12]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[13]  Joseph Ying Jun Chow,et al.  Non-myopic Relocation of Idle Mobility-on-Demand Vehicles as a Dynamic Location-Allocation-Queueing Problem , 2017 .

[14]  Oya Ekin Karasan,et al.  Solution methodologies for debris removal in disaster response , 2016, EURO J. Comput. Optim..

[15]  Linet Özdamar,et al.  A mathematical model for post-disaster road restoration: Enabling accessibility and evacuation , 2014 .

[16]  Jiuh-Biing Sheu,et al.  Challenges of emergency logistics management , 2007 .

[17]  Patrick Jaillet,et al.  Online traveling salesman problems with service flexibility , 2011, Networks.

[18]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[19]  Irina S. Dolinskaya,et al.  Network repair crew scheduling and routing for emergency relief distribution problem , 2016, Eur. J. Oper. Res..

[20]  Ryan P. Adams,et al.  Tractable nonparametric Bayesian inference in Poisson processes with Gaussian process intensities , 2009, ICML '09.

[21]  Joseph Ying Jun Chow,et al.  Survey and empirical evaluation of nonhomogeneous arrival process models with taxi data , 2016 .

[22]  Zhongsheng Hua,et al.  Forecasting demand of commodities after natural disasters , 2010, Expert Syst. Appl..

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

[24]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[25]  David Simchi-Levi,et al.  A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks , 1988, Oper. Res..

[26]  Edmundas Kazimieras Zavadskas,et al.  Automation and robotics in construction: International research and achievements , 2010 .

[27]  Shangyao Yan,et al.  Optimal scheduling of emergency roadway repair and subsequent relief distribution , 2009, Comput. Oper. Res..

[28]  André Langevin,et al.  Vehicle Routing for Urban Snow Plowing Operations , 2006, Transp. Sci..

[29]  Dilanthi Amaratunga,et al.  Post Disaster Waste Management Strategies In Developing Countries: Case Of Sri Lanka , 2009 .

[30]  Andreas T. Ernst,et al.  Incremental network design with shortest paths , 2014, Eur. J. Oper. Res..

[31]  Mark A. Turnquist,et al.  Pre-positioning of emergency supplies for disaster response , 2010 .

[32]  S. Mason,et al.  Multiple-objective analysis of integrated relief supply and network restoration in humanitarian logistics operations , 2016 .

[33]  Mark S. Daskin,et al.  Integrating location and network restoration decisions in relief networks under uncertainty , 2019, Eur. J. Oper. Res..

[34]  Vladimir Marianov,et al.  Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times , 2002, Ann. Oper. Res..

[35]  Melih Celik,et al.  The Post-Disaster Debris Clearance Problem Under Incomplete Information , 2015, Oper. Res..

[36]  Behrooz Karimi,et al.  Multi-period sustainable and integrated recycling network for municipal solid waste – A case study in Tehran , 2017 .

[37]  Feras Saad,et al.  Temporally-Reweighted Chinese Restaurant Process Mixtures for Clustering, Imputing, and Forecasting Multivariate Time Series , 2017, AISTATS.

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

[39]  H. Oliver Gao,et al.  A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems , 2018, Transportation Research Part C: Emerging Technologies.

[40]  S. A. MirHassani,et al.  A Flexible Reformulation of the Refueling Station Location Problem , 2013, Transp. Sci..

[41]  Christos A. Kontovas,et al.  Dynamic vehicle routing problems: Three decades and counting , 2016, Networks.