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

Escaping is natural in the case of accidents in underground mines. Determining the optimal escape route is one of the most important factors for relief of miners in the emergency cases. This paper aims at developing a mathematical method to determine the shortest escape time from a given point to alternative points of an underground mine network. It also aims to find the shortest routes between each pair of the given points. The first point refers to the place of the accident where some miners may exist, and the alternative points show the safe places that the miners can escape to. After determining the shortest escape time and its corresponding route between each pair of mine work junctions, it is possible to set an electronic board that shows the access route to the nearest safe location by an arrow sign in each mine work. In this paper, Floyd–Warshall and π algorithms are used to determine the shortest escape time between the place of accident and safe places as well as their corresponding routes. Those algorithms are rigorous since they are supported by mathematical proof. Finally, the algorithms are implemented on the network of a certain underground coal mine and the results are presented.