Abstract: For the sake of improving the efficiency of emergency rescue organization and operation of transportation network under natural disasters, key nodes in transportation network were identified. PageRank and Warshall were combined to establish a key node identification algorithm for each stage based on random failure of nodes, and greedy strategy was used to predict key nodes in transportation network based on the premise of maximum damage of natural disasters. The critical transportation network in Wenchuan earthquake was taken as an example to validate the proposed algorithm. The results show that the algorithm has a good recognition effect on the accessibility nodes and isolated nodes of the network under the condition of taking into account the uncertainty of natural disasters, and that it can detect the key nodes of the transportation network dynamically in real time and provide a theoretical basis for material transportation and personnel evacuation in the rescue process.

Key words: natural disaster, emergency transport network, failure of random node, Pagerank-Warshall, key node recognition