Research Article  Open Access
Yu Jiang, Xinxing Xu, Honghai Zhang, Yuxiao Luo, "Taxiing Route Scheduling between Taxiway and Runway in Hub Airport", Mathematical Problems in Engineering, vol. 2015, Article ID 925139, 14 pages, 2015. https://doi.org/10.1155/2015/925139
Taxiing Route Scheduling between Taxiway and Runway in Hub Airport
Abstract
To guarantee the operation safety of airport, improve the efficiency of surface operation, and enhance the fairness of taxiing route scheduling, an optimizing model is established for the airport surface taxiing route scheduling. Reducing the total aircraft taxiing route length and reducing the waiting delay time are the goals of the model by controlling the initial taxiing time of aircraft and choosing the right taxiing route. The model can guarantee the continuous taxiing for all aircraft without conflicts. The runway scheduling is taken into consideration in the model to optimize the surface operation. The improved genetic algorithm is designed for simulation and validation. The simulation results show that compared with the ant colony optimization method, the improved genetic algorithm reduces the total extra taxiing distance by 47.8% and the total waiting delay time decreases by 21.5%. The optimization model and improved genetic algorithm are feasible. The optimization of taxiing route method can provide decision support for hub airports.
1. Introduction
With the rapid development of air transport and the sharp increase in the number of aircraft, airports have increasingly become a “bottleneck” of the air transportation network. This phenomenon leads to low operation efficiency of resources in the airport increasing aircraft delays and air pollution and other problems [1]. At present, there are two main ways to solve the airport “bottleneck” problem at home and abroad: one is to increase the infrastructure construction of airport surface resources and the other is to improve the operation efficiency of airport surface resources. However, the airport infrastructure construction in China is still far behind the rapid development aboard. Therefore, how to improve the operation efficiency of airport surface resources becomes the main method to resolve the airport “bottleneck” problem.
The operation of airport surface resources includes runway scheduling for landings and takeoffs, gate assignment, and taxiway routing. Connecting runways and gates, taxiways are the key resource of the airport taxiing process [2]. Thus how to improve the operation efficiency of the taxiway is the key to improve the operation efficiency of airport surface resources.
Many scholars have studied aircraft surface taxiing and scheduling and achieved some good achievements. These achievements can be mainly divided into two aspects: one is the preset route of aircraft taxiing and the other is dynamic selection route of aircraft taxiing. Among the preset route of aircraft taxiing researches, Smeltink and Soomer [3] presented the first approach to solve the surface movement problem using the MILP formulation, but the research did not consider the taxiing interval and taxiing time constraints, so there was a certain security risk. Based on the research of Smeltink and Soomer, Rathinam et al. [4] added a taxiing interval constraint to the model, but each aircraft still moved with a predetermined route. Gotteland et al. [5] presented a taxiing model based on the characteristics of aircraft taxiing conflicts and used genetic algorithms to simulate the model, but the research did not consider the waiting problem of aircraft caused by the potential taxiing conflicts. Landry et al. [6] used the theory of complex network, dynamically detected and resolved the conflicts on taxiways and runways, improved the operation efficiency of the surface resources, and ensured the safety of the aircraft taxiing, but the simulation of model was relatively complicated, which could not meet the requirement of realtime scheduling of the taxiing. Anderson et al. [7] proposed two simple queuing models to indicate the taxiingin and taxiingout processes of aircraft. The model could be applied for not only predicting the surface congestion, but also evaluating the control strategy which could improve the operation efficiency of airport. But the model had little consideration on the interrelation between landings and takeoffs. Pitfield et al. [8] used the Monte Carlo simulation to study the potential taxiing conflicts on congested taxiways, but taxiing optimization had not been performed in the simulation. The study resolved the taxiing conflicts by controlling aircraft to wait in certain nodes. Therefore, the study always belonged to the predetermined route research.
The predetermined taxiing route of aircraft is likely to lead to taxiing delays and increase the operation cost. Therefore, some scholars have carried out some studies on dynamic taxiing route of aircraft. Keith et al. [9] formulated a MILP model combining the runway scheduling with taxiway routing in a continuous time environment. The simulation results were significantly better than the results obtained from the runway scheduling and taxiway route routing problem separately. But the simulation data used was relatively simple, and it could not operate in real simulation environment. Balakrishnan and Yoon [10] presented the aircraft dynamic taxiing model. The results could reduce the total taxiing time by controlling the taxiingout time and taxiing path rerouting. But each aircraft could only be allocated one of the limited routes in the set. Roling and Visser [11] presented an alternative MILP model for ground movement on a spacebased network, in which optional routes were assigned for each aircraft in advance. This research only ensured that there were no conflicts in the planning period. Anderson and Milutinović [12] considered aircraft taxiing traffic flows on the taxiway by adjusting the speed of taxiing aircraft on each taxiway segment. Meanwhile the model was employed to consider the flows of aircraft instead of node occupation on the time dimension. The model also effectively incorporated the aircraft taxiing uncertainty into it. You and Han [13] introduced multiple agent technology to model the taxiing route of aircraft. The research considered the contract net protocol theory in the model and selected Dijkstra algorithm to optimize the taxiing route. A multiple agent route optimization algorithm was adopted and the simulation analysis was made. But the research did not take the dynamic nature of aircraft taxiing into account. Wang et al. [14] presented a dynamic taxiing route allocation algorithm to avoid taxiing conflicts, but the uncertainty of the aircraft taxiing speed was not taken into account. Marín et al. [15, 16] abstracted the taxiway into multiple commodity flow problem. The model took the aircraft routing and the queue scheduling problem into account. It belonged to dynamic route assignment scope. However, the presented algorithm could not handle separation constraints in an accurate way. In the dynamic route assignment, scholars have presented dynamic assignment models from different viewpoints, but the accuracy and operation speed of algorithm need to be improved. Carr et al. [17] and Idris et al. [18] considered the interaction influences of arrival and departure taxiing process and presented a route assignment model for dynamic taxiing. But the algorithm used in the solution reduced the speed and accuracy of the model. Baik et al. [19] used graph theory and designed a timedependent network assignment strategy to optimize the aircraft dynamic taxiing routes. To obtain the satisfactory acceptable solution, García et al. [20] and Gotteland and Durand [21] introduced the heuristic algorithm to improve the operation efficiency of airport surface resources and achieved good achievements.
In summary, both in the preset and nonset taxiing routes, most researches formulated a single goal model for aircraft taxiing, without consideration of synergistic operations of other surface resources. Meanwhile, most of the researches only considered unilateral interests of airports, airlines, or air traffic controllers separately, without considering their whole interests comprehensively. In the aircraft taxiing, the occupancy and operation mode of runway have a great influence on the aircraft taxiing route. How to model and simulate the synergistic scheduling of runway and taxiways operation under the premise of considering the interests of all parties is an urgent problem in the airport surface resource scheduling.
The needs of air traffic controllers, airlines, and airports are considered in the paper. A synergistic scheduling strategy based on safety, efficiency, and fairness is presented in the airport surface movement. A synergistic scheduling model is established on runway and taxiway scheduling and an improved genetic algorithm is used to simulate the verification of model. It can provide theoretical guidance for resource synergistic scheduling for managers in hub airports.
The remainder of this paper is structured as follows. Section 2 provides a brief description of the aircraft taxiing scheduling problem and the aspects this paper mainly considered. Section 3 gives the optimizing model of the airport synergistic scheduling problem. In Section 4, the improved genetic algorithm method is introduced first. The simulation data from the airport is then presented. Following this, the results are then shown together with the discussion. Section 5 contains the conclusions.
2. Problem Description
Aircraft taxiing scheduling is a complex route scheduling problem including landing and takeoff taxiing scheduling. Landing taxiing scheduling means assigning appropriate landing time for landings, selecting the appropriate runway exit to taxiway, and then selecting the appropriate taxiing route to reach the assigned gate. Takeoff taxiing scheduling means assigning appropriate pushout time and selecting appropriate taxiing route so that the aircraft can begin to taxi from the gate to the right runway threshold. Therefore, both the operations of landing and takeoff are successive. Airport taxiing scheduling for aircraft on airport surface is to determine aircraft approach time, departure time, and taxiing route for each aircraft under the premise of ensuring safety. Therefore, the total taxiing distance (time) of both landings and takeoffs is made to be the shortest and the total delays to be the least.
In the airport surface taxiing scheduling, the different stakeholders have different requirements. The air traffic control authorities require ensuring the safety of the movement of aircraft on the airport surface. Airlines need to ensure that flights can take off and land on time to reduce delay and taxiing cost. Airport authorities want to improve the utilization efficiency of airport resources. Therefore, the airport surface scheduling, not only security but also efficiency and fairness of scheduling, should be taken into account. The socalled synergistic scheduling is to consider three aspects of comprehensive requirements, as well as the synergistic scheduling of taxiway and runway.
3. Model
3.1. Assumptions
(1) Aircraft’s speed is constant during taxiing and the taxiing route will be continuous without any stop until to the destination.
(2) All aircraft have the same taxiing route unit cost and waiting delay cost.
(3) Gate zone has sufficient gates to meet all the demand of landing and takeoff aircraft in planned period of time.
(4) Takeoff aircraft starts taxiing from the gate zone and ends in the runway threshold; landing aircraft start taxiing from the runway exit and end in the gate zone. Each aircraft has a fixed gate and exit on the runway.
3.2. Define Variables
:set of all aircraft within planned period, ;:set of all takeoffs within planned period;:set of all landings within planned period;:set of airlines, ;:set of airport surface nodes, any node ;:set of runway entrance and exit nodes, ;:the distance between nodes and (unit: km);:the maximum taxiing speed of aircraft , and any speed ;= 1, if there is a directly connected and usable route from node to node ; 0, otherwise;:the time of aircraft arrives at the node ;:the reference scheduling time, namely, the earliest time that aircraft could come into the taxiway system;= 1, if aircraft taxies from node to node ; 0, otherwise;= 1, if aircraft reaches node before aircraft ; 0, otherwise;:the taxiing route of aircraft , consisting of a series of nodes ;:the safe taxiing time interval between aircraft and aircraft ;:the wake turbulence separation between aircraft and aircraft ;:the time of aircraft occupying runway;= 1, if aircraft uses the runway before aircraft ; 0, otherwise; :the estimated starting taxiing time of landing aircraft after landing;:the estimated pushout time of takeoff aircraft ;:the estimated takeoff time of takeoff aircraft ;:the starting taxiing time of aircraft ;:the true taxiing route length of aircraft ;:the shortest taxiing route length of aircraft from the beginning to end;:the total extra taxiing route length of airline ;:the proportion that the number of airlines accounts for the total airlines;:the proportion that the number of flights of airline accounts for the total airlines accumulatively;:the total waiting delay time of airline ;:the Gini coefficient of taxiing route;:the Gini coefficient of waiting delay;:the parameter value of Gini coefficient ;:the parameter value of Gini coefficient .
3.3. Objective Functions
In hub airports, the taxiing route length of aircraft and waiting delay are the main factors affecting the efficiency of surface movement. Thus the objective functions of the paper are presented in two aspects: the taxiing route cost and the waiting delay time. Shortening taxiing route length and reducing waiting delay time of all aircraft in the planned period are the main goals in the aircraft scheduling.
As the speed of aircraft is constant during taxiing, the taxiing time and taxiing route length of aircraft are equivalent. In the paper, the taxiing time of aircraft refers to the difference between the start time and the end time of taxiing. The goal is to minimize the total taxiing time of all aircraft in planned period:For landing, the waiting time before entering into the taxiway system is due to the busy use of surface resources, which can postpone the landing aircraft. The same reason can postpone the pushout time of the takeoff aircraft from the gate zone. During the synergistic scheduling of taxiway and runway, with the premise of no aircraft affecting the taxiing safety, all aircraft should enter the taxiing system as soon as possible, which can make the total waiting delay time of all aircraft shortest:
3.4. Constraints
(1) Taxiing Route Constraints. If the runway exit, runway entrance, and gate of aircraft are known, the aircraft taxiing route constraints are to generate a feasible route from the starting point to the end for each aircraft:Formula (3) ensures that each link of the taxiing route of any aircraft needs to meet the capacity and the physical connectivity of taxiway in the airport:Formula (4) ensures that each aircraft is assigned a feasible taxiing route from the starting point to the end point and that all the surface nodes have a liquidity balance. That is to say, if an aircraft reaches a node of the airport surface, it must begin to taxi from this node to the other one:Formula (5) ensures that the taxiing route of aircraft is always continuous. It does not allow any aircraft to stop to wait during the course of taxiing. When the aircraft is taxiing from node to the next node , formula (5) is to be :Formula (6) restricts the taxiing speed of all aircraft. The speed of each aircraft must be less than the maximal speed.
Formula (3)–(6) ensure that any aircraft must have an effective taxiing route from its gate to its runway entrance or from its runway exit to its gate and have a continuous taxiing route. However, the route generated here is random, not necessarily the optimal route. What is more, it may conflict with other aircraft during taxiing.
(2) Taxiing Security Constraints. Aircraft taxiing on the airport surface usually produces three types of taxiing conflicts: the node conflict, rearend conflict, and headon conflict.
Node Conflict. The interval time, at which the two aircraft go through the same node, does not meet the minimum safety requirements.
RearEnd Conflict. When two aircraft taxi in the same direction on a taxiway, the faster trailing aircraft may overtake the leading aircraft.
HeadOn Conflict. When two aircraft taxi in the opposite direction on a taxiway, they have an encounter with each other.
The taxiing safety constraints of aircraft are to ensure the safety of aircraft taxiing and avoid taxiing conflicts above:Formula (7) ensures the safety interval of two taxiing aircraft. When two aircraft go through the same node, there must be a safety time interval between them. Safety time interval is related to aircraft type, wake turbulence separation, taxiing speed, and so on:Formula (8) can avoid rearend conflicts during the taxiing of airport. The scene that one aircraft overtakes another must not occur during the taxiing:Formula (9) can avoid headon conflicts during aircraft taxiing. An aircraft must not have an encounter with other aircraft in a certain taxiway during taxiing.
(3) Runway Operation Constraints. The runway operation strategy has an important influence on the airport surface taxiing. The successive relationship between two aircraft using the same runway can be divided into four kinds: takeofftakeoff, takeofflanding, landingtakeoff, and landinglanding: Formula (10) ensures that in the case of takeofftakeoff, two consecutive takeoff aircraft must meet wake turbulence separation standards between them:Formula (11) ensures that in the takeofflanding process, two aircraft must meet the takeoff wake turbulence separation standards. The takeoff aircraft must leave the runway before the trailing lands on the runway. The starting taxiing time of landing aircraft equals the time difference of reaching the runway and runway occupancy time. If the starting taxiing time is , the time of landing on the runway is . According to the wake turbulence separation standards, formula (11) is got above:Formula (12) ensures that, in the case of landingtakeoff, the takeoff aircraft can enter the runway until the heading landing aircraft leaves the runway. The time of entrance to the runway for takeoff aircraft at least equals the time the landing aircraft exiting the runway:Formula (13) assures that, in the case of landinglanding, the two aircraft must meet the wake turbulence safety interval standards. The trailing aircraft cannot land on runway until the heading aircraft taxis off the runway.
(4) Taxiing Time Constraints. The taxiing time constraints are used to ensure that the taxiing scheduling of aircraft should be in accordance with the requirements of flight schedule: Formula (14) ensures that the landing aircraft should begin to taxi after the estimated starting taxiing time:Formula (15) ensures that a takeoff aircraft must start taxiing after its pushout time. Formula (16) requires aircraft to complete the taxiing and reach the runway entrance before the estimated takeoff time.
(5) Fairness Constraints. During the course of scheduling of aircraft, sometimes the route length of one airline’s aircraft is always much longer than other airlines, or the total delay is much larger than other airlines. Therefore, the fairness for various airlines needs to be taken into account during the taxiing route scheduling of aircraft. The Gini coefficient in the economics is introduced to restrain the fairness of taxiing scheduling and we use it to quantify the taxiing route fairness and delay fairness. The Gini coefficient can reflect the degree of unfairness for resources distribution. The smaller the value is, the more average the distribution is.
As the runway and the gate of an aircraft are known, the shortest path of each aircraft is different. If we want to weigh the fairness of the taxiing route, simply comparing the taxiing route length of each aircraft cannot meet the actual requirements and is not enough as well. Therefore we introduce the concept of extra taxiing distance.
Definition 1 (extra taxiing distance). When the runway and the gate of an aircraft are known, we can get a shortest path for it. Extra taxiing distance is the difference distance between actual route length obtained by planning and the shortest route length. The extra taxiing distance is produced in order to avoid conflicts in the surface taxiing scheduling.
The fairness constraints of aircraft taxiing route are in essence to distribute the extra taxiing distance produced by scheduling between airlines. The smaller the Gini coefficient for airlines is, the more means the taxiing scheduling is. The extra taxiing distance of airline is as follows: is the actual length of taxiing route which is obtained by the planning schedule, so . is the shortest route from the starting point to the end, which could be obtained from the Dijkstra algorithm.The Gini coefficient is defined and calculated as follows:Letting be less than a small constraint parameter value , the fairness constraint based on taxiing length could be established as follows:Formula (19) ensures the fairness of taxiing route length:Similarly, formula (21) ensures the fairness of waiting delay of all the aircraft.
4. Simulation
At the beginning of simulation, we create the surface taxiing route sets for all landing and takeoff aircraft. On this basis, we encode for the characteristic of airport surface taxiing scheduling, design an improved genetic algorithm, use the actual data of an airport for simulation and analysis, and compare the results with the results of the ant colony optimization.
4.1. Establish Taxiing Route Sets
Establishing surface taxiing route sets is to get the shortest feasible routes for each aircraft from the origin to destination. Aircraft with different origins or destinations need different route sets. The aircraft surface taxiing route problem can be abstracted into pointtopoint problem, and Dijkstra algorithm can generate the shortest route for any single aircraft. However, the dynamic scheduling of surface taxiing requires multiple different taxiing routes to meet their demands. The shortest path method [22] is used to generate the first shortest taxiing routes to establish the set of taxiing routes in the paper.
4.2. The Improved Genetic Algorithm
The improved genetic algorithm (IGA) for the surface taxiing scheduling is introduced in this section.
4.2.1. Gene Encoding
Selecting gene encoding has an important impact on the design and solution of the genetic algorithm. As aircraft surface taxiing scheduling is extremely complex, simply using the aircraft taxiing route nodes as a chromosome coding accepted by most general genetic algorithm will likely cause a single chromosome to be huge. In addition, the crossover and mutation manipulation will destroy the existing sequence of nodes, which can result in that the adjacent nodes in the sequence are not reachable in real network. Therefore, the paper designs the improved encoding as follows.
In the improved encoding, dualchromosome is adopted. The length of the chromosome is equal to the number of aircraft needed to be scheduled. A chromosome consists of two rows. One is the aircraft taxiing route sequence number row and the other is the aircraft waiting delay time row. We can use only a chromosome to express the taxiing route and the scheduling for all aircraft. Letting the number of aircraft be , then the chromosome can be expressed as , where and . For example, is the st route for the 1st aircraft in the corresponding route set. represents waiting delay time for the 1st aircraft. It cannot exceed the maximum waiting delay time, so . This encoding mode not only is fit for the characteristics of aircraft surface taxiing scheduling, but also is easier for the achievement of crossover and mutation manipulation.
4.2.2. The Fitness Function
Population initialization can be generated by the random method, and then we can calculate the individual fitness. According to the characteristics of aircraft taxiing route scheduling, the fitness function designed should take account of the cost of aircraft taxiing (the total taxiing time), the aircraft average waiting delay time, and the number of conflict points:According to information of taxiing route line in the chromosome, each aircraft’s taxiing time can be calculated, as well as the total taxiing time of all aircraft.
The average waiting delay time of an aircraft can be obtained according to waiting delay information in the second row of the chromosome. Each aircraft waiting delay should be as less as possible.
Aircraft taxiing with no conflict is the key of aircraft taxiing scheduling. The indicates the number of taxiing conflict points. According to chromosomes information, the landing time of each aircraft at each node can be calculated first, and then the number of taxiing conflict points can be obtained based on formula (7) to formula (13). When two aircraft taxi in violation of any safety spatial or temporal requirement, a conflict is recorded. Because in the final aircraft taxiing route scheduling there must be no conflict, this parameter should be set to a larger weight in the simulation.
Two methods are adopted to resolve aircraft taxiing route conflicts in taxiing: one is to control the taxiing time of aircraft in the system, and the other is to select one taxiing route dynamically from the predetermined route set. In the paper, the IGA simultaneously uses these two methods to solve the taxiing conflicts. Under the premise of no taxiing conflict in the whole airport surface, we minimize the taxiing cost and waiting delay time for all aircraft in the planning period.
4.2.3. Genetic Manipulation
Based on the above chromosome encoding and fitness calculation, the genetic manipulations can be done. Genetic manipulations mainly include selection, crossover, and mutation. The reinsertion process is added to select the new generation. The selection manipulation takes the random competing selection method. The crossover manipulation takes onepoint crossover. According to the needs of the aircraft taxiing route scheduling, the improvements of the genetic manipulation are mainly reflected in two aspects: the reinsertion manipulation and the mutation manipulation.
Mutation Manipulation. In the paper, two mutation methods are used. One is a standard mutation based on aircraft taxiing route and waiting delay time. Namely, regular mutation is done on the first row of taxiing route and the second row of waiting delay time of the chromosome. The other is biased mutation based on waiting delay time. A random waiting time is imposed to the chromosome delay row, , such that . As is a random number in , it is always biased negative. After adding the number to the chromosome, the aircraft waiting delay time can bias the direction of decreasing. This method can speed up the time that the individual with a small delay appears.
Reinsertion Manipulation. Reinsertion manipulation means replacing the most unsuited individuals in the previous generation of populations by the new suited individuals based on the fitness value. Because the aircraft surface taxiing route is quite complex, easily resulting in conflict points, and most individuals of the resulting generation are worse than the parent generation, the paper introduces the reinsertion manipulation. By reinsertion manipulation, we can use the small number of new individuals with the best fitness value to replace the corresponding number of individuals in the previous generation of population which could maximize the retention of superior individuals in the parent generation.
The main flowchart of the improved genetic algorithm used in the paper is shown in Figure 1.
4.3. Simulation Data
In the paper, some part of airfield configuration diagram of a large airport is used here (Figure 2), which contains 37 nodes and 48 edges, two independently running runways and three gate zones (, , and ).
During the simulation, the paper first established a set with a certain number (set 15) between each gate and each runway threshold or between each runway exit and each gate zone. For example, according to Figure 2, we can establish a set with 15 taxiing routes for exit of runway 1 (node 32) and gate zone (node 35). By permutations of the runways and gate zones known, we can get 12 sets and total 180 taxiing routes.
Assume that the taxiing speed of aircraft in taxiing way is 10 m/s; the minimum safety distance is 200 m; aircraft runway occupancy time is 30 s; the capacity of two taxiing way direct connected nodes ; wake turbulence separation criterion is 2 minutes.
Genetic Parameters. The generation gap , crossover probability , mutation probability routine , biased mutation probability , biased mutation random waiting time , genetic generations , population size , the maximum allowable waiting time min, and the probability of reinsertion .
Fairness Parameters. Consider , .
In the aircraft scheduling simulation, assume that there are 20 aircraft needed to be scheduled. The estimated landing time of arrivals and the estimated time of pushout for departures are the time when s. The estimated time for departures must meet the maximum allowable waiting time. Information about the arrivals and departures is shown in Table 1.

4.4. Simulation Results
4.4.1. Analysis of Algorithm Performance
Using MATLAB to code the IGA and based on the surface data of one of our country’s large airports, we simulate the model established above. The evolution of the genetic algorithm is shown in Figure 3.
The evolutionary process of the IGA shows that in the first 20 generations the evolution of the population converges rapidly, and after 70 generations, the evolution levels off. After 140 iterations, the average fitness value of the population and the fitness value of the best individual start stabilizing. It takes 7 minutes and 55 seconds to run the program, which could meet the timeliness requirements of resources operating and scheduling on airport surface.
4.4.2. Analysis of Simulation Results
Through the simulation, we can get the best individual in the last generation population. Meanwhile, the paper selects a scheduling result through the ant colony optimization (ACO) to contrast the simulation results, which is shown in Table 2.
 
Note. Due to the paper length, the path 12 sets with 180 routes cannot be fully demonstrated here. 
IGA and ACO are both conflictfree scheduling methods. In the two methods, each aircraft has a taxiing route and waiting delay time. We can see from Table 2, in the IGA, that 4 aircraft start taxiing with no waiting delay, waiting delay time of 9 aircraft is within 500 s, and waiting delay of 2 aircraft is longer than 1500 s. In the ACO, 4 aircraft have no waiting delays, but only waiting delay of 7 aircraft is within 500 s and waiting delay of 5 aircraft is longer than 1500 s. Therefore, the simulation results of IGA are better than the results of ACO in the taxiing route scheduling.
According to the aircraft taxiing scheduling results in Table 2 and the route sets, we can get the specific and detailed scheduling for aircraft’s taxiing in the IGA, including the node which each aircraft passes through and the time of arriving at each node in Table 3.
 
Note. In the table, the up row indicates the upstream route nodes for each aircraft going through; the down row indicates the time reaching each node. 
The comparisons and statistics of taxiing route and waiting delay time for each aircraft are shown in Table 4. The shortest route (SHR), length of taxiing route (LTR), the extra taxiing distance (EXTD), and the waiting delay time (WDT) information are shown in Table 4.

From Table 4, we can see that, in the IGA, the aircraft 2, 3, 4, 8, 17, and 18 all select the shortest route, greatly reducing the cost of taxiing. And to avoid conflicts, the other aircraft do not select the shortest route which leads to extra taxiing costs. In the ACO, only five aircraft choose the shortest route.
From Table 4, in the ACO, the total taxiing distance is 57210 m, the total extra taxiing route is 4330 m, and the total waiting delay time is 17329 s. In the IGA of this paper, the total taxiing distance is 55140 m; the total extra taxiing route is 2260 m, which is 47.8% lower than the ACO; the total delay time is 13607 s, which is reduced by 21.5% compared with the ACO, as seen in Figure 4. The advantages of the IGA have been shown. In the specially designed genetic algorithm for surface taxiing scheduling, enough diverse individuals are generated through crossover and mutation manipulation, and excellent variation individuals will enter into the next generation with greater proportion through the selection and reinsertion manipulation. The evolution of the IGA would go in the direction of no conflict, less waiting delay time, and less extra taxiing distance.
According to the simulation results in Table 4, we can draw the contrastive analysis diagram of the aircraft taxiing distance and the extra taxiing route in the IGA and ACO, which is shown in Figures 5 and 6.
From Figures 5 and 6, compared with the ACO, the results of the IGA are that each aircraft selects a shorter taxiing route as possible, and the taxiing distance is significantly reduced, especially for the extra taxiing route distance. From Figures 5 and 6, it can be seen that, in the IGA, the taxiing distance of 6 aircraft is reduced, 10 aircraft are constant, and 4 aircraft are increased. However, due to a big margin reduced in aircraft 3 and aircraft 18, the total extra taxiing distance reduces by 47.8% compared with the ACO. The IGA reduces the overall taxiing route distance and operating cost effectively. The 47.8% decrease is mainly caused by the concept of the extra taxiing distance. According to the concept, the extra taxiing distance could be reduced to zero with 100% decrease, if all aircraft taxi with their shortest taxiing route. That is to say, not all aircraft have extra taxiing distance. If some (not too many) aircraft’s routes are improved, obvious reflection will be shown in this value.
According to Table 4, the contrastive analysis diagram of the waiting delay time can also be obtained in Figure 7.
Waiting delay time refers to the time postponed off the scheduling. The delay time is the difference between the time an aircraft actually begins to enter the surface taxiway system and the earliest possible time it can enter the taxiing system. Table 2 and Figure 7 show that, in the IGA, at the time s, landing aircraft 2 and aircraft 5 leave gate 35 () and gate 36 (), respectively, and takingoff aircraft 15 and aircraft 16 leave the runway 1 (exit node 32) and runway 2 (exit node 34), respectively. Therefore, 4 aircraft start to taxi simultaneously. Aircraft 1 is the last aircraft to begin taxiing at the time 1773 s. But it meets the condition that all aircraft can finish the taxiing or begin taxiing in the interval of 30 minutes. Compared with the ACO, 9 aircraft are shortened on waiting delay time, 5 aircraft are unchanged, and 6 aircraft are longer. On the whole, the IGA reduces the aircraft waiting delay time and improves the efficiency of airport surface.
The optimizing model provides a seamless connection between taxiway and runway. Runway queuing and scheduling are integrated into the model. The model considers different stakeholders’ requirements, ensuring the safety of airport surface movement, reducing delay and taxiing cost, and improving the utilization efficiency of airport resources. The genetic algorithm used here is greatly improved which is more suitable for the airport surface taxiing scheduling problem and the optimizing model. In the IGA, aircraft could change the initial taxiing time and the taxiing route to optimize the taxiing and scheduling in large data search space rapidly as shown in the results.
4.4.3. The Gini Coefficient and Fairness Analysis for Airlines
(1) Analysis of Scheduling Fairness. According to Table 4, we can calculate the extra taxiing distance (EXTD), the average extra taxiing distance (AETD), the waiting delay time (WDT), and the average waiting delay time (AWDT) for each airline in Table 5 and Figure 8.

It can be seen in Table 5 and Figure 8, in the IGA, that the average extra taxiing distances of each airline are 113.3 m, 131.1 m, and 80 m, respectively. The Gini coefficient of extra taxiing distance is 0.3412. The average delay time of each airline is 895.8 s, 394.1 s, and 937 s, respectively. The Gini coefficient of the average waiting delay time is 0.3422. Both Gini coefficients meet the requirement within a reasonable range. In the ACO, the Gini coefficient of extra taxiing distance is 0.2886; it is fair but the overall extra distance is too long. The Gini coefficient of the average waiting delay time is 0.4351, which exceeds the required value 0.35. The results indicate that the distribution of the delay between airlines is not fair enough.
The optimizing model considers the fairness of scheduling, and the IGA could well finish the solving. The extra taxiing distance and waiting delay time are distributed between airlines fairly. Thus, the interests of various airlines are protected.
(2) Impact Analysis on Different Fairness Parameters. The paper mainly analyzes the impact of the two fairness constraint parameters on optimization results. In order to control variables, we set or to be 1 and the other to be 0.25, 0.3, and 0.35, respectively. For example, let in the optimization, and the optimization results and properties are shown in Table 6. The average extra taxiing distance and the average waiting delay time of each airline are shown in Table 7 and Figure 9.


From Table 6, we can see that, with the increase of Gini coefficient () controlling the delay fairness (namely, fairness reduced), the total extra taxiing distance and the total waiting delay time are falling (namely, efficiency increased). Table 7 and Figure 9 also show that the average extra taxiing distance and the average waiting delay time for each airline are decreasing. This illustrates that the efficiency and fairness of scheduling are mutually affected and restricted. So the selection of fairness parameter values has an important impact on the entire scheduling optimization results.
5. Conclusions
The airport surface taxiing route scheduling between taxiway and runway in hub airport problem is studied here. An optimization model based on safety, efficiency, and fairness is established for the aircraft surface taxiing problem. The paper also combines the needs and interests of the air traffic controllers, airlines, and airport authorities. The occupancy of the runway has an important impact on the surface taxiing and is integrated into the airport surface scheduling. The IGA adapted to the problem and model is designed to optimize and solve the problem. Simulation data comes from a large airport. Simulation results show that compared with the ACO, the paper proposed the total extra taxiing distance which is reduced by 47.8% and the total waiting delay time which is decreased by 21.5%. The efficiency of the airport surface taxiing is effectively improved and the surface taxiing fairness interairline is enhanced. The optimal solution got here is in line with expectations.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work was supported by the National Natural Science Foundation of China and Civil Aviation Administration of China (no. U1333117); The National Natural Science Foundation of China (NSFC) (no. 61104159); China Postdoctoral Science Foundation (no. 2012M511275); and The Fundamental Research Funds for the Central Universities (no. NS2013067).
References
 SESAR, “Milestone deliverable D1: air transport framework: the current situation,” Tech. Rep. DLM06020010300, Eurocontrol, 2006. View at: Google Scholar
 Transport Canada, “National Civil Aviation Safety Subcommittee on Runway Incursions: final report,” Tech. Rep. TP13795E, Transport Canada, Ottawa, Canada, 2000. View at: Google Scholar
 J. W. Smeltink and M. J. Soomer, “An optimisation model for airport taxi scheduling,” in Proceedings of the INFORMS Annual Meeting, Denver, Colo, USA, 2004. View at: Google Scholar
 S. Rathinam, J. Montoya, and Y. Jung, “An optimization model for reducing aircraft taxi times at the Dallas Fort Worth International Airport,” in Proceedings of the 26th Congress of International Council of the Aeronautical Sciences (ICAS '08), pp. 14–19, September 2008. View at: Google Scholar
 J. B. Gotteland, N. Durand, J. M. Alliot et al., “Aircraft ground traffic optimization,” in Proceedings of the 4th International USA/Europe Air Traffic Management Research and Development Seminar (ATM '01), 2001. View at: Google Scholar
 S. J. Landry, X. W. Chen, and S. Y. Nof, “A decision support methodology for dynamic taxiway and runway conflict prevention,” Decision Support Systems, vol. 55, no. 1, pp. 165–174, 2013. View at: Publisher Site  Google Scholar
 K. Anderson, F. Carr, E. Feron et al., “Analysis and modeling of ground operations at hub airports,” in Proceedings of the 3rd USA/Europe Air Traffic Management R&D Seminar, pp. 13–167, Napoli, Italy, 2000. View at: Google Scholar
 D. E. Pitfield, A. S. Brooke, and E. A. Jerrard, “A MonteCarlo simulation of potentially conflicting ground movements at a new international airport,” Journal of Air Transport Management, vol. 4, no. 1, pp. 3–9, 1998. View at: Publisher Site  Google Scholar
 G. Keith, A. Richards, and S. Sharma, “Optimization of taxiway routing and runway scheduling,” in Proceedings of the AIAA Guidance, Navigation and Control Conference and Exhibit, Honolulu, Hawaii, USA, August 2008. View at: Google Scholar
 H. Balakrishnan and J. Yoon, “A framework for coordinated surface operations planning at dallasfort worth international airport,” in Proceedings of the AIAA Guidance, Navigation, and Control Conference, vol. 3, pp. 2382–2400, August 2007. View at: Google Scholar
 P. C. Roling and H. G. Visser, “Optimal airport surface traffic planning using mixedinteger linear programming,” International Journal of Aerospace Engineering, vol. 2008, no. 1, pp. 1–11, 2008. View at: Google Scholar
 R. Anderson and D. Milutinović, “An approach to optimization of airport taxiway scheduling and traversal under uncertainty,” Proceedings of the Institution of Mechanical Engineers Part G: Journal of Aerospace Engineering, vol. 227, no. 2, pp. 273–284, 2013. View at: Publisher Site  Google Scholar
 J. You and S.C. Han, “Taxi route optimization algorithm of airport surface based on multiagent,” Journal of Traffic and Transportation Engineering, vol. 9, no. 1, pp. 109–112, 2009. View at: Google Scholar
 Y. Wang, M. Hu, and W. Su, “Dynamic taxiway routing algorithm based on conflict avoidance,” Journal of Southwest Jiaotong University, vol. 44, no. 6, pp. 933–939, 2009. View at: Publisher Site  Google Scholar
 Á. G. Marín, “Airport management: taxi planning,” Annals of Operations Research, vol. 143, no. 1, pp. 191–202, 2006. View at: Publisher Site  Google Scholar
 A. Marín and E. Codina, “Network design: taxi planning,” Annals of Operations Research, vol. 157, no. 1, pp. 135–151, 2008. View at: Publisher Site  Google Scholar
 F. Carr, A. Evans, J.P. Clarke, and E. Feron, “Modeling and control of airport queueing dynamics under severe flow restrictions,” in Proceedings of the American Control Conference, vol. 2, pp. 1314–1319, IEEE, May 2002. View at: Publisher Site  Google Scholar
 H. Idris, P. J. Clarke, R. Bhuva, and L. Kang, “Queuing model for taxiout time estimation,” Air Traffic Control Quarterly, vol. 10, no. 1, pp. 1–22, 2002. View at: Google Scholar
 H. Baik, H. D. Sherali, and A. A. Trani, “Timedependent network assignment strategy for taxiway routing at airports,” Transportation Research Record, vol. 1788, no. 1, pp. 70–75, 2002. View at: Google Scholar
 J. García, A. Berlanga, J. M. Molina, and J. R. Casar, “Optimization of airport ground operations integrating genetic and dynamic flow management algorithms,” AI Communications, vol. 18, no. 2, pp. 143–164, 2005. View at: Google Scholar  MathSciNet
 J.B. Gotteland and N. Durand, “Genetic algorithms applied to airport ground traffic optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '03), pp. 544–551, IEEE, December 2003. View at: Publisher Site  Google Scholar
 D. Eppstein, “Finding the $k$ shortest paths,” SIAM Journal on Computing, vol. 28, no. 2, pp. 652–673, 1998. View at: Publisher Site  Google Scholar  MathSciNet
Copyright
Copyright © 2015 Yu Jiang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.