The building evacuation problem with shared information

Naval Research Logistics

Volumn 55, Issue 4, 2008, Pages 363-376

  Chen, Lichun ^a   Miller Hooks, Elise ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Benders decomposition; Dynamic networks; Evacuation; Reoptimization; Shared information; Time varying; Unsplittable flows

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; SET THEORY;

DYNAMIC NETWORKS; ONLINE INSTRUCTIONS;

INFORMATION RETRIEVAL;

EID: 43949087564     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20288     Document Type: Article

References (31)

1. 1 N. Baumann, and M. Skutella, Solving evacuation problems efficiently–earliest arrival flows with multiple sources, Proc 47th IEEE Symp Foundations of Comput Sci 2006, pp. 399–410.
2. 2 J. F. Benders, Partitioning procedures for sloving mixed‐variables programming problems, Numer Math 4 (1962), 238–252.
3. 3 A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar, Approximation algorithms for the unsplittable flow problem, Lecture Notes Comput Sci 2462 (2002), 51–66.
4. 4 L. G. Chalmet, R. L. Francis, and P. B. Saunders, Network models for building evacuation, Management Sci 28 (1982), 86–105.
5. 5 J. F. Cordeau, F. Soumis, and J. Desrosiers, A Benders decomposition approach for the locomotive and car assignment problem, Transport Sci 34 (2000), 133–149.
6. 6 A. M. Costa, A survey on benders decomposition applied to fixed‐charge network design problems, Comput Oper Res 32 (2005), 1429–1450.
7. 7 P. J. DiNenno, R. L. P. Custer, W. Walton, and J. M. Watts, The SFPE handbook of fire protection engineering, 1st ed., The National Fire Protection Association, 1988.
8. 8 Y. Dinitz, N. Garg, and M. X. Goemans, On the single‐source unsplittable flow problem, Combinatorica 19 (1999), 17–41.
9. 9 B. Fleischmann, M. Gietz, and S. Gnutzmann, Time‐varying travel times in vehicle routing, Transport Sci 38 (2004), 160–173.
10. 10 M. R. Garey, and D. S. Johnson, Computers and intractability: A guide to the theory of NP‐Completeness, W. H. Freeman, San Francisco, CA, 1979.
11. 11 H. W. Hamacher, and S. A. Tjandra, “Mathematical modelling of evacuation problems: A state of art,” Pedestrian evacuation dynamics (2002), Springer, Berlin Heidelberg, 227–266.
12. 12 D. Helbing, I. Farkas, and T. Vicsek, Simulating dynamical features of escape panic, Nature 407 (2000), 487–490.
13. 13 ILOG CPLEX Callable Library 9.1 reference manual (April 2005).
14. 14 J. Jarvis, and H. Ratliff, Some equivalent objectives for dynamic network flow problems, Management Sci 28 (1982), 106–109.
15. 15 N. R. Johnson, Collective behavior as group‐induced shift, Sociol Inquiry 44 (1974), 105–110.
16. 16 N. Kamiyama, N. Katoh, and A. Takizawa, An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity, IEICE Trans Inform Syst E89‐D (2006), 2372–2379.
17. 17 M. Köhler, and E. Skutella, Flows over time with load‐dependent transit times, SIAM J Opt 15 (2005), 1185–1202.
18. 18 S. G. Kolliopoulos, and C. Stein, Approximating disjoint‐path problems using packing integer programs, Math Program Ser A 99 (2004), 63–87.
19. 19 Y. K. Lin, A simple algorithm for reliability evaluation of a stochastic‐flow network with node failure, Comput Oper Res 28 (2001), 1277–1285.
20. 20 G. G. Lovas, Models of wayfinding in emergency evacuation, Eur J Oper Res 105 (1998), 371–389.
21. 21 Q. Lu, Y. Huang, and S. Shekhar, Evacuation planning: A capacity constrained routing approach, Comput Sci 2665 (2003), 111–125.
22. 22 T. L. Magnanti, and R. T. Wong, Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria, Oper Res 29 (1981), 464–484.
23. 23 Mamada, S., Makino, K., Takabatake, T., and Fujishige, S., The evacuation problem, dynamic network flows, and algorithms, SICE Annual Conference in Fukui, 2003, pp. 2807–2811
24. 24 E. Miller‐Hooks, and T. Krauthammer, An intelligent evacuation rescue and recovery concept, Fire Technol 43 (2007), 107–122.
25. 25 E. Miller‐Hooks, and S. Stock Patterson, On solving quickest time problems in time‐dependent, dynamic networks, J Math Model Algorithms 3 (2004), 39–71.
26. 26 National Fire Protection Association, Inc., 1 Battery‐march Park (2001).
27. 27 S. Opasanon, and E. Miller‐Hooks, The safest escape problem, in press, J Oper Res Soc ( 2007).
28. 28 J. D. Sime, The outcome of escape behavior in the Summerland fire: Panic or affiliation? (1985).
29. 29 S. A. Tjandra, Dynamic network optimization with application to the evacuation problem, Fachbereich Mathematik der Universität Kaiserslautern, 2003.
30. 30 D. Wenger, B. Aguirre, and G. Vigo, Evacuation behavior among tenants of the World Trade Center following the bombing of February 26 (1994).
31. 31 D. Wenger, and G. Vigo, A test of emergent norm theory of collective behavior, Sociol Forum 13 (1998), 301–320.