Dijkstra算法
计算流体力学
色散(光学)
算法
有毒气体
计算机科学
模拟
优化算法
编码(集合论)
数学优化
工程类
海洋工程
环境科学
实时计算
数学
环境工程
最短路径问题
物理
图形
集合(抽象数据类型)
航空航天工程
程序设计语言
光学
理论计算机科学
作者
Jiyun Wang,Xiaoyang Yu,Ruowen Zong,Shouxiang Lu
标识
DOI:10.1016/j.jlp.2022.104733
摘要
Evacuation route optimization plays an important role in safe evacuation for toxic leakage accidents. We propose an approach for route optimization under real-time toxic gas dispersion by combining computational fluid dynamics (CFD) code and the Dijkstra algorithm. CFD code is used to simulate the toxic gas dispersion to predict the spatial-temporal distribution of concentrations, which is related to the calculation of the inhaled dose. Taking the dose as the weights of arcs, the concentrations predicted by CFD are embedded into the modified Dijkstra algorithm to calculate the optimal route with minimal total inhaled dose. The results show that the time before evacuation affects the evacuation route optimization, and the death probability exhibits an “S”-shaped growth as time increases. The optimal route may vary with wind direction dominating the direction of toxic gas dispersion because of the change of weights of arcs. Workers wearing protective equipment are allowed to pass through areas with high-concentration toxic gas, and the length of the optimal evacuation route decreases with the level of safety protection. The proposed methodology with appropriate modification is suitable for evacuation route optimization in fires.
科研通智能强力驱动
Strongly Powered by AbleSci AI