当前位置: X-MOL 学术Adv. Eng. Inform. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Building Information Model enabled Multiple Traveling Salesman Problem for building interior patrols
Advanced Engineering Informatics ( IF 8.8 ) Pub Date : 2021-01-05 , DOI: 10.1016/j.aei.2020.101237
Chun-Hao Chen , Yu-Ching Lee , Albert Y. Chen

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.



中文翻译:

建立了建筑物信息模型,用于建筑物内部巡逻的多重旅行商问题

在发生紧急情况期间,有效且可见的主要搜索计划可增强态势感知能力,并使救援任务更有效率。在紧急情况下进行首要搜索的目的是对建筑物中的每个空间进行快速检查,以识别受害者的位置及其状况。之后,第一响应者可以计划救援这些受害者。为了及时绘制内部巡逻路线并分配救援队进行初步搜索,本研究将该问题表述为多重旅行推销员问题(M-TSP),其中建筑物信息模型给出了综合的建筑物内部网络( BIMs),而每个救援队的总旅行成本(长度)则最小化。为了满足实时巡逻路线优化的要求,为了提高计算效率,我们采用了分支定价算法。此外,引入了一种启发式方法来为大型网络提供及时的解决方案。针对单层会议中心进行了案例研究。我们利用BIM构造了一个由决策模型要求作为输入的节点和弧线网络,而分枝和价格算法找到了最佳巡逻。由此产生的巡逻路线可以可视化,并作为救援队进行初步搜索的指南。本研究中提出的综合方法是实用的,可以加快搜索和救援任务。我们利用BIM构造了一个由决策模型要求作为输入的节点和弧线网络,而分枝和价格算法找到了最佳巡逻。由此产生的巡逻路线可以可视化,并作为救援队进行初步搜索的指南。本研究中提出的综合方法是实用的,可以加快搜索和救援任务。我们利用BIM构造了一个由决策模型要求作为输入的节点和弧线网络,而分枝和价格算法找到了最佳巡逻。由此产生的巡逻路线可以可视化,并作为救援队进行初步搜索的指南。本研究中提出的综合方法是实用的,可以加快搜索和救援任务。

更新日期:2021-01-06
down
wechat
bug