Research on Shortest Route of Avoid Disaster of Mine Roadway Based on Dijkstra Algorithm
TIAN Ruhui
Abstract：When the mine disaster occurs,it is of great significance to choose the best escape route for the mine roadway. In this paper,the equivalent length of roadway and the escape speed are discussed in depth,the Dijkstra algorithm for fan optimization is given to analyze the flow,and an application example is given.The research results show that K obtained based on Dijkstra algo?rithm,can obtain multiple optimal escape paths by two-way search algorithm for the optimal path. In this paper,two of the optimal escape paths are selected. Reasonable permanent refuge chamber and movable life capsule have been set up in the mine model to ful?ly meet the needs of escape. It is feasible to use VSL programming and Dijkstra algorithm in underground escape simulation system.
Keywords：avoid disaster of roadwayDijkstra algorithmequivalent lengthshortest route
Publication Date：2019-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 36-40 )