Research on Optimal Route for Escaping Disaster During Period of Mine Disaster

It is necessary to determine an optimal route for escaping disaster in advance so as to make the undreground trapped personnel to escape to a safe area within a shortest possible time after the occurence of the mine disaster. Based on the traditional Dijkstra algorithm, the bidirectional search arlgorithm by calculating K kind of optimal route was put forward, and by using VB programming language, the specific escape routes at different disaster places in Huasheng Mine were obtained. The results showed that this arlgorithm had higher accuracy and practicability. After the mine is digitized, the real-time and dynamic escape routes can be displayed, this thus provided technical support for the decision maker.