# Mapping a Multilayer Air Transport Network with the Integration of Airway, Route, and Flight Network

Authors: Qinyan Zhou; Wendong Yang; Jinfu Zhu
Journal: Journal of Applied Mathematics
 (2019)

---

## Abstract

This paper develops a mapping approach to explore the relationship between different layers of a multilayer air transport network composed of airway, route, and flight network. 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 multisink 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 case study of an en route airspace in Lanzhou air traffic control area in China verifies the feasibility of the proposed two-step methodology.


---

## Body

## 1. Introduction

Air Transport System (ATS) is composed of airspace and transport system. The former can be modeled by an airway network, and the latter can be modeled by both route and flight network. The interplay between the three single-layer networks makes the research on an integrated network to be interesting. In order to achieve effective operational control of an ATS, it is necessary to develop a multilayer integrated network consisting of all the three single-layer networks and establish a mapping relationship between different layers. This paper provides a method to manage the air transport operation control at the system level to predict and manage the air traffic flow.Although the ATS in China has experienced rapid development [1], the lack of airspace and airport capacity in China causes system-wide flight delays, leading to disruptions to aircraft and crew routes [2]. Due to the interaction between various system elements of ATS, involving a wide range of space and time, flight delays are transmitted on transport network, which may lead to other elements (e.g., passenger travel) deviating from the initial plan. The airspace network determines total transportation capacity, while the route network reflects the scope of transportation market, and the flight network gives the specific transportation scheme. The control and optimization of ATS involves three-layer networks and the study of the mapping relationship between three networks is beneficial to understanding the interior more concisely and effectively and even further to realizing more effective control of it. This paper contributes to the literature by proposing a theoretical framework to map the relationship between the three layers of an integrated multilayer air transport network.This paper is organized as follows. Section2 introduces the structure and definition of airway network layer, route network layer, and flight network layer. Section 3 presents literature review to single network layer and between them. Section 4 uses graph theory and incidence matrix to illustrate the mapping relationship between flight network and route network and between route network and airway network. A case study with real dataset from Lanzhou control area is presented in Section 5. The conclusion and discussion of future research are drawn in Section 6.


## 2. Air Transportation System Framework

The controlled airspace in China is categorized into three/four parts: tower controlled airspace/ airport controlled ground, approach controlled airspace and en route controlled airspace, where the aircraft are, respectively, in the landing/take-off phase, the approach phase, and the cruise phase. The en route controlled airspace is further partitioned into area sectors, and controllers guide the aircraft in their assigned sectors along the specified air route according to its flight plan. Aircraft in en route airspace are all in the cruise phase, which takes up the longest part of most flights. Airway is the flying corridor for aircraft in the airspace that is set with navigation equipment. An aircraft is required to fly based on the predetermined airways that are specified in its flight plan. The airway network is composed of airways and nodes including crossing points, control handover points, and other important points, which is described by spatial geography and geometric parameters. Edges connecting those nodes are airways, which specify flying path for aircraft.Route network refers to a network system that consists of the routes, which shows the spatial distribution of air transportation. A route network consists of the nodes that represent airports and the edges that represent the flight routes which directly link two airports. Route network plays an important role in the operation efficiency and customer service quality of airlines, because it is a prerequisite for airline production plan such as flight plan and crew scheduling. The route network of Lanzhou control area is shown in Figure1.Figure 1
The route network of the Lanzhou control area.Flight network is the time-space network of flight plan, which refers to frequency, time, slot and aircraft type of scheduled flights. Flight plan is the basis and core of all production activities of airlines. Other production plans such as the passenger and cargo sales plan, aircraft maintenance plan, and crew scheduling plan are built on the basis of flight plan and, in turn, provide guarantee for smooth implementation of flight plan.Time-space network contains two-dimensional coordinates of time and space in the flight network. Time is shown as the times of departure and arrival, and space is shown as the airports of departure and arrival. First, the discrete airports are labeled in the abscissa, and the times of departure and arrival are labeled in a vertical axis for each airport as the timeline (continuous), whose direction is from top to bottom. The starting point is the airport opening time, and the ending point is the airport curfew time. The corresponding nodes, which represent the arrival time or departure time of a flight on an airport, are given according to flight schedule. There may be more than one flight on each route. Figure2 shows the time-space network diagram of flight network based on the flight schedule.Figure 2
The time-space network diagram of flight schedule of the Lanzhou control area (portion).There are three kinds of edges on flight network. The first, called flight edge, is from the time node at departure airport to the time node at arrival airport. The second, called parking edge, is from a certain time node that arrives at one airport to the next time node at the same airport. The orientation of this kind of edge is always omitted because the orientation is always pointing down. The third kind of edge, pointing to the first node from the last node at the same airport, is called overnight edge, whose orientation is upward. It indicates the aircraft stays overnight at this airport, which is ready to perform the flight schedule plan for the next day.


## 3. Literature Review

In the past few decades we have witnessed increased interest in developing airway network flow models and tools, which aims to identify and resolve demand-capacity imbalance through the prediction and optimization of air traffic. One of the most well-known models was proposed by Bertsimas and Patterson [3]. They illustrate how the model can be extended to account for airway network flow. In the following paper, they propose an airway network flow model in dynamic weather conditions [4]. More recently, the previous model is further explored by taking into account the dynamic capacity, which is effected by weather conditions, other flights, and equipment status, to facilitate the optimal operations in various scenarios [5, 6]. McCrea et al. [7] developed a novel severe weather-modeling paradigm to be applied within the context of a large-scale airspace planning and collaborative decision-making model in order to reroute flights. Sun et al. [8] analyzed two network layers: the air navigation route network and the airport network. The airports are as nodes of each layer in this paper, and the method can handle various situations including weather condition, reroute, airport, and airway capacity with the mapping relationship.In the optimization design of route network, the research work mainly focuses on the optimization model and optimization algorithm of the existing route network, especially the network design of the hub routes. Li et al. [9] proposed a new model for optimizing the allocation of additional routes in a liberalizing airline market, in which airport capacity constraints are explicitly considered. Xiong and Hansen [10] use a flight delay propagation tree to analyze the potential delay propagation on route network and compare the delay propagation characteristics of two networks, such as point-to-point network and hub-and-spoke network. They predict airline responses to Traffic Management Initiatives and reveal the underlying preference structures that shape these responses. Babic and Kalic [11] deal with the model used to select airline network structures for airlines operating in a competitive environment. Mohri et al. [12] present a new practical airline hub location model with hub capacity decision based on airport capacity envelope functions. Zanin et al. [13] analyze four of the most common ones, specifically related to the assessment of the scale-freeness of networks, the interpretation and comparison of topological metrics, the definition of a node ranking, and the analysis of the resilience against random failures and targeted attacks. Route network research mostly refers to the structure analysis and optimization design under airport capacity, partly about analysis combined with flight, and scarcely with airway.In the aspect of flight network, the research on the recovery of disturbed flight network and the phased recovery method is the current mainstream. Eggenberg et al. [14] try to design an antidelay flight plan by considering the impact of airport congestion and flight delay during making a flight plan. They illustrate the concept by solving the Aircraft Recovery Problem with maintenance planning and give some insights into applying this model to the Passenger Recovery Problem. Clausen et al. [15] provide a thorough review of the current state-of-the-art research within airline disruption management of resources, including aircraft, crew, passenger, and integrated recovery. Pita et al. [16] present a mixed-integer linear optimization model, which is aimed at assisting airlines in making integrated flight scheduling and fleet assignment decisions that take aircraft and passenger delay costs explicitly into account. Zhang et al. [17] proposed a two-stage heuristic algorithm for the integrated recovery problem. Sternberg et al. [18] evaluate and quantify all attributes that may lead to delays according to Brazilian flight data and six research questions related to causes, moments, differences, and relationships between airports and airlines. It shows the main patterns and their chances of occurrence in the entire network of each airport and airline. Lin and Nguyen [19] focus on investigating network reliability in the airline industry and propose an algorithm of evaluating flight network reliability of a multistate flight network considering the time and the number of stopovers. An integration recovery problem in flight network usually is solved from airlines viewpoint, not from region or country. Flight network problem occasionally considers airway or route.At present, the research on ATS only considers a single network or up to two networks about mechanism and improvement measures. The result of improvement is just local optimization rather than global optimization, which not only causes waste of resource, but also leads to conflict with global optimization. Although some studies consider the limitation of airway capacity and flight schedule at the same time and optimize the ground waiting or rerouting from a global perspective, there is not effective connection between airway capacity and flight scheduling so that application range is limited. ATS needs to be focused on solving the problem of airway, route, and flight fundamentally and systematically. We regard airway network, route network, and flight network as an integrated network to study ATS. Airway network is the first layer called physical layer, route network is the second layer called logic layer, and the last layer is flight network that is operation layer. Through the internal links of airway network, route network, and flight network, the spatial and temporal location of flights can be clarified on airway network, which is conducive to make full use of airspace resources, to improve the efficiency of the ATS, and to lay the foundation for the later study of flight delay.


## 4. Mathematical Formulation

### 4.1. The Mapping Relationship between Airway Network and Route Network

On route network, two nodes associated with one edge are source and sink of a certain path on airway network, with the departure airport of a route as the source and the destination airport as the sink. There may be several paths between the two airports of one route, which must have the shortest path between source and sink on airway network. If all airport nodes are marked out on airway network according to route network, the shortest path of all relevant routes can be found on airway network by using multisource multisink shortest path algorithm. A route maps into a path consists of airways, and route network consists of routes maps into airway network. That is to say, the shortest path is available to be expressed as a path by the collection of the airport node -edge - node - edge -…- node - edge - the airport node, on airway network as shown in Figure 3.Figure 3
Relationship between a certain route and airway network.The classical shortest path problem is a single-source single-sink problem. Considering that route network is a multisource multisink network, the mathematical model of the classical shortest path problem is improved into multisource multisink shortest path problem described as follows:(1)minz=∑k=1K∑i∈V∑j∈Vdijxijk(2)s.t.∑j∈adjixijk-∑j:i∈adjjxjik=1,i=O0,otherwise-1,i=D,k=1,2,⋯,K(3)∑k=1Kxijk≤uij;i,j∈V(4)0≤xijk≤uijk;i,j∈V;k=1,2,⋯,KThe problem is formulated in the form of an integer programming problem.O is the source node, which is the departure airport.D is the sink node, which is the arrival airport. The distance dij of the airway (i,j) is defined. The decision variable xijk is equal to unity if the airway (i,j) is on the shortest path of routek and equal to zero otherwise. The objective function in (1) minimizes the distance of airways. Constraints in (2) ensure the flow balance for each node of routek. Constraints in (3) ensure balance between supply and demand; that is, total flow can not exceed capacity of the airway (i,j). Ai×j is a connection matrix of airway network, which consists of three elements with -1,0,1. Bodi×j represents the correlation matrix of the shortest path witho as the source node andd as the sink node, which is composed of xij. Therefore, the mapping relationship between airway network and route network can be expressed as Ai×j↔Bodi×jRouteod.


### 4.2. The Mapping Relationship between Route Network and Flight Network

Each airport node is added the time axis on flight network, and the time of arrival and departure of the flight is marked according to the flight schedule. The set of nodes - parking edge - node - parking edge -…- node in an airport can only be represented a node on route network. Flight network is obtained by adding the parking edge, flight edge, and overnight edge, as shown in Figure 4.Figure 4
Relationship between a certain route and flight network.The matrixCm×n is used to represent the internal direct connectivity of route network. m∈V means departure airport and n∈V means arrival airport. Cm×n consists of two elements 0,1. If airportm and airportn are connected so that a route exists between two airports, the parameter cmn is unity and zero otherwise. Dodp is a two-dimension array that contains the departure time dimension and the arrival time dimension, representing the departure time and arrival time of flightp on OD route. Therefore, the mapping relationship between route network and flight network can be expressed as Cm×n↔Dodpflightsod.


### 4.3. Model Formulation

According to the mapping relationship between flight and route and route and airway summarized above, we derive a mapping relationship of flows between three networks and use 0-1 representation operator to express the existence or not of mapping relationship between networks.(5)αlk=1If  flightlis  on  routek,0otherwise.βijk=1If  airwayi,jis  on  the  shortest  path  of  routek,0otherwise.The total traffic flow of routek for a day is calculated in terms of the number of all flights that are on routek.(6)fk=∑lαlkThe total traffic flow of airway i,j for a day is calculated in terms of the number of all flights on the airway i,j.(7)fi,j=∑kβijkfkfj,i=∑kβjikfkFlightl has four parameters: departure airportm, arrival airportn, departure time tm, and arrival time tn. To calculate the real-time traffic flow of airway network, we have to determine which airway the flight is on at a certain time.(8)χlt=1Iftm≤t≤tn,0otherwise.δijlt=1If  flightlis  on  airwayi,jat  timet,0otherwise.The total traffic flow of routek at timet is calculated in terms of the number of all flights that on the routekat timet.(9)fkt=∑lαlkχltThe total traffic flow of airway i,j at timet is calculated in terms of the number of all flights that are on the airway i,j at timet.(10)fri,jt=∑k∑lβijkfktδijltfrj,it=∑k∑lβjikfktδjiltWhile most 0-1 representation operators are known according to existing information such as flight schedules, correlation matrix of the shortest path, δijlt, needs to be judged by the real-time flight path of the aircraft.According to the predefined set of trajectory segments, we can determine the value ofδijlt based on the relationship between flight time and flight horizontal distance. The algorithm flow chart is as in Figure 5.Figure 5
Algorithm flow chart of validation ofδijlt value.It should be noted that whenδijlt=1, χlt and αlkβijk must also be equal to 1; that is, δijlt≤χlt and δijlt≤αlkβijk are bound to hold.


## 4.1. The Mapping Relationship between Airway Network and Route Network

On route network, two nodes associated with one edge are source and sink of a certain path on airway network, with the departure airport of a route as the source and the destination airport as the sink. There may be several paths between the two airports of one route, which must have the shortest path between source and sink on airway network. If all airport nodes are marked out on airway network according to route network, the shortest path of all relevant routes can be found on airway network by using multisource multisink shortest path algorithm. A route maps into a path consists of airways, and route network consists of routes maps into airway network. That is to say, the shortest path is available to be expressed as a path by the collection of the airport node -edge - node - edge -…- node - edge - the airport node, on airway network as shown in Figure 3.Figure 3
Relationship between a certain route and airway network.The classical shortest path problem is a single-source single-sink problem. Considering that route network is a multisource multisink network, the mathematical model of the classical shortest path problem is improved into multisource multisink shortest path problem described as follows:(1)minz=∑k=1K∑i∈V∑j∈Vdijxijk(2)s.t.∑j∈adjixijk-∑j:i∈adjjxjik=1,i=O0,otherwise-1,i=D,k=1,2,⋯,K(3)∑k=1Kxijk≤uij;i,j∈V(4)0≤xijk≤uijk;i,j∈V;k=1,2,⋯,KThe problem is formulated in the form of an integer programming problem.O is the source node, which is the departure airport.D is the sink node, which is the arrival airport. The distance dij of the airway (i,j) is defined. The decision variable xijk is equal to unity if the airway (i,j) is on the shortest path of routek and equal to zero otherwise. The objective function in (1) minimizes the distance of airways. Constraints in (2) ensure the flow balance for each node of routek. Constraints in (3) ensure balance between supply and demand; that is, total flow can not exceed capacity of the airway (i,j). Ai×j is a connection matrix of airway network, which consists of three elements with -1,0,1. Bodi×j represents the correlation matrix of the shortest path witho as the source node andd as the sink node, which is composed of xij. Therefore, the mapping relationship between airway network and route network can be expressed as Ai×j↔Bodi×jRouteod.


## 4.2. The Mapping Relationship between Route Network and Flight Network

Each airport node is added the time axis on flight network, and the time of arrival and departure of the flight is marked according to the flight schedule. The set of nodes - parking edge - node - parking edge -…- node in an airport can only be represented a node on route network. Flight network is obtained by adding the parking edge, flight edge, and overnight edge, as shown in Figure 4.Figure 4
Relationship between a certain route and flight network.The matrixCm×n is used to represent the internal direct connectivity of route network. m∈V means departure airport and n∈V means arrival airport. Cm×n consists of two elements 0,1. If airportm and airportn are connected so that a route exists between two airports, the parameter cmn is unity and zero otherwise. Dodp is a two-dimension array that contains the departure time dimension and the arrival time dimension, representing the departure time and arrival time of flightp on OD route. Therefore, the mapping relationship between route network and flight network can be expressed as Cm×n↔Dodpflightsod.


## 4.3. Model Formulation

According to the mapping relationship between flight and route and route and airway summarized above, we derive a mapping relationship of flows between three networks and use 0-1 representation operator to express the existence or not of mapping relationship between networks.(5)αlk=1If  flightlis  on  routek,0otherwise.βijk=1If  airwayi,jis  on  the  shortest  path  of  routek,0otherwise.The total traffic flow of routek for a day is calculated in terms of the number of all flights that are on routek.(6)fk=∑lαlkThe total traffic flow of airway i,j for a day is calculated in terms of the number of all flights on the airway i,j.(7)fi,j=∑kβijkfkfj,i=∑kβjikfkFlightl has four parameters: departure airportm, arrival airportn, departure time tm, and arrival time tn. To calculate the real-time traffic flow of airway network, we have to determine which airway the flight is on at a certain time.(8)χlt=1Iftm≤t≤tn,0otherwise.δijlt=1If  flightlis  on  airwayi,jat  timet,0otherwise.The total traffic flow of routek at timet is calculated in terms of the number of all flights that on the routekat timet.(9)fkt=∑lαlkχltThe total traffic flow of airway i,j at timet is calculated in terms of the number of all flights that are on the airway i,j at timet.(10)fri,jt=∑k∑lβijkfktδijltfrj,it=∑k∑lβjikfktδjiltWhile most 0-1 representation operators are known according to existing information such as flight schedules, correlation matrix of the shortest path, δijlt, needs to be judged by the real-time flight path of the aircraft.According to the predefined set of trajectory segments, we can determine the value ofδijlt based on the relationship between flight time and flight horizontal distance. The algorithm flow chart is as in Figure 5.Figure 5
Algorithm flow chart of validation ofδijlt value.It should be noted that whenδijlt=1, χlt and αlkβijk must also be equal to 1; that is, δijlt≤χlt and δijlt≤αlkβijk are bound to hold.


## 5. Case Study

### 5.1. Data Description

Since there are tens of thousands of domestic flights a day, data is numerous and complicated. In order to simplify the data and ensure the validity of the calculation examples at the same time, we first make a statistical analysis on radar data in history. Selecting all flights passing through Lanzhou control area in November 26, 2014 (including all flights that take any airport in Lanzhou control area as take-off or landing airport (385 sorties) and all flights that flying over Lanzhou control area (190 sorties)), the change of flow rate of space section with time dimension of main airway points on Lanzhou control area is obtained.Figure6 is a time distribution line chart of the flow of main airway points on Lanzhou control area obtained from historical radar data. It can be seen from the figure that the traffic peak hours of Lanzhou control area are mainly distributed at 10:00-14:00 and 17:00-21:00. This example relates to predicting the flow distribution at the peak time 12:00; therefore we select all flights with departure time before 12:00 and landing time after 12:00 of all flights passing through Lanzhou control area as the data samples. A total of 93 flights on 53 routes meet the requirements (see Appendix). Among them, 11 flights take off from the airport in Lanzhou control area, 37 flights land at the airport in Lanzhou control area, and 6 flights take off from the airport and land at the airport both in Lanzhou control area. There are also 51 flights flying over Lanzhou control area.Figure 6
Main airway points flow of Lanzhou control area.Considering that although air traffic controllers can be aware of the current flow distribution through real-time radar data, they can only accomplish a real-time adjustment of flight path of subsequent flights and achieve local optimization at best. In this paper, we use an advanced aircraft performance model from Base of Aircraft Data (BADA) developed and maintained by EUROCONTROL, to simulate the 4D trajectory of the aircraft to verify the value ofδijlt, so that flight path can be optimized globally before taking off according to the mapping relationship between three networks.The process of specific aircraft model instance generation aims to identify coefficients of mathematical models with the objective to achieve the best fit between calculated and reference aircraft performance parameters. As a result, the set of aircraft coefficients is identified to describe a specific aircraft type. BADA 3 defines the following flight phases: take-off, initial climb, climb, cruise, descent, approach, and landing. For each phase a typical aerodynamic configuration is assigned in terms of high lift device and landing gear positions.


### 5.2. Numerical Results

On the basis of Section3, the shortest path of 53 routes on airway network is obtained by using the multisource multisink shortest path algorithm. Again according to the mapping relationship between three networks, combined with BADA model to judge the value of δijlt, air traffic flow on airway network can be forecasted. According to historical data, the average taxi time before actual departure is approximately 15 minutes. The actual departure time of all flights is postponed for 15 minutes to recalculate the flight traffic distribution. The location on airway network of each flight at 12 o’clock is shown in Table 1.Table 1
The location of the related flights at 12:00 on Lanzhou control area.
Flight Location on Airway Network Flight Location on Airway Network CSN6998 AKTOB->DNH CHH7377 ELBAD->ZGC CHH7353 AKTOB->DNH CSN6959 ELBAD->ZGC CDG4969 AKTOB->DNH CSN6951 ELBAD->ZGC DER5327 AKTOB->DNH CSN6941 ELBAD->ZGC CSN3693 AKTOB->DNH CCA1296 GOBIN->DKO CQH8845 AKTOB->DNH VEX9841 GRM->P87 CXA8239 AKTOB->DNH CSN3389 JIG->XIXAN CSN3169 AKTOB->DNH CSN6901 JNQ->GOBIN CDG4927 AKTOB->DNH CCA1940 XIXAN->JIG CSN6981 DNH->AKTOB CES2257 XIXAN->JIG CSN6987 OMBON->P143 CXA8253 XIXAN->ZGC CSN6949 OMBON->P143 CES2250 XIXAN->ZGC SER1513 P141->JNQ CES2360 XIXAN->ZGC CDG4919 P152->P151 CSN6797 XIXAN->ZGC CES2324 P312->CHW CSC8553 XIXAN->ZGC CSC8772 P312->P99 CES2357 XIXAN->ZGC CSN6953 YBL->GOBIN CHH7784 XIXAN->ZGC CSN6955 YBL->P92 GCR6420 ZGC->JTA CSC8567 YNC->P152 CSN6925 ZGC->XIXAN CSN6963 YNC->ZLIC CSN6995 ZGC->XIXAN CES2957 YNC->ZLICThe method is feasible because the location of the flight route calculated by BADA is basically correct compared with the real radar data in Figure7. The black line segment indicates that there is no aircraft on the airway at that time. The deeper the online color is, the more the aircraft are on the airway. Although some flights do not fly the shortest path in the actual situation because of actual weather factors, the accuracy of the prediction is up to 87%. To improve the accuracy, the approximate actual taxi time replaces the average taxi time, which makes it hard to collect the datum at present.Figure 7
Flow distribution of the related flights at 12:00 on Lanzhou control area.
(a)
Radar data (b)
Predicted dataThe illustrative example can prove the mapping relationship between flight network, route network, and airway network, which lays a foundation for further research on the relationship between flight delay and airway choice in abnormal state.


## 5.1. Data Description

Since there are tens of thousands of domestic flights a day, data is numerous and complicated. In order to simplify the data and ensure the validity of the calculation examples at the same time, we first make a statistical analysis on radar data in history. Selecting all flights passing through Lanzhou control area in November 26, 2014 (including all flights that take any airport in Lanzhou control area as take-off or landing airport (385 sorties) and all flights that flying over Lanzhou control area (190 sorties)), the change of flow rate of space section with time dimension of main airway points on Lanzhou control area is obtained.Figure6 is a time distribution line chart of the flow of main airway points on Lanzhou control area obtained from historical radar data. It can be seen from the figure that the traffic peak hours of Lanzhou control area are mainly distributed at 10:00-14:00 and 17:00-21:00. This example relates to predicting the flow distribution at the peak time 12:00; therefore we select all flights with departure time before 12:00 and landing time after 12:00 of all flights passing through Lanzhou control area as the data samples. A total of 93 flights on 53 routes meet the requirements (see Appendix). Among them, 11 flights take off from the airport in Lanzhou control area, 37 flights land at the airport in Lanzhou control area, and 6 flights take off from the airport and land at the airport both in Lanzhou control area. There are also 51 flights flying over Lanzhou control area.Figure 6
Main airway points flow of Lanzhou control area.Considering that although air traffic controllers can be aware of the current flow distribution through real-time radar data, they can only accomplish a real-time adjustment of flight path of subsequent flights and achieve local optimization at best. In this paper, we use an advanced aircraft performance model from Base of Aircraft Data (BADA) developed and maintained by EUROCONTROL, to simulate the 4D trajectory of the aircraft to verify the value ofδijlt, so that flight path can be optimized globally before taking off according to the mapping relationship between three networks.The process of specific aircraft model instance generation aims to identify coefficients of mathematical models with the objective to achieve the best fit between calculated and reference aircraft performance parameters. As a result, the set of aircraft coefficients is identified to describe a specific aircraft type. BADA 3 defines the following flight phases: take-off, initial climb, climb, cruise, descent, approach, and landing. For each phase a typical aerodynamic configuration is assigned in terms of high lift device and landing gear positions.


## 5.2. Numerical Results

On the basis of Section3, the shortest path of 53 routes on airway network is obtained by using the multisource multisink shortest path algorithm. Again according to the mapping relationship between three networks, combined with BADA model to judge the value of δijlt, air traffic flow on airway network can be forecasted. According to historical data, the average taxi time before actual departure is approximately 15 minutes. The actual departure time of all flights is postponed for 15 minutes to recalculate the flight traffic distribution. The location on airway network of each flight at 12 o’clock is shown in Table 1.Table 1
The location of the related flights at 12:00 on Lanzhou control area.
Flight Location on Airway Network Flight Location on Airway Network CSN6998 AKTOB->DNH CHH7377 ELBAD->ZGC CHH7353 AKTOB->DNH CSN6959 ELBAD->ZGC CDG4969 AKTOB->DNH CSN6951 ELBAD->ZGC DER5327 AKTOB->DNH CSN6941 ELBAD->ZGC CSN3693 AKTOB->DNH CCA1296 GOBIN->DKO CQH8845 AKTOB->DNH VEX9841 GRM->P87 CXA8239 AKTOB->DNH CSN3389 JIG->XIXAN CSN3169 AKTOB->DNH CSN6901 JNQ->GOBIN CDG4927 AKTOB->DNH CCA1940 XIXAN->JIG CSN6981 DNH->AKTOB CES2257 XIXAN->JIG CSN6987 OMBON->P143 CXA8253 XIXAN->ZGC CSN6949 OMBON->P143 CES2250 XIXAN->ZGC SER1513 P141->JNQ CES2360 XIXAN->ZGC CDG4919 P152->P151 CSN6797 XIXAN->ZGC CES2324 P312->CHW CSC8553 XIXAN->ZGC CSC8772 P312->P99 CES2357 XIXAN->ZGC CSN6953 YBL->GOBIN CHH7784 XIXAN->ZGC CSN6955 YBL->P92 GCR6420 ZGC->JTA CSC8567 YNC->P152 CSN6925 ZGC->XIXAN CSN6963 YNC->ZLIC CSN6995 ZGC->XIXAN CES2957 YNC->ZLICThe method is feasible because the location of the flight route calculated by BADA is basically correct compared with the real radar data in Figure7. The black line segment indicates that there is no aircraft on the airway at that time. The deeper the online color is, the more the aircraft are on the airway. Although some flights do not fly the shortest path in the actual situation because of actual weather factors, the accuracy of the prediction is up to 87%. To improve the accuracy, the approximate actual taxi time replaces the average taxi time, which makes it hard to collect the datum at present.Figure 7
Flow distribution of the related flights at 12:00 on Lanzhou control area.
(a)
Radar data (b)
Predicted dataThe illustrative example can prove the mapping relationship between flight network, route network, and airway network, which lays a foundation for further research on the relationship between flight delay and airway choice in abnormal state.


## 6. Conclusion and Future Research

In this paper, we propose a mapping approach to characterize the relationship of different layers in a multilayer air transport network consisting of airway, route, and flight network. We use a multisource multisink shortest path method based on a generalized incidence matrix to illustrate the mapping relationship between airway network and route network, while the time-space network problem with two-dimension array between route network and flight network. The routes that share the same airway and flights determine traffic flow of airways. The number of incoming and outgoing flights in an airport on flight network determines incoming and outgoing flow of each node on route network. The density distribution of traffic flow of each airway on airway network can be obtained by the prediction in advance. In practice, controllers adjust the whole subsequent flight according to the current flow distribution through real-time radar data to achieve local optimization. However, the mapping relationship among three networks proposed in this paper can optimize flight paths selection, and local real-time optimization can be carried out in case of emergency. The actual time data of historical flights forecast the traffic flow on airway network on Lanzhou control area and verify the feasibility of the method with the real-time radar data.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.



---

*Source: 8282954-2019-05-20.xml*