Solution of air-space network by dijkstra’s algorithm

Abstract

This paper show us how can we develops a mapping approach to explore the relationship between different layers of a multilayer air transport network composed of airway, route, and flight network. By this paper we can calculate the shortest path in given air space network. In this paper a air space network stations are converted in node and route are converted in the edges and now we get the air space network as a weighted graph.  A two-step methodology is adopted to investigate the hierarchical structure and mapping relationship of the integrated network. First, the relationship between airway and route network is characterized by a multisource multi-sink shortest path method based on a generalized incidence matrix. Second, the relationship between route and flight network is formulated by a two-dimension array. A study of an en route airspace in India air traffic control area in India verifies the feasibility of the proposed two-step methodology. The identification of demand-capacity imbalance is very important in Air Traffic Flow Management in determining the traffic situation in the near future; airspace optimization can be made in advance. When a military exercise or extreme weather occurs, capacity of relevant airways will drop or even be zero, which leads to flight delays on such airways. By mapping the relationship among the three networks, affected flights can be predicted. On this basis, the flight paths and departure times will be optimized in advance. To solve the problem that some flights do not fly the shortest path in reality due to the interruptions of the real-time weather, the research on the mapping between route network and airway network can be extended from static mapping to dynamic mapping.