Scalable evacuation routing in a dynamic environment

Abstract In emergency management, tools are needed so we can take the appropriate action at different stages of an evacuation. Recent wildfires in California showed how quickly a natural disaster can affect a large geographical area. Natural disasters can create unpredicted traffic congestion or can temporarily block urban or rural roads. Evacuating a large area in an emergency situation is not possible without prior knowledge of the road network and the ability to generate an efficient evacuation plan. An ideal evacuation routing algorithm should be able to generate realistic and efficient routes for each evacuee from the source to the closest shelter. It should also be able to quickly update routes as the road network changes during the evacuation. For example, if a main road is blocked during a flood, the evacuation routing algorithm should update the plan based on this change in the road network. In this article major works in evacuation routing have been studied and a new algorithm is developed that is faster and can generate better evacuation routes. Additionally, it can quickly adjust the routes if changes in the road network are detected. The new algorithm's performance and running time are reported.

[1]  H. Greenberg.  An Analysis of Traffic Flow , 1959 .

[2]  D. Helbing.  Traffic and related self-driven many-particle systems , 2000, cond-mat/0012229.

[3]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[4]  Huaxiang Cai,et al.  Iterative Learning Control with Extended State Observer for Telescope System , 2015 .

[5]  J. E. Dobson,et al.  LandScan: Locating People is What Matters , 2002 .

[6]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[7]  Richard M. Medina,et al.  Visualizing Diurnal Population Change in Urban Areas for Emergency Management , 2011, The Professional geographer : the journal of the Association of American Geographers.

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

[9]  Alan J. Horowitz,et al.  Delay/Volume Relations for Travel Forecasting Based upon the 1985 Highway Capacity Manual , 1991 .

[10]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[11]  Parham Pahlavani,et al.  Dynamic Evacuation Routing Plan after an Earthquake , 2015 .

[12]  Serge P. Hoogendoorn,et al.  A review on travel behaviour modelling in dynamic traffic simulation models for evacuations , 2012 .

[13]  Edward P. F. Chan,et al.  Shortest Path Tree Computation in Dynamic Graphs , 2009, IEEE Transactions on Computers.

[14]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[15]  Shashi Shekhar,et al.  Evacuation Planning: A Spatial Network Database Approach , 2010, IEEE Data Eng. Bull..

[16]  Wilhelm Leutzbach,et al.  Introduction to the Theory of Traffic Flow , 1987 .

[17]  John P. Wilson,et al.  CASPER: Intelligent capacity-aware evacuation routing , 2014, Comput. Environ. Urban Syst..

[18]  Daniele Frigioni,et al.  Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees , 1998, Algorithmica.

[19]  Hande Yaman,et al.  Compromising system and user interests in shelter location and evacuation planning , 2015 .

[20]  S. Travis Waller,et al.  A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies , 2010 .

[21]  Shashi Shekhar,et al.  Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results , 2005, SSTD.

[22]  Daniele Frigioni,et al.  Experimental analysis of dynamic algorithms for the single source shortest paths problem , 1998, JEAL.

[23]  Richard L. Church,et al.  Mapping evacuation risk on transportation networks using a spatial optimization model , 2000 .

[24]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 2001, TNET.

[25]  Alexander Stepanov,et al.  Production , Manufacturing and Logistics Multi-objective evacuation routing in transportation networks , 2009 .

[26]  J. MacGregor Smith,et al.  State-dependent queueing models in emergency evacuation networks , 1991 .

[27]  Yi-Chang Chiu,et al.  Network Flow Solution Method for Optimal Evacuation Traffic Routing and Signal Control with Nonuniform Threat , 2014 .

[28]  D. Neill,et al.  Traffic Flow Models and the Evacuation Problem , 2001 .

[29]  Shashi Shekhar,et al.  A Dartboard Network Cut Based Approach to Evacuation Route Planning: A Summary of Results , 2012, GIScience.

[30]  Benigno E. Aguirre,et al.  A Critical Review Of Emergency Evacuation Simulation Models , 2004 .

[31]  H. Holden,et al.  A mathematical model of traffic flow on a network of unidirectional roads , 1995 .

[32]  Eil Kwon,et al.  Evaluation of Emergency Evacuation Strategies for Downtown Event Traffic Using a Dynamic Network Model , 2005 .

[33]  Shashi Shekhar,et al.  Evacuation route planning: scalable heuristics , 2007, GIS.

[34]  F. Cruz,et al.  The buffer allocation problem for general finite buffer queueing networks , 2005 .

[35]  Qiong Wu,et al.  A Game Theory Based on Monte Carlo Analysis for Optimizing Evacuation Routing in Complex Scenes , 2015 .

[36]  Hong Zheng,et al.  Modeling no-notice mass evacuation using a dynamic traffic flow optimization model , 2007 .