地铁站
紧急疏散
蚁群优化算法
路径(计算)
运输工程
能见度
运动规划
模拟
危害
计算机科学
运筹学
工程类
实时计算
算法
人工智能
地质学
物理
有机化学
化学
程序设计语言
光学
海洋学
机器人
作者
Zhaohui Liu,Ruihong Zou
标识
DOI:10.1016/j.jobe.2024.108828
摘要
Fire in subway stations is the most serious type of accident causing casualties, and traditional static evacuation routes are no longer able to guarantee evacuation safety. To solve this problem, this study proposes an improved ant colony algorithm(IACO), which dynamically adjusts the evacuation paths by combining the simulation results of simulation software (PyroSim), and extends the available safe evacuation time of the personnel in a limited way. First, PyroSim is used to simulate the subway station hall and platform fire scenarios with the temperature, carbon monoxide (CO) concentration, and visibility at each location, obtained from twelve sets of monitors. Improvements of the pheromone concentration and update strategy of the ant colony algorithm(ACO) can improve the accuracy and convergence speed of the algorithm. Optimal path planning is achieved by the IACO, and then evacuation paths are dynamically adjusted by comparing the time at which each monitoring point on the path reaches the human hazard thresholds. Finally, until no adjustments can be made to obtain an evacuation path that extends the available safe evacuation time for personnel in a limited way. Compared to the traditional static evacuation path, this study provides a dynamic evacuation path that takes into account the real-time changes of fires in subway stations. This dynamic evacuation path planning approach will be put into use in subway stations before the accident to provide guidance on fire safety in subway stations and to provide contingency plans for emergency evacuation.
科研通智能强力驱动
Strongly Powered by AbleSci AI