Skip to main content

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 659))

  • 1194 Accesses

Abstract

Evacuation plans are developed for buildings, ships, stadiums or districts, cities or whole sub-national region. In the following literature review, mathematical programming and simulation approaches that consider, mainly, the evacuation planning concerning the evacuation from regions like districts, towns or regions will be presented. Recently, there have been a number of articles concerned with evacuation planning and evacuation support. They could be divided into flow-based optimization approaches which seek to compute an optimal solution of certain objectives and simulation approaches that evaluate an existing evacuation plan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Aronson JE (1989) A survey of dynamic network flows. Ann Oper Res 20:1–66

    Google Scholar 

  • Barrett B, Ran B, Pillai R (2000) Developing a dynamic traffic management modeling framework for hurricane evacuation. Transport Res Rec: J Transport Res Board 1733:115–121

    Google Scholar 

  • Baumann N, Köhler E (2007) Approximating earliest arrival flows with flow-dependent transit times. Discrete Appl Math 155(2):161–171

    Google Scholar 

  • Baumann N, Skutella M (2006) Solving evacuation problems efficiently–earliest arrival flows with multiple sources. In: 47th annual IEEE symposium on foundations of computer science (FOCS’06), pp 399–410

    Google Scholar 

  • Bretschneider S, Kimms A (2011a) A basic mathematical model for evacuation problems in urban areas. Transport Res A Pol Pract 45:523–539

    Google Scholar 

  • Bretschneider S, Kimms A (2011b) Pattern-based evacuation planning for urban areas. Eur J Oper Res 216:57–69

    Google Scholar 

  • Burkard R, Dlaska K, Klinz B (1993) The quickest flow problem. ZOR Meth Models Oper Res 37:31–58

    Google Scholar 

  • Cai X, Sha D, Wong CK (2001) Time-varying minimum cost flow problems. Eur J Oper Res 131(2):352–374

    Google Scholar 

  • Carey M (2001) Dynamic traffic assignment with more flexible modelling within links. Network Spatial Econ 1:349–375

    Google Scholar 

  • Chalmet LG, Francis RL, Saunders PB (1982) Network models for building evacuation. Manag Sci 28(1):86–105

    Google Scholar 

  • Chen L, Miller-Hooks E (2008) The building evacuation problem with shared information. Nav Res Logist 55:363–376

    Google Scholar 

  • Chen X, Zhan F (2008) Agent-based modelling and simulation of urban evacuation: relative effectiveness of simultaneous and staged evacuation strategies. J Oper Res Soc 59:25–33

    Google Scholar 

  • Chiu Y-C, Zheng H (2007) Real-time mobilization decisions for multi-priority emergency response resources and evacuation groups: model formulation and solution. Transport Res Part E: Logist Transport Rev 43(6):710–736, Challenges of Emergency Logistics Management

    Google Scholar 

  • Chiu Y-C, Zheng H, Villalobos J, Gautam B (2007) Modeling no-notice mass evacuation using a dynamic traffic flow optimization model. IEE Trans 39:83–94

    Google Scholar 

  • Choi W, Hamacher HW, Tufekci S (1988) Modeling of building evacuation problems by network flows with side constraints. Eur J Oper Res 35:98–110

    Google Scholar 

  • Cova TJ, Church RL (1997) Modeling community evacuation vulnerability using GIS. Int J Geograp Inform Sci 11(8):763–784

    Google Scholar 

  • Cova TJ, Johnson JP (2002) Microsimulation of neighborhood evacuations in the urban-wildland interface. Environ Plann A 34:2211–2229

    Google Scholar 

  • Cova TJ, Johnson JP (2003) A network flow model for lane-based evacuation routing. Transport Res A Pol Pract 37(7):579–604

    Google Scholar 

  • Daganzo CF (1994) The cell transmission model: a dynamic representation of highway traffic consistent with the hydrodynamic theory. Transport Res B 28B(4):269–287

    Google Scholar 

  • Daganzo CF (1995) The cell transmission model Part II: network traffic. Transport Res B 29B(2):79–93

    Google Scholar 

  • Edara P, Sharma S, McGhee C (2010) Development of a large-scale traffic simulation model for hurricane evacuation—methodology and lessons learned. Nat Hazards Rev 11(4):127–139

    Google Scholar 

  • Farahmand K (1997) Application of simulation modeling to emergency population evacuation. In: Proceedings of the 1997 winter simulation conference, ACM, Atlanta, GA, 7–10 Dec 1997, pp 1181–1187

    Google Scholar 

  • Fleischer L (2001) Faster algorithms for the quickest transshipment problem. SIAM J Optim 12:18–35

    Google Scholar 

  • Fleischer L, Skutella M (2002) Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms, Baltimore, Maryland Publisher Society for Industrial and Applied Mathematics Philadelphia, PA, 12–14 Jan 2003, pp 66–75, 2002

    Google Scholar 

  • Fleischer L, Skutella M (2007) Quickest flows over time. SIAM J Comput 36(6):1600–1630

    Google Scholar 

  • Ford LR Jr, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6(3):419–433

    Google Scholar 

  • Gale D (1959) Transient flows in networks. Michigan Math J 6(1):59–63

    Google Scholar 

  • Hall A, Schilling H (2005) Flows over time: towards a more realistic and computationally tractable model. In: Proceedings of the 7th workshop on algorithm engineering and experiments (ALENEX05), SIAM, pp 55–67, 2005

    Google Scholar 

  • Hamacher H, Tjandra S (2001) Mathematical modeling of evacuation problems: a state of art. Berichte des Frauenhofer ITWM, Nr. 24. http://www.itwm.fraunhofer.de/fileadmin/ITWM-Media/Zentral/Pdf/Berichte_ITWM/2001/bericht24.pdf. Accessed 18 Oct 2006

  • Hamacher HW, Tufekci S (1987) On the use of lexicographic min cost flows in evacuation modeling. Nav Res Logist 34:487–503

    Google Scholar 

  • Hamacher H, Ruzika S, Tjandra S (2006) Algorithms for time-dependent bicriteria shortest path problems. Discrete Optim 3:238–254

    Google Scholar 

  • Han LD, Yuan F, Chin S, Hwang H (2006a) Global optimization of emergency assignments. Interfaces 36(6):502–513

    Google Scholar 

  • Han LD, Yuan F, Chin S, Hwang H (2006b) Proposed framework for simultaneous optimization of evacuation traffic destination and route assignment. Transport Res Rec: J Transport Res Board 1964:50–58

    Google Scholar 

  • Hobeika A, Kim C (1998) Comparison of traffic assignments in evacuation modeling. IEEE Trans Eng Manag 45(72):192–198

    Google Scholar 

  • Hobeika A, Kim S, Beckwith RE (1994) A decision support system for developing evacuation plans around nuclear power stations. Interfaces 24(4):22–35

    Google Scholar 

  • Hobeika AG, Jamei B (1985) MASSVAC: a model for calculating evacuation times under natural disasters. In: Proceedings on the conference on emergency planning, Simulation Series 15, vol 5, pp 23–28

    Google Scholar 

  • Hoppe B (1995) Efficient dynamic network flow algorithms. Ph.D. thesis, Cornell University, Ithaca, NY

    Google Scholar 

  • Hoppe B, Tardos E (1994) Polynomial time algorithms for some evacuation problems. In: Proceedings of the fifth annual ACM-SIAM symposium on discrete algorithms 1994, Publisher Society for Industrial and Applied Mathematics Philadelphia, PA, pp 433–441, 1994

    Google Scholar 

  • Hoppe B, Tardos E (2000) The quickest transshipment problem. Math Oper Res 25(1):36–62

    Google Scholar 

  • Huang R, Kim S, Menezes MBC (2010) Facility location for large-scale emergencies. Ann Oper Res 181:271–286

    Google Scholar 

  • Jarvis JJ, Ratliff HD (1982) Some equivalent objectives for dynamic network flow problems. Manag Sci 28(1):106–108

    Google Scholar 

  • Kamiyama N, Katoh N, Takizawa A (2006) An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. In: Cheng S-W, Poon C (eds) Algorithmic aspects in information and management. Lecture notes in computer science, vol 4041. Springer, Berlin, pp 231–242

    Google Scholar 

  • Kaufman DE, Nonis J, Smith RL (1998) A mixed integer linear programming model for dynamic route guidance. Transport Res B 32(6):431–440

    Google Scholar 

  • Kim S, Shekhar S (2005) Contraflow network reconfiguration for evacuation planning: a summary of results. In: Proceedings of the 13th annual ACM international workshop on geographic information systems. GIS ’05. ACM, New York, pp 250–259

    Google Scholar 

  • Kim S, George B, Shekhar S (2007) Evacuation route planning: scalable heuristics. In: Proceedings of the 15th annual ACM international symposium on advances in geographic information systems. GIS ’07. ACM, New York, pp 20:1–20:8

    Google Scholar 

  • Kim S, Shekhar S, Min M (2008) Contraflow transportation network reconfiguration for evacuation route planning. IEEE Transact Knowl Data Eng 20(8):1115–1129

    Google Scholar 

  • Kimms A, Maassen K-C (2010a) A fast heuristic approach for large scale cell-transmission-based evacuation planning. Working paper, University of Duisburg-Essen

    Google Scholar 

  • Kimms A, Maassen K-C (2010b) Cell-transmission-based evacuation planning with rescue teams. Working paper, University of Duisburg-Essen

    Google Scholar 

  • Kimms A, Maassen K-C (2011a) Extended cell-transmission-based evacuation planning in urban areas. Pesquisa Operacional 31:405–441

    Google Scholar 

  • Kimms A, Maassen K-C (2011b) Optimization and simulation of traffic flows in the case of evacuating urban areas. OR Spect 33:571–593

    Google Scholar 

  • Klinz B, Woeginger GJ (1995) Minimum cost dynamic flows: the series-parallel case. In: Proceedings of the 4th international IPCO conference on integer programming and combinatorial optimization. Springer, London, pp 329–343

    Google Scholar 

  • Klinz B, Woeginger GJ (2004) Minimum cost dynamic flows: the series-parallel case. Networks 43(3):153–162

    Google Scholar 

  • Köhler E, Skutella M (2005) Flows over time with load-dependent transit times. SIAM J Opt 15(4):1185–1202

    Google Scholar 

  • Köhler E, Langkau K, Skutella M (2002) Time-expanded graphs for flow-dependent transit times. In: Mhring R, Raman R (eds) Algorithms – ESA 2002. Lecture notes in computer science, vol 2461. Springer, Berlin, pp 49–56

    Google Scholar 

  • Köhler E, Möhring RH, Skutella M (2009) Traffic networks and flows over time. In: Lerner J, Wagner D, Zweig K (eds) Algorithmics of large and complex networks. Lecture notes in computer science, vol 5515. Springer, Berlin, pp 166–196

    Google Scholar 

  • Kongsomsaksakul S, Yang C, Chen A (2005) Shelter location-allocation model for flood evacuation planning. J E Asia Soc Transport Stud 6:4237–4252

    Google Scholar 

  • Kotnyek B (2003) An annotated overview of dynamic network flows. Technical report, INRIA, Paris, Nr. 4936. http://hal.inria.fr/inria-00071643/

  • Langkau K (2003) Flows over time with flow-dependent transit times. Ph.D. thesis, Technische Universität Berlin, Germany

    Google Scholar 

  • Lim GJ, Zangeneh S, Baharnemati MR, Assavapokee T (2009) A simple binary search algorithm for short notice evacuation scheduling and routing. In: Proceedings of the 2009 industrial engineering research conference. http://www.serri.org/publications/Documents/JSU%20Project%2070004%20IERC2009%20-%20Technical%20Paper%20by%20UH%20%28Aliabadi%29.pdf, 18 December 2010, 10:28 MEZ

  • Liu Y, Hatayama M, Okada N (2006a) Development of an adaptive evacuation route algorithm under flood disaster. Ann Disast Prev Res Inst. Kyoto University 49:189–195

    Google Scholar 

  • Liu Y, Lai X, Chang G-L (2006b) Cell-based network optimization model for staged evacuation planning under emergencies. Transport Res Rec: J Transport Res Board 1964:127–135

    Google Scholar 

  • Liu Y, Lai X, Chang G-L (2006c) Two-level integrated optimization system for planning of emergency evacuation. J Transport Eng 132(10):800–807

    Google Scholar 

  • Lu Q, George B, Shekhar S (2005) Capacity constrained routing algorithms for evacuation planning: a summary of results. In: Medeiros BC, Egenhofer M, Bertino E (eds) Lecture notes in computer science, vol 3633. Springer, Berlin, pp 291–307

    Google Scholar 

  • Mamada S, Uno T, Makino K, Fujishige S (2005) A tree partitioning problem arising from an evacuation problem in tree dynamic networks. J Oper Res Soc Jpn 48(3):196–206

    Google Scholar 

  • Merchant DK, Nemhauser GL (1978) A model and an algorithm for the dynamic traffic assignment problems. Transport Sci 12(3):183–199

    Google Scholar 

  • Miller-Hooks E, Patterson SS (2004) On solving quickest time problems in time-dependent, dynamic networks. J Math Model Algorithm 3:39–71

    Google Scholar 

  • Nasrabadi E, Hashemi SM (2010) Minimum cost time-varying network flow problems. Optim Meth Software 25(3):429–447

    Google Scholar 

  • Ng M, Waller ST (2009) The evacuation optimal network design problem: model formulation and comparison. Transport Lett: Int J Transport Res 1:111–119

    Google Scholar 

  • Ng M, Waller ST (2010) Reliable evacuation planning via demand inflation and supply deflation. Transport Res Part E: Logist Transport Rev 46(6):1086–1094

    Google Scholar 

  • Osman MS, Ram B, Bhadury J, Stanfield P, Davis L, Samanlioglu (2009) Optimization model for distributed routing for disaster area logistics. In: Proceedings of the 2009 IEEE international conference on service operations, logistics and informatics, Sponsored by the IEEE Intelligent Transportation Systems Society, INFORMS Service Science Section, Chicago, IL, USA, 22–29 July 2009, pp 278–283

    Google Scholar 

  • Özdamar L, Yi W (2007) A dynamic logistics coordination model for evacuation and support in disaster response activities. Eur J Oper Res 179(3):1177–1193

    Google Scholar 

  • Özdamar L, Yi W (2008) Greedy neighborhood search for disaster relief and evacuation logistics. IEEE Intell Syst 23(1):14–23

    Google Scholar 

  • Pascoal MMB, Captivo MEV, Climaco JCN (2006) A comprehensive survey on the quickest path problem. Ann Oper Res 147(1):5–21

    Google Scholar 

  • Peeta S, Kalafatas G (2008) Primary emergency routes for transportation security. Joint transportation research program, Paper 323. http://docs.lib.purdue.edu/jtrp/323

  • Peeta S, Kalafatas G (2009) Planning for evacuation: insights from an efficient network design model. J Infrastruct Syst 15(1):21–30

    Google Scholar 

  • Pel AJ, Hoogendoorn SP, Bliemer MC (2010) Evacuation modeling including traveler information and compliance behavior. In: Hoogendoorn SP, Pel AJ, Taylor MAP, Mahmassani H (eds), 1st conference on evacuation modeling and management, Procedia engineering, vol 3, pp 101–111, http://www.sciencedirect.com/science/article/pii/S1877705810004807, 20.02.2011

  • Pérez-Villalonga F, Salmerón J, Wood K (2008) Dynamic evacuation routes for personnel on a naval ship. Nav Res Logist 55:785–799

    Google Scholar 

  • Rebennack S, Arulselvan A, Elefteriadou L, Pardalos P (2010) Complexity analysis for maximum flow problems with arc reversals. J Combin Optim 19:200–216, 10.1007/s10878-008-9175-8

    Google Scholar 

  • Regnier E (2008) Public evacuation decisions and hurricane track uncertainty. Manag Sci 54(1):16–28

    Google Scholar 

  • Saadatseresht M, Mansourian A, Taleai M (2009) Evacuation planning using multiobjective evolutionary optimization approach. Eur J Oper Res 198(1):305–314

    Google Scholar 

  • Sheffi Y (1984) Urban transportation networks: equilibrium analysis with mathematical programming techniques. Prentice Hall, NJ

    Google Scholar 

  • Sheffi Y, Mahmassani H, Powell WB (1982) A transportation network evacuation model. Transport Res A 16(3):209–218

    Google Scholar 

  • Sherali HD, Carter TB, Hobeika AG (1991) A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions. Transport Res Part B: Methodol 25(6):439–452

    Google Scholar 

  • Skutella M (2008) An introduction to network flows over time. In: Cook WJ, Lovasz L, Vygen J (eds) Research trends in combinatorial optimization. Springer, Berlin, pp 451–482

    Google Scholar 

  • Southworth F (1991) Regional evacuation modeling: a state-of-the-art review. Oak Ridge National Laboratory ORNL-11740, Tennessee

    Google Scholar 

  • Southworth F, Chin S-M (1987) Network evacuation modelling for flooding as a result of a dam failure. Environ Plann A 19:1543–1558

    Google Scholar 

  • Stepanov A, MacGregor Smith J (2009) Multi-objective evacuation routing in transportation networks. Eur J Oper Res 198(2):435–446

    Google Scholar 

  • Taaffe K, Kohl R, Kimbler D (2005) Hospital evacuation: issues and complexities. In: Proceedings of the 2005 winter simulation conference, ACM 2005, ISBN 0-7803-9519-0, Orlando, FL, 4–7 Dec 2005, pp 943–950

    Google Scholar 

  • Theodoulou G, Wolshon B (2004) Alternative methods to increase the effectiveness of freeway contraflow. J Transport Res Board 1865:48–56

    Google Scholar 

  • Tjandra SA (2003) Dynamic network flow optimization with application to the evacuation problem. Ph.D. thesis, University of Kaiserslautern

    Google Scholar 

  • Tuydes H, Ziliaskopoulos A (2006) Tabu-based heuristic approach for optimization of network evacuation contraflow. Transport Res Rec: J Transport Res Board 1964(1):157–168

    Google Scholar 

  • Williams BM, Tagliaferri AP, Meinhold SS, Hummer JE, Rouphail NM (2007) Simulation and analysis of freeway lane reversal for coastal hurricane evacuation. J Urban Plann Develop 133(1):61–72

    Google Scholar 

  • Xie C, Turnquist MA (2009) Integrated evacuation network optimization and emergency vehicle assignment. Transport Res Rec: J Transport Res Board 2091:79–90

    Google Scholar 

  • Xie C, Turnquist MA (2011) Lane-based evacuation network optimization: an integrated lagrangian relaxation and tabu search approach. Transport Res C Emerg Tech 19(1):40–63

    Google Scholar 

  • Xie C, Lin D-Y, Waller ST (2010) A dynamic evacuation network optimization problem with lane reversal and crossing elimination strategies. Transport Res Part E: Logist Transport Rev 46(3):295–316

    Google Scholar 

  • Yamada T (1996) A network flow approach to a city emergency evacuation planning. Int J Syst Sci 27(10):931–936

    Google Scholar 

  • Yao T, Mandala SR, Chung BD (2009) Evacuation transportation planning under uncertainty: a robust optimization approach. Network Spatial Econ 9:171–189

    Google Scholar 

  • Yazici MA, Ozbay K (2007) Impact of probabilistic road capacity constraints on the spatial distribution of hurricane evacuation shelter capacities. Transport Res Rec: J Transport Res Board 2022(1):55–62

    Google Scholar 

  • Zhang H, Gao Z (2007) Two-way road network design problem with variable lanes. J Syst Sci Syst Eng 16(1):50–61

    Google Scholar 

  • Ziliaskopoulos AK (2000) A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transport Sci 34(1):37–49

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bretschneider, S. (2012). Literature Review. In: Mathematical Models for Evacuation Planning in Urban Areas. Lecture Notes in Economics and Mathematical Systems, vol 659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28759-6_2

Download citation

Publish with us

Policies and ethics