Research on the multi-optimal paths of coal mine floods based on the D-K algorithm
Zhao Zuo-pen · Meitan xuebao · 2015
Choosing reasonable escape routes needs to consider the impact of water and other factors of roadway in mine flood. This paper introduces an equivalent length to solve the least time and safest paths for reaching a safe surface. The Dijkstra algorithm can calculate the length of shortest path from the source node to the destination node. K-shortest paths algorithm can find the shortest N paths from the source node to a target node. When a water inrush accident happens in coal mine,people can escape from different paths. However,the top N shortest paths from the source node to a destination node might not be the best escaping path to a safe surface. According to that,this paper proposes a method on choosing the top N shortest paths from the source node to all destination nodes. Using the MATLAB,a simulation was conducted based on the specific examples of mine,and compared with the Dijkstra algorithm and K-shortest paths algorithm.