Skip to main content

Heuristic Solution Techniques for No-Notice Emergency Evacuation Traffic Management

  • Conference paper
  • First Online:

Part of the book series: Transportation Research, Economics and Policy ((TRES))

Abstract

When responding to unanticipated emergency events, time is of the essence. This paper proposes a heuristic algorithm for staged traffic evacuation, referred to as HASTE, which is shown to approximate a solution to the cell transmission-based many-to-one dynamic system optimum (DSO) traffic assignment problem. The proposed algorithm does not contain traffic holding, is fast enough for online applications, and produces evacuee routing schedules as its output. As an application of HASTE, a mixed 0-1 integer programming extension to the DSO is proposed to identify critical signalized intersection locations in the network for deployment of a limited number of police officers aimed at improving network throughput and further minimizing evacuee exposure time to the hazard. For the combined problem, a genetic algorithms-based solution procedure is proposed that uses HASTE for solution fitness. Efficiency and quality of the heuristic strategies are demonstrated via numerical experiments for moderately sized problems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  • Ahuja L, Magnanti T, Orlin J (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Anstreicher K (1999) Linear programming in O((n 3 ∕ lnn)L) operations. SIAM J Optim 9:803–812

    Article  Google Scholar 

  • Barbehenn M (1998) A note on the complexity of Dijkstra’s Algorithm for graphs with weighted vertices. IEEE Trans Comput 47(2):263

    Article  Google Scholar 

  • Beard C, Ziliaskopoulos A (2006) System optimal signal optimization formulation. Transp Res Rec 1978:102–112

    Article  Google Scholar 

  • Daganzo C (1994) The cell transmission model. Part I: A simple dynamic representation of highway traffic. Transp Res 28B(4):269–287

    Google Scholar 

  • Daganzo C (1995) The cell transmission model, Part II: Network traffic. Transp Res 29B(2):79–93

    Article  Google Scholar 

  • Dantzig G, Thapa M (1997) Linear programming 1: introduction; 2: theory and extensions. Springer, New York

    Google Scholar 

  • Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Boston

    Google Scholar 

  • Kalafatas G, Peeta S (2006) A graph-based formulation for the single destination dynamic traffic assignmant problem. In: Proceedings of DTA2006: first international symposium in dynamic traffic assignment, Leads, UK

    Google Scholar 

  • Lee S (1996) A cell transmission based assignment-simulation model for integrated freeway/surface street systems. Master’s thesis, Ohio State University

    Google Scholar 

  • Li Y, Waller S, Ziliaskopoulos T (2003) A decomposition scheme for system optimal dynamic traffic assignment models. Netw Spat Econ 3(4):441–455

    Article  Google Scholar 

  • Lighthill M, Whitham G (1955) On kinematic waves. II. A theory of traffic flow on long crowded roads. Proc R Soc Lond A Math Phys Sci 229(1178):317–345

    Google Scholar 

  • Lin W, Wang C (2004) An enhanced 0-1 mixed-integer LP formulation for traffic signal control. IEEE Trans Intell Transp Syst 5(4):238–245

    Article  Google Scholar 

  • Lo H (1999a) A dynamic traffic assignment formulation that encapsulates the cell-transmission model. In: Ceder A (eds) Traffic and transportation theory. Proc ISTTT. Elsevier: Tarrytown, NY

    Google Scholar 

  • Lo H (1999b) A novel traffic signal control formulation. Transp Res 33A(6):433–448

    Google Scholar 

  • Lo H (2001) A cell-based traffic control formulation: strategies and benefits of dynamic timing plans. Transp Sci 35(2):148–164

    Article  Google Scholar 

  • Lo H, Chang E, Chan Y (2001) Dynamic network traffic control. Transp Res 35A(8):721–744

    Google Scholar 

  • Richards P (1956) Shock waves on the highway. Oper Res 4(1):42–51

    Article  Google Scholar 

  • Shen W, Nie Y, Zhang H (2007) Dynamic network simplex method for designing emergency evacuation plans. Transp Res Rec 2022:83–93

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Saif Eddin Jabari .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this paper

Cite this paper

Jabari, S.E., He, X., Liu, H.X. (2012). Heuristic Solution Techniques for No-Notice Emergency Evacuation Traffic Management. In: Levinson, D., Liu, H., Bell, M. (eds) Network Reliability in Practice. Transportation Research, Economics and Policy. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0947-2_14

Download citation

Publish with us

Policies and ethics