Study On Connectivity Of Post-earthquake Transportation System

Transportation system is a widely ranged network system which consists of several traffic components such as bridge, road section, tunnel and so on. With the rapid development of social economy, transportation system becomes an essential condition to human being's life. After an earthquake, the transportation system is not only the earthquake emergency rescue materials transportation channel, but also is the route for earthquake evacuation, and post-earthquake disaster area personnel resettlement, the rescuing group, the engineering troop entering in as well as the rescue and transferring of people in earthquake area. It is a vital earthquake resistance and disaster relief lifeline. Therefore, research on connectivity of post-earthquake transportation system is an important subject which reduces the city earthquake disaster effects, and it is helpful to take the prompt effective earthquake emergency action and the countermeasure, enormously reduces the earthquake disaster. This paper makes systematical study on the transportation system network connectivity, reliability, and the shortest path and mainly include.1. The achievement and research background of transportation network system were reviewed, the method of system reliable analysis, the network system analysis theory were also in retrospect.2. The graph theory and its basic content, the definition, expression and connectivity of the graph, the network foundation of reliability analysis, methods of the reliability analysis are introduced and this provides the elementary basic theory for this thesis.3. A model for connectivity of transportation network analysis was established, and the two connectivity analysis methods are presented. The connectivity analysis program based on the Warshall algorithm was developed and an example was given. Minimal path sets were discussed under the connective condition.4. The method for network connectivity and the reliability based on Monte Carlo was discussed systematically. Basing on the reliability analysis of road section and bridges, the reliability of transportation network in Yanliang area of Xian city has been conducted, and some useful conclusions were obtained.5. The shortest path problem and its classification were discussed, and three kinds of the shortest paths problem's description and their algorithms were introduced, and an improved classic shortest path problem Dijkstra algorithm was presented. This algorithm optimized the network data memory mode, greatly reduced the data reserved. The program was developed, and as an illustration, an example was given.