Abstract
During a building disaster, building occupants typically engage in herd behavior, which results in friction, pushing, and even injury and death. Building occupants crowding at exits increases the difficulty of an evacuation. By properly dividing building occupants, the problem of pushing can be diminished. In this study, various software packages were used to construct building models, and evacuation times were simulated under various evacuation conditions. In addition, obstacles were placed in front of exits to explore their effects on building occupant evacuation behavior. Unity and C# were utilized to develop software that could simulate building evacuations, and the simulation results were compared with those generated using EXODUS and Pathfinder. Moreover, the effects of installing obstacles at exits and changing exit widths, obstacle widths, and the number of occupants evacuated from the buildings on evacuation times were explored. The results indicated that by placing an obstacle in front of an exit, the evacuation time was reduced, especially when the width of the obstacle was close to that of the exit. However, when the number of building occupants reached 60 and the exits measured 120 cm wide or less, placing obstacles did not improve congestion much. The study results can be used as a reference by related departments to reduce the number of casualties as a result of crowding at exits as well as well as building occupants panicking and rushing for exits.
Similar content being viewed by others
References
Alvord DM (1983) The escape and rescue model: a simulation model for the emergency evacuation of board and care homes, NBS, NBS-GCR-83-453
Beck VR (1987) A cost effective decision making model for building fire safety and protection. Fire Saf J 12:121–138
Cai KZ, Zheng YL, Lin QY (2016) Technical manual for verifying the fire protection and evacuation safety of buildings. Architecture and Building Research Institute, Ministry of the Interior
Davis PK (1992) Generalizing concepts of verification, validation and accreditation (VV&A) for military simulation. R-4249-ACQ, October 1992, RAND, Santa Monica
Demetrescu C, Italiano GF (2004a) A new approach to dynamic all pairs shortest paths. J ACM 51(6):968–992
Demetrescu C, Italiano GF (2004) Experimental analysis of dynamic all pairs shortest path algorithms. In: Proc. 15th annual ACM-SIAM symposium on discrete algorithms, pp 362–371
Demetrescu C, Italiano GF (2006) Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. J Discret Algorithms 4(3):353–383
Erica D, Richard D (2005) A review of building evacuation models. U.S Government Printing Office, Washington
Fahy R (1991) EXIT89: an evacuation model for high-rise buildings. In: Fire safety science—proc 3rd inter symposium, pp 815–823
Frigioni D, Ioffreda M, Nanni U, Pasqualone G (1997) Experimental analysis of dynamic algorithms for the single source shortest path problem. In: Proc. of the 1st workshop on algorithm engineering (WAE’97), pp 54–63
Fruin J (1971) Pedestrian planning and design [M]. The Metropolitan Association of Urban Designers and Environmental Planners, New York
Gwynne S, Galea ER (1997) A review of methodologies and critical appraisal of computer models used in the simulation of evacuation from the built environment. In: Report of society of fire protection engineers, pp 1–93
Hall JR, Sekizawa A (1991) Fire risk analysis: general conceptual framework for describing models. Fire Technol 22: l, 33–53
Jiang L, Li J, Shen C, Yang S, Han Z (2014) Obstacle optimization for panic flow-reducing the tangential momentum increases the escape speed. PloS One 9(12):e115463
Kendik E (1986) Methods of design for means of egress, towards a quantitative comparison of national code requirements. In: Fire safety science—proc 1st inter symposium, pp 497–511
King V (1999) Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: Proc. of the 40th annual symposium on foundations of computer science, pp 81–99
Kisko TM, Francis RL (1985) EVACNET + : a computer program to determine optimal building evacuation plans. Fire Saf J 9(12):211–220
Levin BM (1989) ExitT—a simulation model for occupant decisions and actions in residential fires. Fire Saf Sci 2:561–570
Misra S, John Oommen B (2005) Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. IEEE Trans Syst Man Cybernet Part B 35(6):1179–1192
Misra S, John Oommen B (2006) An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks. IEEE Trans Comput 55(6):686–702
Nelson HE, MacLennan HA (1988) Emergency movement, SFPE handbook of fire protection engineering [M]. NFPA Quincy MA, USA
Pallottino S, Grazia Scutella M (2003) A new algorithm for reoptimizing shortest paths when the arc costs change. Oper Res Lett 31:149–160
Pauls JL (1980) Effective width model for evacuation flow in buildings [A]. In: Proceedings of workshop on engineering applications of fire technology [C]. National Bureau of Standards, pp 215–232
Pettie S (2004) A new approach to all-pairs shortest paths on real-weighted graphs. Theoret Comput Sci 312(1):47–74
Pidd M (1996) Tools for thinking: modelling in management science. Wiley, Chichester
Poyner B, Robinson D, Hughes N et al (1972) Safety in football stadia: a method of assessment [R]. Scicon Scientific Control Systems Limited, London
Predtechensk VM, Milinsk AI (1978) Planning for foot traffic flow in buildings [M]. Amerind Publishing, New Delhi
Purser DA, Bensilum M (2001) Quantification of behaviour for engineering design standards and escape time calculations[J]. Saf Sci 26:157–182
Ramalingam G, Reps T (1996) An incremental algorithm for a generalization of the shortest-path problem. J Algorithms 21(2):267–305
Stahl F (1982a) BFIRES II: a behavior based computer simulation of emergency egress during fires [J]. Fire Technol 18(1):49–65
Stahl FI (1982b) BFIRES-11 a behaviour based computer simulation of emergency egress during fires. Fire Technol a:49–65
Takahashi K, Tanaka T, Kose S (1988) An evacuation model for use in fire safety design of buildings. In: Fire Safety Science - Proc 2nd Inter Conf, vol 55, pp 1–566
Thorup M (2005) Worst-case update times for fully-dynamic all-pairs shortest paths. In: Proc. of the 37th annual ACM symposium on theory of computing (STOC), pp 112–119
Togawa K (1995) Study of fire escapes basing on the observations of multiple currents [R]. Tokyo: Report No 14, Building Research Institute, Ministry of Construction, Japan
Xiao B, Cao J, Zhuge Q, Shao Z, Sha EH-M (2004) Dynamic shortest path tree update for multiple link state decrements. Proc IEEE Glob Telecommun Conf 2:1163–1167
Zhang QS, Liu M, Zhao GM (2007) A modification of evacuation time computational model and simulation comparison analyses with olympic stadium. Chin J Eng 9(4):64–69
Zheng X, Zhong T, Liu M (2009) Modeling crowd evacuation of a building based on seven methodological approaches. Build Environ 44:437–445. https://doi.org/10.1016/j.buildenv.2008.04.002
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chiu, YP., Shiau, YC. & Lai, YH. Study on related simulations between exit characteristics and evacuation performance. Microsyst Technol 27, 1091–1098 (2021). https://doi.org/10.1007/s00542-018-4063-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00542-018-4063-3