Determination of the optimal escape routes of underground mine networks in emergency cases

Jalali, Seyed‐Mohammad Esmaeil; Noroozi, Mehdi

doi:10.1016/j.ssci.2009.01.001

Cited by 30 publications

(16 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mathematical model was developed to determine the shortest escape time from a given point to an alternative point and the shortest routes between all two possible points of an underground mine network (Jalali & Noroozi, 2009). The mathematical model was developed using the concept of Floyed-Warshall and algorithms.…”

Section: Human and Organizational Factorsmentioning

confidence: 99%

Methods and models in process safety and risk management: Past, present and future

Khan

Rathnayaka

Ahmed

2015

Process Safety and Environmental Protection

413

118

View full text Add to dashboard Cite

Section: Human and Organizational Factorsmentioning

confidence: 99%

Methods and models in process safety and risk management: Past, present and future

Khan

Rathnayaka

Ahmed

2015

Process Safety and Environmental Protection

413

118

View full text Add to dashboard Cite

“…The problem of calculating the safest escape route has been considered from various points of view (Pu and Zlatanova, 2005;Jalali and Noroozi, 2009;Filippoupolitis, Gorbil et al, 2011). The main similarity between those approaches is the fact that they operate on a graph-based structure.…”

Section: Related Workmentioning

confidence: 99%

Development of a Safest Routing Algorithm for Evacuation Simulation in Case of Fire

Shikhalev

Khabibulin

Wagoum³

2014

Proceedings of the 6th International Conference on Agents and Artificial Intelligence

View full text Add to dashboard Cite

Route choice of pedestrians during an emergency evacuation can be influenced by many factors. In this contribution we elaborate three criteria to consider during an evacuation with a fire hazard. The criteria are combined in an objective function which is minimized during the simulation. The function defines the safeness of a route. In addition an algorithm is presented which evaluates and redirects the pedestrians to the safest path during the simulation. The algorithm shows a positive impact on the evacuation time and overall on the safety during an evacuation simulation. A long term goal of the presented algorithm could be the integration in an evacuation system that gives instructions or recommendations during the evacuation process using dynamic indicators.

show abstract

“…Determining the escape route during the evacuation plays an important role in decreasing casualties in case of water inrush accidents in underground mines . Considering the space limitations in underground tunnels, roadways are submerged along the spreading progress of the mine water inrush.…”

Section: Introductionmentioning

confidence: 99%

A parallel time‐varying earliest arrival path algorithm for evacuation planning of underground mine water inrush accidents

Zhao

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

Evacuation planning is of importance to reduce casualties in underground mine water inrush accidents. Since the transit time depends on the water height along the spreading of the water inrush, finding a path with the minimum egress time through the roadway network is considered as a time-varying shortest path problem. Such problem can be solved by the time-varying earliest arrival path algorithm. However, although the algorithm can solve the problem in polynomial time, more improvements are demanded to meet the real-time requirements of practical applications.In this study, a parallel time-varying earliest arrival path algorithm is proposed in this regard. The vertex-hyperedge network is recommended to represent the adjacency of vertices. Three parallel strategies, including the time-based decomposition, adjacent-vertex-based decomposition, and the adjacent-vertex-based decomposition using vertex-hyperedge network, are proposed for parallelism implementation. The OpenMP interface is employed to evaluate the performance of the proposed strategies on a share-memory multi-core computer. The experiment resultsshow that all three strategies can decrease the run time of the algorithm while maintaining the reasonable accuracy. The best strategy is adjacent-vertex-based decomposition using vertex-hyperedge network, which results in the 2-fold speedup when the number of threads meets the degree of concurrency of the topology structure. KEYWORDS evacuation planning, mine water inrush accidents, parallel earliest arrival path algorithm, vertex-hyperedge network INTRODUCTIONDetermining the escape route during the evacuation plays an important role in decreasing casualties in case of water inrush accidents in underground mines. 1,2 Considering the space limitations in underground tunnels, roadways are submerged along the spreading progress of the mine water inrush. Water inrush to the mining tunnel caused many tragic moments so far. The most catastrophic accident in the history happened when the whole roadways was submerged. In these accidents, when miners simply escape along the shortest or empirical route to the exit, they may face the dead end path and get drown. Researchers applied the computational fluid dynamics in the geometrical method and proposed few water inrush spreading models to simulate the water inrush in the underground tunnel and predict the extend of the water filling in roadways. 3These models can be applied to compute the water height of roadways over time. The traverse time of each roadway can be predicted by empirical functions for the wading speed and water height. Therefore, when the traverse time is considered as the edge weight, roadways of the whole underground mine change from a static network to a time-varying network. It should be indicated that such a roadway network is usually a sparse network, because roadways are exploited along up and down coal seams. Therefore, traverse points are placed into the roadway network Concurrency Computat Pract Exper. 2020;32:e5644. wileyonlinelibrary.com/journ...

show abstract

Determination of the optimal escape routes of underground mine networks in emergency cases

Cited by 30 publications

References 3 publications

Methods and models in process safety and risk management: Past, present and future

Methods and models in process safety and risk management: Past, present and future

Development of a Safest Routing Algorithm for Evacuation Simulation in Case of Fire

A parallel time‐varying earliest arrival path algorithm for evacuation planning of underground mine water inrush accidents

Contact Info

Product

Resources

About