A Building Information Model enabled Multiple Traveling Salesman Problem for building interior patrols |
| |
| Affiliation: | 1. Civil Engineering, National Taiwan University, Taiwan;2. Industrial Engineering and Engineering Management, National Tsing Hua University, Taiwan;1. Department of Civil & Environmental Engineering, National University of Singapore, Block E1A, #07-03, No.1 Engineering Drive 2, Singapore 117576, Singapore;2. Future Cities Laboratory, Singapore-ETH Centre, 1 CREATE Way, CREATE Tower, #06-01, Singapore 138602, Singapore;3. Applied Computing and Mechanics Laboratory (IMAC), School of Architecture, Civil and Environmental Engineering (ENAC), Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland;1. Applied Mechanics and Construction, University of Vigo, Spain;2. Chair of Computational Modelling and Simulation, Technical University of Munich, Germany;1. Faculty of Science, Agriculture, and Engineering, Newcastle University, Singapore 599493, Singapore;2. Xylem Inc, USA;3. Department of Civil, Architectural and Environmental Engineering, University of Texas at Austin, TX 78712, USA;1. Department of Civil Engineering, Ya?ar University, Izmir, Turkey;2. Department of Computer Engineering, Bilkent University, Ankara, Turkey;1. Department of Information Science, Faculty of Sciences, Toho University, 2-2-1 Miyama, 274-8510 Funabashi, Japan;2. Department of Applied Mathematics and Computational Sciences, E.T.S.I. Caminos, Canales y Puertos, University of Cantabria, Avda. de los Castros, s/n, 39005 Santander, Spain;3. School of Civil Engineering, Universidad de Cantabria, Avda. de los Castros 44, E-39005 Santander, Spain;4. Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor SI-2000, Slovenia;5. R&D EgiCAD, School of Civil Engineering, Universidad de Cantabria, Avda. de los Castros 44, 39005 Santander, Spain |
| |
| Abstract: | During building emergencies, an effective and visible primary search plan enhances situation awareness and enables a more efficient rescue mission. The aim of the primary search during an emergency is the rapid screening of every space in the building to identify locations of victims and their conditions. Afterwards, first responders can plan for the rescue of those victims. To provide a timely draw up of interior patrol routes and assign rescue teams to conduct the primary search, this study formulates the problem as a multiple traveling salesman problem (M-TSP) where the comprehensive building interior network is given by the building information models (BIMs), while the total traveling costs (lengths) of every rescue team is minimized. To meet the requirement of real-time patrol routes optimization, we employed the branch-and-price algorithm for the enhancement of computation efficiency. In addition, a heuristic method was introduced to provide timely solutions for large-scale networks. A case study is conducted for a single-floor convention center. We utilized BIM to construct a network of nodes and arcs where the decision model requires as input, and the branch-and-price algorithm finds the optimal patrol. The resulting patrol routes can be visualized and serve as guide for rescue teams to conduct the primary search. The integrated approach proposed in this study is practical and can expedite search and rescue missions. |
| |
| Keywords: | Primary search Disaster management Fire emergency Building Information Modeling (BIM) Multiple Traveling Salesman Problem (M-TSP) Column generation |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
