Abstract
Finding the optimal clearance time and deciding the path and schedule of evacuation for large networks have traditionally been computationally intensive. In this paper, we propose a new method for finding the solution for this dynamic network flow problem with considerably lower computation time. Using a three phase solution method, we provide solutions for required clearance time for complete evacuation, minimum number of evacuation paths required for evacuation in least possible time and the starting schedules on those paths. First, a lower bound on the clearance time is calculated using minimum cost dynamic network flow model on a modified network graph representing the transportation network. Next, a solution pool of feasible paths between all O-D pairs is generated. Using the input from the first two models, a flow assignment model is developed to select the best paths from the pool and assign flow and decide schedule for evacuation with lowest clearance time possible. All the proposed models are mixed integer linear programing models and formulation is done for System Optimum (SO) scenario where the emphasis is on complete network evacuation in minimum possible clearance time without any preset priority. We demonstrate that the model can handle large size networks with low computation time. A numerical example illustrates the applicability and effectiveness of the proposed approach for evacuation.
Similar content being viewed by others
References
Aronson, J. E. (1989). A survey of dynamic network flows. Ann Oper Res, 20(1), 1–66.
Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization.
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.
FEMA (2011). Evacuation plans. http://www.fema.gov/plan/prepare/evacuation.shtm. Online; accessed 19 July 2011.
Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks.
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).
Hoppe, B. (1995). Efficient dynamic network flow algorithms. PhD thesis. Cornell University.
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.
Hoppe, B., & Tardos, E. (2000). The quickest transshipment problem. Math Oper Res, 36–62.
ILOG (2011). User‘s manual for CPLEX. ftp://ftp.software.ibm.com/software/websphere/ilog/docs/optimization/cplex/ps_usrmancplex.pdf. Online; accessed 19 July 2011.
Kisko, T. M., & Francis, R. L. (1985). EVACNET+: a computer program to determine optimal building evacuation plans. Fire Saf J, 9(2), 211–220.
Lim, G., & Baharnemati, M. R. (2011). Hurricane evacuation planning: a network flow optimization approach. In Proceedings of the IIE annual conference, ID: 721.
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).
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.
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).
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.
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.
Southworth, F. (1991). Regional evacuation modeling: a state-of-the art review. Technical report. Oak Ridge National Lab., TN USA.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rungta, M., Lim, G.J. & Baharnemati, M. Optimal egress time calculation and path generation for large evacuation networks. Ann Oper Res 201, 403–421 (2012). https://doi.org/10.1007/s10479-012-1225-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-012-1225-z