Large-Scale Evacuation Using Subway and Bus Transit: Approach and Application in City of Toronto
Publication: Journal of Transportation Engineering
Volume 138, Issue 10
Abstract
Public transportation systems play a significant role in emergency evacuation. Therefore, this paper is geared towards harnessing subway and bus transit to alleviate congestion pressure during evacuation of busy urban areas. Routing and scheduling of transit vehicles and subway operation is envisioned as a new variant of the well-established vehicle routing problem. The model presented in this paper combines multiple variants of the traditional vehicle routing problem while reflecting on the operational characteristics during emergency evacuation, to include (1) multiple depots to better distribute the transit fleet, (2) time constraints to account for the evacuation time window, and (3) constraints for pick-up and delivery locations of evacuees. The evacuation problem is hereafter defined as a multi-depot time-constrained pick-up delivery vehicle route problem. A framework, using constraint programming and local search methods, was developed to model and solve the problem. An optimal spatio-temporal evacuation model was performed first to optimize evacuation of background vehicular traffic, generating transit travel cost (i.e., link travel times) as an input to the evacuation problem. The methodology was applied to evacuate the entire city of Toronto. The results show that the Toronto Transit Commission fleet is capable of evacuating the transit-dependent population (1.34 million) within 2 h on average. The four subway lines of the city of Toronto carry approximately 0.62 million people and can evacuate these people in less than 3 h on average. Toronto Transit Commission shuttle buses (1,320 vehicles) can evacuate the remainder of the transit-dependent population (0.72 million) in approximately 1.5 h on average.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The authors gratefully acknowledge the financial support of the Connaught Fellowship of the University of Toronto; NSERC, OGSST, TAC, and CTRF Scholarships; the International Transport Forum (ITF) Yonge Researcher Award; and the Canada Research Chairs program. Travel demand data was provided by the Data Management Group (DMG) of the Urban Transportation Research Advancement Centre (UTRAC). This research was enabled by the Toronto Intelligent Transportation Systems Centre. The methodology and results presented in this paper reflect the views of the authors only.
References
Abdelgawad, H., Abdulhai, B., and Wahba, M. (2010). “Multi-objective optimization of multimodal evacuation.” Transportation Research Record 2196, Transportation Research Board, Washington, DC, 21–33.
Alshalalfah, B., and Shalaby, A. (2008). “Sensitivity of flex-route transit service to design and schedule-building characteristics.” Rep. 08-2563, Transportation Research Board, Washington, DC.
Alshalalfah, B., and Shalaby, A. (2012). “Feasibility of flex-route as a feeder transit service to rail stations in the suburbs: Case study in Toronto.” J. Urban Plann. Dev., 138(1), 90–100.
Berbeglia, G., Cordeau, J.-F., and Laporte, G. (2011). “A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem.” INFORMS J. Comput., (May 17, 2011).
Braysy, O., and Gendreau, M. (2005). “Vehicle routing problem with time windows, part I: Route construction and local search algorithms.” Transport. Sci., 39(1), 104–118.
Chiu, Y., Villalobos, J., Gautam, B., and Zheng, H. (2006). “Modeling and solving the optimal evacuation destination-route-flow-staging problem for no-notice extreme events.” Rep. 06-1574, Transportation Research Board, Washington, DC.
Chiu, Y. C., Zheng, H., Villalobos, J., and Gautam, B. (2007). “Modeling no-notice mass evacuation using a dynamic traffic flow optimization model.” IIE Trans., 39(1), 83–94.
Clarke, G., and Wright, J. (1964). “Scheduling of vehicles from a central depot to a number of delivery points.” Oper. Res., 12(4), 568–581.
DMG. (2003). “Transportation tomorrow survey summaries 2001.” 〈http://www.dmg.utoronto.ca/transportationtomorrowsurvey/1986to2001/index.html〉 (Jul. 2009).
Fisher, M. (1994). “Optimal solution of vehicle routing problems using minimum k-trees.” Oper. Res., 42(4), 626–642.
Fisher, M., and Jaikumar, R. (1981). “A generalized assignment heuristic for vehicle routing.” Networks, 11(2), 109–124.
Gambardella, L., Taillard, É., and Agazzi, G. (1999). “MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows.” Advanced topics in computer science series, McGraw-Hill, Maidenhead, UK, 63–76.
Garey, M., et al., and Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, New York.
Hobeika, A., and Kim, C. (1998). “Comparison of traffic assignments in evacuation modeling.” IEEE Trans. Eng. Manage., 45(2), 192–198.
Jaw, J., Odoni, A., Psaraftis, H., and Wilson, N. (1986). “Heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows.” Trans. Res. B Meth., 20(3), 243–257.
Kindervater, G., and Savelsbergh, M. (1997). “Vehicle routing: Handling edge exchanges.” Local search in combinatorial optimization, Wiley, New York, 337–360.
Lindsay, J. (2009). “Emergency management in Canada: Near misses and moving targets.” 〈www.training.fema.gov/EMIWeb/edu/ARRPT/March%2010,%202009.doc〉 (Jan. 2010).
Litman, T. (2006). “Lessons from Katrina and Rita: What major disasters can teach transportation planners.” J. Transport. Eng., 132(1), 11–18.
Liu, H., Ban, J., Ma, W., and Mirchandani, P. (2007). “Model reference adaptive control framework for real-time traffic management under emergency evacuation.” J. Urban Plann. Dev., 133(1), 43–50.
Liu, Y. (2007). “An integrated optimal control system for emergency evacuation.” Ph.D. dissertation, Dept. of Civil and Environmental Engineering, Univ. of Maryland, College Park, MD.
Miller, E. J., and Shalaby, A. (2003). “Evolution of personal travel in toronto area and policy implications.” J. Urban Plann. Dev., 129(1), 1–26.
Murray-Tuite, P., and Mahmassani, H. (2003). “Model of household trip-chain sequencing in emergency evacuation.” Transportation Research Record 1831, Transportation Research Board, Washington, DC, 21–29.
Pagès, L., Jayakrishnan, R., and Cortés, C. (2006). “Real-time mass passenger transport network optimization problems.” Transportation Research Record 1964, Transportation Research Board, Washington, DC, 229–237.
Rochat, Y., and Taillard, É. (1995). “Probabilistic diversification and intensification in local search for vehicle routing.” J. Heuristics, 1(1), 147–167.
Sattayhatewa, P., and Ran, B. (2000). “Developing a dynamic traffic management model for nuclear power plant evacuation.” Proc., 79th Annual Meeting of TRB, Transportation Research Board, Washington, DC.
Sayyady, F. (2007). “Optimizing the use of public transit system in non-notice evacuations in urban areas.” M.S. thesis, Dept. of Industrial and Systems Engineering, Mississippi State Univ., Starkville, MS.
Sbayti, H., and Mahmassani, H. (2006). “Optimal scheduling of evacuation operations.” Transportation Research Record 1964, Transportation Research Board, Washington, DC, 238–246.
Shaw, P. (1998). “Using constraint programming and local search methods to solve vehicle routing problems.” Lecture Notes Comp. Sci., 1520, 417–431.
Shaw, P., Furnon, V., and Backer, B. (2002). “A constraint programming toolkit for local search.” Operations research/computer science interfaces series, Springer, New York, 219–262.
Song, R., He, S., and Zhang, L. (2009). “Optimal transit routing problem for emergency evacuations.” Rep. 09-0931, Transportation Research Board, Washington, DC.
Transit Cooperative Research Program (TCRP). (2003). Transit capacity and quality of service manual (Part 4: Bus transit capacity), 2nd Ed., Transit Cooperative Research Program, Transportation Research Board, Washington, DC.
Toth, P., and Vigo, D. (2003). “The granular tabu search and its application to the vehicle-routing problem.” INFORMS J. Comput., 15(4), 333–346.
Transportation Research Board (TRB). (2008). “The role of transit in emergency evacuation.” Special Rep. 294, Committee on the Role of Public Transportation in Emergency Evacuation, Washington, DC.
Tuydes, H., and Ziliaskopoulos, A. (2004). “Network re-design to optimize evacuation contraflow.” Proc., 84th Annual Meeting of TRB, Transportation Research Board, Washington, DC.
Tuydes, H., and Ziliaskopoulos, A. (2006). “Tabu-based heuristic approach for optimization of network evacuation contraflow.” Transportation Research Record 1964, Transportation Research Board, Washington, DC, 157–168.
Vuchic, V. (2005). Urban transit: Operations, planning and economics, Wiley, New York.
Wahba, M. (2009). “MILATRAS microsimulation learning-based approach to transit assignment.” Ph.D. thesis, Univ. of Toronto, Toronto.
Xu, J., and Kelly, J. (1996). “A network flow-based tabu search heuristic for the vehicle routing problem.” Transport. Sci., 30(4), 379–393.
Yuan, F., Han, L., Chin, S., and Hwang, H. (2006). “Proposed framework for simultaneous optimization of evacuation traffic destination and route assignment.” Transportation Research Record 1964, Transportation Research Board, Washington, DC.
Zhang, H., Wang, X., Lu, W., and Mu, Z. (2010). “Urban transit coordination using an artificial transportation system.” IEEE Trans. Intell. Transport. Syst., 12(2), 374–383.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 138 • Issue 10 • October 2012
Pages: 1215 - 1232
Copyright
© 2012 American Society of Civil Engineers.
History
Received: Mar 10, 2011
Accepted: Nov 4, 2011
Published online: Nov 9, 2011
Published in print: Oct 1, 2012
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.