The safest escape problem

Journal of the Operational Research Society

Volumn 60, Issue 12, 2009, Pages 1749-1758

  Opasanon, S ^a   Miller Hooks, E ^b  

^a THAMMASAT UNIVERSITY   (Thailand)

^b NONE

Author keywords

Building egress; Dynamic network flows; Evacuation; Stochastic; Time varying networks

Indexed keywords

DISTRIBUTION FUNCTIONS; STOCHASTIC SYSTEMS;

DYNAMIC NETWORK FLOW; EMERGENCY EGRESS; ESCAPE PROBLEM; EVACUATION; EVACUATION PLANS; EXACT ALGORITHMS; LARGE BUILDINGS; STOCHASTIC;

TIME VARYING NETWORKS;

EID: 70350330521     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2008.122     Document Type: Article

References (34)

1. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows: Theory, Algorithms and Applications. Prentice-Hall: Englewood Cliffs.
2. Anderson EJ and Nash P (1987). Linear Programming in Infinite- Dimensional Spaces. John Wiley & Sons: New York.
3. Anderson EJ and Philpott AB (1989). A continuous-time network simplex algorithm. Networks 19: 395-425.
4. Anderson EJ, Nash P and Philpott AB (1982). A class of continuous network flow problems. Math Opns Res 7: 501-514.
5. Aronson JE (1989). A survey of dynamic network flows. Ann Opns Res 20: 1-66.
6. Burkard RE, Dlaska RK and Klinz B (1993). The quickest flow problem. ZOR-Meth Model Opns Res 37: 31-58.
7. Cai X, Sha D and Wong CK (2001a). Time-varying minimum cost flow problems. Eur J Opl Res 131: 352-374. (Pubitemid 32271749)
8. Cai X, Sha D and Wong CK (2001b). Time-varying universal maximum flow problems. Math Comput Model 33: 407-430. (Pubitemid 32139465)
9. Carey M and Hendrickson C (1984). Bounds on expected performance of networks with links subject to failure. Networks 14: 439-456.
10. Chalmet L, Francis R and Saunders P (1982). Network models for building evacuation. Mngt Sci 28: 86-105.
11. Ford LR and Fulkerson DR (1962). Flows in Networks. Princeton University Press: Princeton.
12. Frank O and Gaul W (1982). On reliability in stochastic graphs. Networks 12: 119-126.
13. Glockner GD and Nemhauser GL (2000). A dynamic network flow problem with uncertain arc capacities: formulation and problem structure. Opns Res 48: 233-242.
14. Glockner GD, Nemhauser GL and Tovey CA (2001). Dynamic network flow with uncertain arc capacities: decomposition algorithm and computational results. Comput Optim Appl 18: 233-250.
15. Hajek B and Ogier RG (1984). Optimal dynamic routing in communication networks with continuous traffic. Networks 14: 457-487.
16. Halpern J (1979). A generalized dynamic flows problem. Networks 9: 133-167.
17. Hamacher W and Tufekci S (1987). On the use of lexicographic min cost flows in evacuation modeling. Nav Res Logist 34: 487-503.
18. Hoppe B (1995). Efficient dynamic network flow algorithms. Technical Report TR95-1524, Department of Computer Science, Cornell University, Ithaca, NY.
19. Hoppe B and Tardos E (2000). The quickest transshipment problem. Math Opns Res 25: 36-62.
20. Karbowicz C and MacGregor Smith J (1984). A k-shortest paths routing heuristic for stochastic network evacuation models. Eng Optim 7: 253-280.
21. Lin YK (2001). A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput Opns Res 28: 1277-1285.
22. Lin YK (2002). Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab Eng Syst Safety 75: 41-46.
23. Miller-Hooks E and Krauthammer T (2007). An intelligent evacuation, rescue and recovery concept. Fire Technol 43: 107-122.
24. Miller-Hooks E and Sorrel G (2008). The maximal dynamic expected flows problem for emergency evacuation planning, Transportation Research Record (forthcoming).
25. Miller-Hooks E and Stock Patterson S (2004). On solving quickest time problems in time-dependent, dynamic networks. J Math Model Algorithms 3: 39-71.
26. Nagamochi H and Ibaraki T (1991). Maximum flows in probabilistic networks. Networks 21: 645-666.
27. Ogier R (1988). Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacities. Networks 18: 303-318.
28. Orda A and Rom R (1995). On continuous network flows. Opns Res Lett 17: 27-36.
29. Philpott AB (1990). Continuous-time flows in networks. Math Opns Res 15: 640-661.
30. Pullan MC (1993). An algorithm for a class of continuous linear problems. SIAM J Control Optim 31: 1558-1577.
31. Pullan MC (1997). A study of general dynamic network programs with arc time-delays. SIAM J Optim 7: 889-912.
32. Talebi K and MacGregor Smith J (1985). Stochastic network evacuation models. Comput Opns Res 12: 559-577.
33. Yamada T (1996). A network flow approach to a city emergency evacuation planning. Int J Syst Sci 27: 931-936.
34. Ziliaskopoulos AK and Mahmassani HS (1993). Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications. Transport Res Record 1408: 94-100.