A fast heuristic approach for large‐scale cell‐transmission‐based evacuation route planning

The cell-transmission-model by Daganzo (1994) was introduced as a traffic simulation model. Its basic ideas were picked up recently to formulate optimization models for evacuation planning. These optimization models were capable of generating high quality evacuation plans, but computational effort and computational requirements, especially in dimensions of real-world applications, were very high. To extend adaptability to much larger evacuation scenarios, a fast heuristic procedure will be presented. In a computational study, we will demonstrate the effectiveness of our approach in several real-world scenarios of different road network size, population distribution, and risk distribution, respectively. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Jianjun Zhang,et al.  Using GIS to assess the risks of hazardous materials transport in networks , 2000, Eur. J. Oper. Res..

[3]  Jens Vygen,et al.  A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing , 2009, J. Discrete Algorithms.

[4]  Takeo Yamada,et al.  A network flow approach to a city emergency evacuation planning , 1996, Int. J. Syst. Sci..

[5]  P. I. Richards.  Shock Waves on the Highway , 1956 .

[6]  Huey-Kuo Chen,et al.  Heuristics for the stochastic/dynamic user-optimal route choice problem , 2000, Eur. J. Oper. Res..

[7]  Athanasios K. Ziliaskopoulos,et al.  Tabu-Based Heuristic Approach for Optimization of Network Evacuation Contraflow , 2006 .

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

[9]  M J Lighthill,et al.  On kinematic waves II. A theory of traffic flow on long crowded roads , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[10]  Alf Kimms,et al.  Optimization and simulation of traffic flows in the case of evacuating urban areas , 2011, OR Spectr..

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

[12]  Athanasios K. Ziliaskopoulos,et al.  A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem , 2000, Transp. Sci..

[13]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..

[14]  Carlos F. Daganzo,et al.  THE CELL TRANSMISSION MODEL, PART II: NETWORK TRAFFIC , 1995 .

[15]  Marc P. Armstrong,et al.  Using geographic plume analysis to assess community vulnerability to hazardous accidents , 1995 .

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

[17]  Roger E. Kasperson,et al.  Emergency planning and nuclear power , 1988 .

[18]  Y. Q. Liu,et al.  An improved Dijkstra's shortest path algorithm for sparse network , 2007, Appl. Math. Comput..

[19]  Lin Cheng,et al.  Application of Auction Algorithm for Shortest Paths to Traffic Assignment , 2006 .

[20]  J. Smith,et al.  A k-SHORTEST PATHS ROUTING HEURISTIC FOR STOCHASTIC NETWORK EVACUATION MODELS , 1984 .

[21]  Alf Kimms,et al.  Extended cell-transmission-based evacuation planning in urban areas , 2011 .

[22]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[23]  John H. Sorensen,et al.  An approach for deriving emergency planning zones for chemical munitions emergencies , 1992 .

[24]  C. Daganzo.  THE CELL TRANSMISSION MODEL.. , 1994 .