The optimal path algorithm for emergency rescue for drilling accidents

Addressing flaws in the traditional Dijkstra Algorithm, this paper proposes an improved optimal path algorithm applicable to the GIS drilling accident emergency rescue system. To begin, the paper uses the modified comprehensive analytic hierarchy process to analyze various factors of road conditions, considers the element of urgency, then sets up the digraph with weights of the running time of the traffic network. On this basis, we use the improved Dijkstra algorithm based on quad-heap and inverse adjacency list to the optimal path search. Finally, application to real traffic networks substantiates the effectiveness of our developed method.