Skip to main content
SpringerLink
Log in

Dynamic Resource Allocation Problem for Transportation Network Evacuation

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

Allocating movable response resources dynamically enables evacuation management agencies to improve evacuation system performance in both the spatial and temporal dimensions. This study proposes a mixed integer linear program (MILP) model to address the dynamic resource allocation problem for transportation evacuation planning and operations. To enable realism in practice, the proposed model includes spatiotemporal constraints related to the time required to reallocate resources to another location, the minimum time allocated resources should be at a location, and the minimum time gap between successive allocations of resources to a location. The proposed model is transformed into a two-stage optimization program for which a greedy-type heuristic algorithm is developed to solve the MILP approximately but efficiently. Results from computational experiments demonstrate the effectiveness of the proposed model and the efficiency of the heuristic solution algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

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

    Article  Google Scholar 

  • Bish DR, Chamberlayne EP, Rakha HA (2013) Optimizing network flows with congestion-based flow reductions. Netw Spat Econ 13(3):283–306

    Article  Google Scholar 

  • Chiu YC, Zheng H (2007) Real-time mobilization decisions for multi-priority emergency response resources and evacuation groups: model formulation and solution. Transp Res E 43(6):710–736

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Hsu YT, Peeta S (2013) An aggregate approach to model evacuee behavior for no-notice evacuation operations. Transportation 40(3):671–696

    Article  Google Scholar 

  • Jabari SE, He X, Liu HX (2012) Heuristic solution techniques for no-notice emergency evacuation traffic management. In: Levinson DM, Liu HX, Bell M (eds) Network reliability in practice. Springer, University of Minnesota, pp 241–259

    Chapter  Google Scholar 

  • Janson BN (1995) Network design effects of dynamic traffic assignment. ASCE J Transp Eng 121(1):1–13

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Jeon K, Ukkusuri SV, Waller ST (2006) Selectorecombinative genetic algorithm to relax computational complexity of discrete network design problem. Transp Res Rec 1964:91–103

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  • Liu Y, Luo Z (2012) A bi-level model for planning signalized and uninterrupted flow intersections in an evacuation network. Comput Aided Civ Infrastruct Eng 27(10):731–747

    Article  Google Scholar 

  • Liu Y, Lai X, Chang GL (2006a) Two-level integrated optimization system for planning of emergency evacuation. ASCE J Transp Eng 132(10):800–807

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Nassir N (2013) Optimal integrated dynamic traffic assignment and signal control for evacuation of large traffic networks with varying threat levels. PhD Dissertation, The University of Arizona

    Google Scholar 

  • Nassir, N., Hickman, M.D., Zheng, H., Chiu, Y.-C. (2014) Integrated cell-transmission single-destination system optimal dynamic traffic assignment with optimal signal timing. Proceedings of the 93rd Annual Meeting of Transportation Research Board, Washington, DC, 2014.

  • Patil GR, Ukkusuri SV (2007) System-optimal stochastic transportation network design. Transp Res Rec 2029:80–86

    Article  Google Scholar 

  • Peeta S, Mahmassani HS (1995) Multiple user classes real-time traffic assignment for online operations: a rolling horizon solution framework. Transp Res C 3(2):83–98

    Article  Google Scholar 

  • Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: the past, the present and the future. Netw Spat Econ 1(3–4):33–256

    Google Scholar 

  • Peeta S, Salman FS, Gunnec D, Viswanath K (2010) Pre-disaster investment decisions for strengthening a highway network. Comput Oper Res 37(10):1708–1719

    Article  Google Scholar 

  • Ran B, Lee D-H, Shin MS (2002) Dynamic traffic assignment with rolling horizon implementation. ASCE J Transp Eng 128(4):314–322

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Sbayti H, Mahmassani HS (2006) Optimal scheduling of evacuation operations. Transp Res Rec 1964:238–246

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Ukkusuri SV, Waller ST (2008) Linear programming models for the user and system optimal dynamic network design problem: formulations, comparisons and extensions. Netw Spat Econ 8(4):383–406

    Article  Google Scholar 

  • Waller ST, Ziliaskopoulos AK (2001) A dynamic and stochastic approach to network design. Transp Res Rec 1771:106–114

    Article  Google Scholar 

  • Walton, J.J., Wolshon, B. (2011) Criteria for Development of Evacuation Time Estimate Studies. NUREG/CR-7002 SAND2010-0016P. Washington, DC: US Nuclear Regulatory Commission. Downloaded from pbadupws.nrc.gov/docs/ML1130/ML113010515.pdf

  • Wolsey LA (1998) Integer programming. Wiley, Louvain-la-Neuve

    Google Scholar 

  • Xie C, Turnquist MA (2011) Lane-based evacuation network optimization: an integrated Lagrangian relaxation and tabu search approach. Transp Res C 19(11):40–63

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Zheng H, Chiu YC (2011) A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem. Transp Sci 45(1):121–137

    Article  Google Scholar 

  • Zheng H, Chiu YC, Mirchandani PB, Hickman M (2010) Modeling of evacuation and background traffic for optimal zone-based vehicle evacuation strategy. Transp Res Rec 2196:65–74

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgments

This work is based on funding provided by the U.S. Department of Transportation through the NEXTRANS Center, the USDOT Region 5 University Transportation Center. The authors are solely responsible for the contents of this paper.

Author information

Authors and Affiliations

  1. NEXTRANS Center, Purdue University, 3000 Kent Avenue, West Lafayette, IN, 47906, USA

    Xiaozheng He

  2. School of Civil Engineering, Purdue University, 550 Stadium Mall Drive, West Lafayette, IN, 47907, USA

    Srinivas Peeta

Authors
  1. Xiaozheng He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Srinivas Peeta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Srinivas Peeta.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, X., Peeta, S. Dynamic Resource Allocation Problem for Transportation Network Evacuation. Netw Spat Econ 14, 505–530 (2014). https://doi.org/10.1007/s11067-014-9247-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-014-9247-5

Keywords

Search

Navigation