Modeling and Performance Assessment of a Transit-Based Evacuation Plan within a Contraflow Simulation Environment

A bilevel optimization model is used to determine the waiting locations and corresponding shelters–in the case study, a combinatorial problem between bus stops and Metro stations–of a transit-based emergency evacuation plan and dispatch rescue buses toward the combinatorial locations. In additional, a contraflow simulation is elaborated to disperse the inside and ambient traffic of the target area. Results from the simulation can be used for modifying routing plans to avoid potential traffic bottlenecks. Findings indicate that the transit-based evacuation plan with the contraflow operations outperforms the same base plan without the contraflow operations. If more people select to evacuate via transit systems, the difficulties of dispersing traffic would be reduced and system performance remarkably improved.

[1]  Brian Wolshon,et al.  Alternative Methods to Increase the Effectiveness of Freeway Contraflow Evacuation , 2004 .

[2]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

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

[4]  Chris T. Kiranoudis,et al.  Modeling emergency evacuation for major hazard industrial sites , 2007, Reliab. Eng. Syst. Saf..

[5]  B. Wolshon,et al.  Modeling and Analysis of Evacuation Contraflow Termini , 2005 .

[6]  Lawrence Bodin,et al.  Routing and Scheduling of School Buses by Computer , 1979 .

[7]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

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

[9]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[10]  Nicos Christofides,et al.  Algorithms for Large-scale Travelling Salesman Problems , 1972 .

[11]  Essam Radwan,et al.  Emergency Evacuation Planning and Preparedness of Transit Facilities , 2007 .

[12]  Gilbert Laporte,et al.  The Plant Location Problem: New Models and Research Prospects , 1996, Oper. Res..

[13]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[14]  Ronald W. Perry,et al.  Behavioral foundations of community emergency planning , 1992 .

[15]  Gilbert Laporte,et al.  An analytical approach to the facility location and capacity acquisition problem under demand uncertainty , 2005, J. Oper. Res. Soc..

[16]  Cheng-Chieh Chen,et al.  Incorporating Contra Flow Simulation Into a Transit-Based Emergency Evacuation Plan , 2008 .

[17]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[18]  Zvi Drezner,et al.  Solving the multiple competitive facilities location problem , 2002, Eur. J. Oper. Res..

[19]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[20]  Steven I-Jy Chien,et al.  Analysis and Modeling of Simultaneous and Staged Emergency Evacuations , 2007 .