光栅图形
四边形的
网格
路径(计算)
扩散
最短路径问题
事件(粒子物理)
网格法乘法
工程类
计算机科学
实时计算
运筹学
模拟
地理
人工智能
结构工程
物理
大地测量学
程序设计语言
量子力学
有限元法
图形
热力学
理论计算机科学
作者
Xiaojuan Li,Weibin Chen,Shih‐Hsiung Chen,Ching‐Ter Chang,Shih‐Hsiung Chen
标识
DOI:10.1016/j.cie.2023.109014
摘要
Evacuation in the event of a fire in an urban underground complexes (UUC) is a big challenge. How to conduct limited evacuation in case of a fire in UUC is a problem worthy of attention. A hexagonal grid was used to balance the timing of each move to the adjacent grid to synchronize fire diffusion and crowd evacuation. This paper proposes an improved ant colony (IACO) algorithm to determine the shortest evacuation path in the case of a fire under an UUC considering real-time fire diffusion. The proposed model was verified under various scenarios. The results show that compared with the traditional quadrilateral raster map, the hexagon raster map can ensure that the moving distance in any direction is equal. The proposed IACO contributes to the body of knowledge resulted in shorter evacuation paths and avoided detours into dangerous areas and “through the wall” errors. These findings could be used to improve fire safety management plans and select evacuation technology, while assisting in the development of intelligent emergency evacuation systems.
科研通智能强力驱动
Strongly Powered by AbleSci AI