Abstract

AbstractThe extreme importance of emergency response in complex buildings during natural and human‐induced disasters has been widely acknowledged. In particular, there is a need for efficient algorithms for finding safest evacuation routes, which would take into account the 3‐D structure of buildings, their relevant semantics, and the nature and shape of hazards. In this article, we propose algorithms for safest routes and balanced routes in buildings, where an extreme event with many epicenters is occurring. In a balanced route, a trade‐off between route length and hazard proximity is made. The algorithms are based on a novel approach that integrates a multiattribute decision‐making technique, Dijkstra's classical algorithm and the introduced hazard proximity numbers, hazard propagation coefficient and proximity index for a route.

Highlights

  • Emergency response in the built environment is being widely studied, with a significant surge of interest in this area after 9/11

  • Kwan and Lee (2005) investigated possible improvements of navigable networks for the particular purpose of facilitating quick emergency response to terrorist attacks in the integrated system of the ground transportation system and multi-story office buildings. They concluded that extending the standard 2D Geography Information Science (GIS) (TwoDimensional Geographic Information System) to a realtime 3D GIS has a “considerable potential for improving the speed of emergency response after terrorist attacks on multi-level structures in urban areas”

  • We present an algorithm for finding the safest route in a building, where an extreme event with many epicentres is occurring

Read more

Summary

INTRODUCTION

Emergency response in the built environment is being widely studied, with a significant surge of interest in this area after 9/11. In contrast to the approach for the proper selection of evacuation routes leading trapped occupants to main building exit points, Park et al (2009) focused on computing optimal routes leading search and rescue personal to disaster locations For this purpose, the authors developed a time-dependent optimal routing solution based on a network representing the building configuration, which has been enriched by relevant information about the facility. The problem of the presence of obstacles in evacuation simulations has been studied by Huang and Guo (2008), who proposed the model of a floor field and used a rectangular lattice site for the computation of navigation routes within it One of their main conclusions was that familiarizing the occupants with rooms’ inner configurations and exit door locations plays an important role in reducing the evacuation time. Note that the underlying 3D model is constructed automatically and it includes all the semantics (3D or others) necessary for the aforementioned algorithms

THE BIM-GIS MODEL
TEST BUILDING AND TESSELLATION OF
ALGORITHMS FOR SAFEST AND BALANCED ROUTES
Safest routes
2: Compute the hazard proximity numbers
Balanced routes
TESTING THE ALGORITHMS
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.