Abstract
Evacuation planning of a building in case of an emergency has been widely discussed in literature. Most of the existing approaches consider a building as a static graph with fixed, predefined exits. However, in severe disaster situations, it is desirable to create additional exits for evacuation purposes. A simple and practical way of creating additional exits is to place ladders at those locations that can reduce evacuation time effectively. For large buildings, finding optimal locations for a limited number of available ladders to utilize them effectively is not possible without using any systematic approach.
In this paper, we first show that the problem of finding optimal locations for a given number of ladders among all feasible locations to minimize either the average evacuation time or evacuation egress time is NP-hard. The feasible locations for ladders are referred as dynamic exit points and the exits created by ladders are referred as “dynamic exits”. Next, we propose a heuristic for placing a given number of ladders at dynamic exit points based on the distribution of evacuees in the building. We extend the existing capacity constrained route planner (CCRP) algorithm for dynamic exit based evacuation planning.
Our model is illustrated by performing a set of experiments and comparing it with existing optimization models that minimize either the average evacuation time or the evacuation egress time. The results show that the proposed heuristic produces close to the optimal solution and has significantly less computational cost as compared to the optimization models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bhushan, A., Sarda, N.L.: Building evacuation planning using dynamic exits. Fire Safety Journal (under review)
Chalmet, L., Francis, R., Saunders, P.: Network models for building evacuation. Management Science 28(1), 86–105 (1982)
Choi, W., Hamacher, H., Tufekci, S.: Modelling of building evacuation problems with side constraints. European Journal of Operational Research 35(1), 98–110 (1988)
Garg, P.: Modeling of evacuation planning using dynamic exits, M.Tech Thesis, Department of Computer Science and Engineering, Indian Institute of Technology Bombay, India (2011)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Gupta, A., Yadav, P.: SAFE-R a new model to study the evacuation profile of a building. Fire Safety Journal 39(7), 539–556 (2004)
Hamacher, H., Tjandra, S.: Mathematical modelling of evacuation problems - a state of the art. In: Pedestrian and Evacuation Dynamics, pp. 227–226. Springer (2002)
Jarvis, J.J., Ratliff, H.D.: Some equivalent objectives for dynamic network flow problems. Management Science 28(1), 106–109 (1982)
Kim, S., George, B., Shekhar, S.: Evacuation route planning: Scalable heuristics. In: Proceedings of the 15th Annual ACM International Symposium on Advances in Geographic Information Systems, p. 20. ACM (2007)
Kisko, T., Francis, R.: Evacnet+: a computer program to determine optimal building evacuation plans. Fire Safety Journal 9(2), 211–220 (1985)
Lu, Q., George, B., Shekhar, S.: Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 291–307. Springer, Heidelberg (2005)
Lu, Q., Huang, Y., Shekhar, S.: Evacuation Planning: A Capacity Constrained Routing Approach. In: Chen, H., Miranda, R., Zeng, D.D., Demchak, C.C., Schroeder, J., Madhusudan, T. (eds.) ISI 2003. LNCS, vol. 2665, pp. 111–125. Springer, Heidelberg (2003)
Tjandra, S.: Dynamic network optimization with application to the evacuation problem. PhD thesis, Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany (2003)
Zeng, M., Wang, C.: Evacuation Route Planning Algorithm: Longer Route Preferential. In: Yu, W., He, H., Zhang, N. (eds.) ISNN 2009. LNCS, vol. 5551, pp. 1062–1071. Springer, Heidelberg (2009)
Zhou, X., George, B., Kim, S., Wolff, J., Lu, Q., Shekhar, S.: Evacuation planning: A spatial network database approach. IEEE Data Engineering Bulletin (Special Issue on Spatio-temporal databases) 33(2), 26–31 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhushan, A., Sarda, N.L., Reddy, P.V.R. (2012). Evacuation Planning of Large Buildings Using Ladders. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32600-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-32600-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32599-1
Online ISBN: 978-3-642-32600-4
eBook Packages: Computer ScienceComputer Science (R0)