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.
Get full access to this article
View all access options for this article.
References
1.
ChienS. I. and KorikanthimathV.Analysis and Modeling of Simultaneous and Staged Emergency Evacuations. Journal of Transportation Engineering, Vol. 133, No. 32007, pp. 190–197.
2.
GeorgiadouP. S.PapazoglouI. A.KiranoudisC. T. and MarkatosN. C.Modeling Emergency Evacuation for Major Hazard Industrial Sites. Reliability Engineering and System Safety, Vol. 92, No. 102007, pp. 1388–1402.
3.
LindellM. K. and PerryR. W.Behavioral Foundations of Community Emergency Planning.Hemisphere Publishing, Washington, D.C., 1992.
4.
KwonE. and PittS.Evaluation of Emergency Evacuation Strategies for Downtown Event Traffic Using a Dynamic Network Model. In Transportation Research Record: Journal of the Transportation Research Board, No. 1922, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 149–155.
5.
WolshonB.LimY. Y. and TheodoulouG.Modeling and Analysis of Evacuation Contraflow Termini. In Proc., Solutions to Coastal Disasters, American Society of Civil Engineers, Reston, Va., 2005, pp. 759–771. www.asce.org/conferences/cd05.
6.
TheodoulouG. and WolshonB.Alternative Methods to Increase the Effectiveness of Freeway Contraflow Evacuation. In Transportation Research Record: Journal of the Transportation Research Board, No. 1865, Transportation Research Board of the National Academies, Washington, D.C., 2004, pp. 48–56.
7.
ElmitinyN.RamasamyS. and RadwanE.Emergency Evacuation Planning and Preparedness of Transit Facilities: Traffic Simulation Modeling. In Transportation Research Record: Journal of the Transportation Research Board, No. 1992, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 121–126.
8.
ChenC. C. and ChouC.-S.Incorporating Contra-Flow Simulation into a Transit-Based Emergency Evacuation Plan. In Proc., 15th World Congress on ITS, New York, 2008.
9.
RevelleC. S. and LaporteG.The Plant Location Problem: New Models and Research Prospects. Operations Research, Vol. 44, No. 61996, pp. 864–874.
10.
DasciA. and LaporteG.An Analytical Approach to the Facility Location and Capacity Acquisition Problem Under Demand Uncertainty. Journal of the Operational Research Society, Vol. 56, No. 42005, pp. 397–405.
11.
DreznerT.DreznerZ. and SalhiS.Solving the Multiple Competitive Facilities Location Problem. European Journal of Operational Research, Vol. 142, No. 12002, pp. 138–151.
12.
BodinL. D.GoldenB. L.AssadA. A. and BallM. O.Routing and Scheduling of Vehicles and Crews: The State of the Art. Computers and Operations Research, Vol. 10, No. 21983, pp. 63–211.
13.
GillettB. E. and MillerL. R.A Heuristic Algorithm for the Vehicle-Dispatch Problem. Operations Research, Vol. 22, No. 21974, pp. 340–349.
14.
KarpR.Probabilistic Analysis of Partitioning Algorithm for the Traveling-Salesman Problem in the Plane. Mathematics of Operations Research, Vol. 2, No. 31977, pp. 209–224.
15.
BodinL. D. and BermanL.Routing and Scheduling of School Buses by Computer. Transportation Science, Vol. 13, No. 21979, pp. 113–129.
16.
ClarkeG. and WrightJ. W.Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, Vol. 12, No. 41964, pp. 568–581.
17.
LinS. and KernighanB.An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research, Vol. 21, No. 21973, pp. 498–516.
18.
ChristofidesN. and EilonS.Algorithms for Large-Scale Travelling Salesman Problems. Operations and Research Quarterly, Vol. 23, No. 41972, pp. 511–518.
19.
FisherM. and JaikumarR.A Generalized Assignment Heuristic for Vehicle Routing. Networks, Vol. 11, No. 21981, pp. 109–124.
20.
ChristofidesN.MingozziA. and TothP.Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxations. Mathematical Programming, Vol. 20, No. 11981, pp. 255–282.
