A capacitated network flow optimization approach for short notice evacuation planning

European Journal of Operational Research

Volumn 223, Issue 1, 2012, Pages 234-245

  Lim, Gino J ^a   Zangeneh, Shabnam ^b   Reza Baharnemati, M ^a   Assavapokee, Tiravat ^c  

^a UNIVERSITY OF HOUSTON   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c Wal Mart Corporation   (United States)

Author keywords

Capacitated network flow problem; Evacuation planning; Shortest path; Time expanded network

Indexed keywords

COMPUTATION TIME; DIJKSTRA'S ALGORITHMS; DYNAMIC NATURE; EVACUATION PLANNING; EXACT ALGORITHMS; GREEDY ALGORITHMS; MAXIMUM FLOWS; NETWORK FLOW PROBLEMS; NETWORK FLOWS; NUMERICAL EXPERIMENTS; OPTIMIZATION PROBLEMS; PLANNING HORIZONS; SHORTEST PATH; SOLUTION PROCESS; STATIC NETWORKS; TEST NETWORK; TIME INTERVAL;

ALGORITHMS;

CONSTRAINED OPTIMIZATION;

EID: 84864424370     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.06.004     Document Type: Article

References (18)

1. R. Ahuja, T. Magnanti, and J. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice Hall
2. T. Cova, and J. Johnson A network flow model for lane-based evacuation routing Transportation Research Part A 37 7 2003 579 604 (Pubitemid 36743282)
3. K. Dow, and S. Cutter Crying wolf: repeat responses to hurricane evacuation orders Coastal Management 26 4 1998 237 252 (Pubitemid 29094514)
4. T.E. Drabek Understanding disaster warning responses The Social Science Journal 36 3 1999 515 523
5. W. Edsger A note on two problems in connexion with graphs Numerische Mathematik 1 1959 269 271
6. L. Ford, and D. Fulkerson Constructing maximal dynamic flows from static flows Operations Research 6 3 1958 433 491
7. L. Ford, and D. Fulkerson Flows in Networks 1962 Princeton University Press
8. H. Hamacher, and S. Tjandra Mathematical modelling of evacuation problems - a state of the art Pedestrian and Evacuation Dynamics 2002 227 266
9. Y. Herer, and M. Tzur The dynamic transshipment problem Naval Research Logistics 48 5 2001 386 408 (Pubitemid 32693933)
10. Hoppe, B.E., 1995. Efficient Dynamic Network Flow Algorithms. PhD Thesis, Cornell University.
11. B.E. Hoppe, and E. Tardos The quickest transshipment problem Mathematics of Operations Research 2000 36 62
12. Q. Lu, B. George, and S. Shekhar Capacity constrained routing algorithms for evacuation planning: a summary of results Lecture Notes in Computer Science 3633 2005 291
13. R. Perry Comprehensive Emergency Management: Evacuating Threatened Populations 1985 Jai Press London
14. H.D. Sherali, T.B. Carter, and A.G. Hobeika A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions Transportation Research Part B: Methodological 25 6 1991 439 452
15. J.M. Smith State-dependent queueing models in emergency evacuation networks Transportation Research Part B: Methodological 25 6 1991 373 389
16. J.H. Sorensen, S.A. Carnes, and G.O. Rogers An approach for deriving emergency planning zones for chemical munitions emergencies Journal of Hazardous Materials 30 3 1992 223 242
17. Southworth, F., 1991. Regional Evacuation Modeling: A State-of-the-art Review. Technical Report, Oak Ridge National Laboratory.
18. Vogt, B., Sorensen, J., 1992. Evacuation Research: A Reassessment. Technical Report, Oak Ridge National Lab., Tennessee, United States.