Optimal egress time calculation and path generation for large evacuation networks

Annals of Operations Research

Volumn 201, Issue 1, 2012, Pages 403-421

  Rungta, Mukesh ^a   Lim, Gino J ^a   Baharnemati, Mohammad Reza ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

Dynamic network flow problem; Evacuation planning; Minimum cost flows; Short notice evacuation

Indexed keywords

EID: 84870521173     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-012-1225-z     Document Type: Article

References (19)

1. Aronson, J. E. (1989). A survey of dynamic network flows. Ann Oper Res, 20(1), 1-66.
2. Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization.
3. Cova, T. J., & Johnson, J. P. (2003). A network flow model for Lane-based evacuation routing. Transp Res, Part A, Policy Pract, 37, 579-604.
4. FEMA (2011). Evacuation plans. http://www. fema. gov/plan/prepare/evacuation. shtm. Online; accessed 19 July 2011.
5. Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks.
6. Hamacher, H. W., & Tjandra, S. A. (2002). Mathematical modelling of evacuation problems-a state of the art. In Pedestrian and evacuation dynamics (pp. 227-266).
7. Hoppe, B. (1995). Efficient dynamic network flow algorithms. PhD thesis. Cornell University.
8. Hoppe, B., & Tardos, É. (1994). Polynomial time algorithms for some evacuation problems. In Proceedings of the fifth annual ACM-SIAM symposium on discrete algorithms (pp. 433-441). Philadelphia: Society for Industrial and Applied Mathematics.
9. Hoppe, B., & Tardos, E. (2000). The quickest transshipment problem. Math Oper Res, 36-62.
10. ILOG (2011). User's manual for CPLEX. http://ftp. software. ibm. com/software/websphere/ilog/docs/optimization/cplex/ps_usrmancplex. pdf. Online; accessed 19 July 2011.
11. Kisko, T. M., & Francis, R. L. (1985). EVACNET+: a computer program to determine optimal building evacuation plans. Fire Saf J, 9(2), 211-220.
12. Lim, G., & Baharnemati, M. R. (2011). Hurricane evacuation planning: a network flow optimization approach. In Proceedings of the IIE annual conference, ID: 721.
13. Lim, G. J., Zangeneh, S., Baharnemati, M. R., & Assavapokee, T. (2009). A sequential solution approach for short notice evacuation scheduling and routing. In Proceedings of the IIE annual conference (pp. 874-879).
14. Lim, G. J., Zangeneh, S., Baharnemati, M. R., & Assavapokee, T. (2012). Capacitated network flow optimization approach for short notice evacuation planning. Eur J Oper Res, 223(1), 234-245.
15. Lu, Q., George, B., & Shekhar, S. (2005). Capacity constrained routing algorithms for evacuation planning: A summary of results. In Advances in spatial and temporal databases (pp. 291-307).
16. Rungta, M., Baharnemati, M. R., & Lim, G. J. (2011). Results-optimal egress time calculation and path generation for large evacuation networks. Technical report. University of Houston, Systems Optimization and Computing Lab. Technical Report No. SOCL1211-01.
17. Sherali, H. D., & Tuncbilek, C. H. (1992). A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J Glob Optim, 2(1), 101-112.
18. Southworth, F. (1991). Regional evacuation modeling: a state-of-the art review. Technical report. Oak Ridge National Lab., TN USA.
19. Yusoff, M., Ariffin, J., & Mohamed, A. (2008). Optimization approaches for macroscopic emergency evacuation planning: a survey. In International symposium on information technology, 2008, ITSim 2008. (Vol. 3, pp. 1-7). New York: IEEE Press.