Real-time airport surface movement planning: Minimizing aircraft emissions

This paper presents a study towards the development of a real-time taxi movement planning system that seeks to optimize the timed taxiing routes of all aircraft on an airport surface, by minimizing the emissions that result from taxiing aircraft operations. To resolve this online planning problem, one of the most commonly employed operations research methods for large-scale problems has been successfully used, viz., mixed-integer linear programming (MILP). The MILP formulation implemented herein permits the planning system to update the total taxi planning every 15 s, allowing to respond to unforeseen disturbances in the traffic flow. Extensive numerical experiments involving a realistic (hub) airport environment bear out that an estimated environmental benefit of 1–3 percent per emission product can be obtained. This research effort clearly demonstrates that a surface movement planning system capable of minimizing the emissions in conjunction with the total taxiing time can be beneficial for airports that face dense surface traffic and stringent environmental requirements.     

Conflict‐free time‐based trajectory planning for aircraft taxi automation with refined taxiway modeling

To mitigate airport congestion caused by increasing air traffic demand, the trajectory‐based surface operations concept has been proposed to improve surface movement efficiency while maintaining safety. It utilizes decision support tools to provide optimized time‐based trajectories for each aircraft and uses automation systems to guide surface movements and monitor their conformance with assigned trajectories. Whether the time‐based trajectories can be effectively followed so that the expected benefits can be guaranteed depends firstly on whether these trajectories are realistic. So, this paper first deals with the modeling biases of the network model typically used for taxi trajectory planning via refined taxiway modeling. Then it presents a zone control‐based dynamic routing and timing algorithm upon the refined taxiway model to find the shortest time taxi route and timings for an aircraft. Finally, the presented algorithm is integrated with a sequential planning framework to continuously decide taxi routes and timings. Experimental results demonstrate that the solution time for an aircraft can be steadily around a few milliseconds with timely cleaning of expired time windows, showing potential for real‐time decision support applications. The results also show the advantages of the proposed methodology over existing approaches. Copyright © 2015 John Wiley & Sons, Ltd.     

Research review of air traffic management

As air transport demand keeps growing more quickly than system capacity, efficient and effective management of system capacity becomes essential to the operation of the future global air traffic system. Although research in the past two decades has made significant progress in relevant research fields, e.g. air traffic flow management and airport capacity modelling, research loopholes in air traffic management still exist and links between different research areas are required to enhance the system performance of air traffic management. Hence, the objective of this paper is to review systematically current research in the literature about the issue of air traffic management to prioritize productive research areas. Papers about air traffic management are discussed and categorized into two levels: system and airport. The system level of air transport research includes two main topics: air traffic flow management and airspace research. On the airport level, research topics are: airport capacity, airport facility utilization, aircraft operations in the airport terminal manoeuvring area as well as aircraft ground operations research. Potential research interests to focus on in the future are the integration between airspace capacity and airport capacity, the establishment of airport information systems to use airport capacity better, and the improvement in flight schedule planning to improve the reliability of schedule implementation.     

Flight schedule punctuality control and management: a stochastic approach

The insufficiency of infrastructure capacity in an air transport system is usually blamed for poor punctuality performance when implementing flight schedules. However, investigations have revealed that ground operations of airlines have become the second major cause of flight delay at airports. A stochastic approach is used in this paper to model the operation of aircraft turnaround and the departure punctuality of a turnaround aircraft at an airport. The aircraft turnaround model is then used to investigate the punctuality problem of turnaround aircraft. Model results reveal that the departure punctuality of a turnaround aircraft is influenced by the length of scheduled turnaround time, the arrival punctuality of inbound aircraft as well as the operational efficiency of aircraft ground services. The aircraft turnaround model proposed is then employed to evaluate the endogenous schedule punctuality of two turnaround aircraft. Model results, when compared with observation data, show that the operational efficiency of aircraft ground services varies among turnarounds. Hence, it is recommended that the improvement of departure punctuality of turnaround aircraft may be achieved from two approaches: airline scheduling control and the management of operational efficiency of aircraft ground services.     

The planning of aircraft routes and flight frequencies in an airline network operations

This research is aimed at developing a model that maximizes system profit when determining the aircraft routes and flight frequencies in a network. The model employs network flow techniques to effectively collect or deliver passenger flows from all origins to all destinations using non‐stop and multi‐stop flights in multi‐fleet operations. The model was formulated as a multi‐commodity network flow problem. A Lagrangian‐based algorithm was developed to solve the problem. To test the model in practice, a case study is presented.     

Heuristic search for the coupled runway sequencing and taxiway routing problem

This paper presents the first local search heuristic for the coupled runway sequencing (arrival & departure) and taxiway routing problems, based on the receding horizon (RH) scheme that takes into account the dynamic nature of the problem. As test case, we use Manchester Airport, the third busiest airport in the UK. From the ground movement perspective, the airport layout requires that departing aircraft taxi across the arrivals runway. This makes it impossible to separate arrival from departure sequencing in practice. Operationally, interactions between aircraft on the taxiways could prevent aircraft from taking off from, or landing on, runways during the slots assigned to them by an algorithm optimizing runway use alone. We thus consider the interactions between arrival and departure aircraft on the airport surface. Compared to sequentially optimized solutions, the results obtained with our approach indicate a significant decrease in the taxiway routing delay, with generally no loss in performance in terms of the sequencing delay for a regular day of operations. Another benefit of such a simultaneous optimization approach is the possibility of holding aircraft at the stands for longer, without the engines running. This significantly reduces the fuel burn, as well as bottlenecks and traffic congestion during peak hours that are often the cause of flight delays due to the limited amount of airport surface space available. Given that the maximum computing time per horizon is around 95 s, real-time operation might be practical with increased computing power.     

Estimating fuel burn impacts of taxi-out delay with implications for gate-hold benefits

The aviation community is actively investigating initiatives to reduce aircraft fuel consumption from surface operations, as surface management strategies may face fewer implementation barriers compared with en route strategies. One fuel-saving initiative for the air transportation system is the possibility of holding aircraft at the gate, or the spot, until the point at which they can taxi unimpeded to the departure runway. The extent to which gate holding strategies have financial and environmental benefits hinges on the quantity of fuel that is consumed during surface operations. A pilot of an aircraft may execute the taxi procedure on a single engine or utilize different engine thrust rates during taxi because of a delay. In the following study, we use airline fuel consumption data to estimate aircraft taxi fuel consumption rates during the “unimpeded” and “delayed” portions of taxi time. We find that the fuel consumption attributed to a minute of taxi-out delay is less than that attributed to minute of unimpeded taxi time; for some aircraft types, the fuel consumption rate for a minute of taxi delay is half of that for unimpeded taxi. It is therefore not appropriate, even for rough calculations, to apply nominal taxi fuel consumption rates to convert delayed taxi-out time into fuel burn. On average we find that eliminating taxi delay would reduce overall flight fuel consumption by about 1%. When we consider the savings on an airport-by-airport basis, we find that for some airports the potential reduction from reducing taxi delay is as much as 2%.     

Modeling taxi drivers’ decisions for improving airport ground access: John F. Kennedy airport case

Taxi service is an important component of airport ground access, which affects the economic competitiveness of an airport and its potential positive impact on the surrounding region. Airports across the globe experience both taxi shortages and excesses due to various factors such as the airport’s proximity to the city center, timing and frequency of flights, and the fare structure. Since taxi drivers are independent entities whose decisions affect the taxi supply at airports, it is important to understand taxi drivers’ decision mechanisms in order to suggest policies and to maintain taxi demand and supply equilibrium at the airports. In this paper, New York City (NYC) taxi drivers’ decisions about airport pick-ups or cruising for customers at the end of each trip is modeled using logistic regression based on a large taxi GPS dataset. The presented approach helps to quantify the potential impacts of parameters and to rank their influence for policy recommendations. The results reveal that spatial variables (mainly related to proximity) have the highest impact on taxi drivers’ airport pickup decisions, followed by temporal, environmental and driver-shift related variables. Along with supplementary information from unstructured taxi driver interviews, the model results are used to suggest policies for the improvement of John F. Kennedy (JFK) airport’s ground access and passenger satisfaction, i.e. the implementation of taxi driver frequent airport server punch cards and a time-specific ride share program.     

Apron capacity at hub airports—the impact of wave‐system structure

At hub airports, dominant airlines/alliance coordinate their flights in time with the aim of increasing the number (and quality) of connections, thus producing a wave‐system in traffic schedules. This paper addresses the impact of concentrating aircraft into waves on airport apron capacity. Existing models for apron capacity estimation are based on the number of stands, stand occupancy time, and demand structure, differing between representative groups of aircraft served at an airport. Criteria for aircraft grouping are aircraft type and/or airline and/or type of service (domestic, international, etc.). Modified deterministic analytical models proposed in this paper also take into account the wave‐system parameters, as well as runway capacity. They include the impact of these parameters on the number of flights in wave, stand occupancy time, and consequently apron capacity. Numerical examples illustrate the difference between apron capacity for an origin–destination airport and a hub airport, under the same conditions; utilization of the theoretical apron capacity at a hub airport, given the wave‐system structure; and utilization of the apron capacity at a hub airport when point‐to‐point traffic is allowed to use idle stands. Furthermore, the influence of different assignment strategies for aircraft stands in the case of hub airports is also discussed. Copyright © 2016 John Wiley & Sons, Ltd.     

A mathematical programming technique for matching time-stamped records in logistics and transportation systems

Time-stamped data for transportation and logistics are essential for estimating times on transportation legs and times between successive stages in logistic processes. Often these data are subject to recording errors and omissions. Matches must then be inferred from the time stamps alone because identifying keys are unavailable, suppressed to preserve confidentiality, or ambiguous because of missing observations. We present an integer programming (IP) model developed for matching successive events in such situations and illustrate its application in three problem settings involving (a) airline operations at an airport, (b) taxi service between an airport and a train station, and (c) taxi services from an airport. With data from the third setting (where a matching key was available), we illustrate the robustness of estimates for median and mean times between events under different random rates for “failure to record”, different screening criteria for outliers, and different target times used in the IP objective. The IP model proves to be a tractable and informative tool for data matching and data cleaning, with a wide range of potential applications.     

Solution methods for the taxi pooling problem

In Taiwan, taxi pooling is currently performed by some taxi companies using a trial-and-error experience-based method, which is neither effective nor efficient. There is, however, little in the literature on effective models and solution methods for solving the taxi pooling problem. Thus, in this study we employ network flow techniques and a mathematical programming method to develop a taxi pooling solution method. This method is composed of three models. First, a fleet routing/scheduling model is constructed to produce fleet/passenger routes and schedules. A solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the fleet routing/scheduling model. Then, two single taxi-passenger matching models are constructed with the goals of decreasing number of passenger transfers and matching all passengers and taxis. These two taxi-passenger matching models are directly solved using a mathematical programming solver. For comparison with the solution method, we also develop another heuristic by modifying a heuristic recently proposed for solving a one-to-many taxi pooling problem. The performance of the solution method and the additional heuristic are evaluated by carrying out a case study using real data and suitable assumptions. The test results show that these two solution methods could be useful in practice.     

Multi‐objective airport gate assignment problem in planning and operations

We consider the assignment of gates to arriving and departing flights at a large hub airport. This problem is highly complex even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There are various considerations that are involved while assigning gates to incoming and outgoing flights (such a flight pair for the same aircraft is called a turn) at an airport. Different gates have restrictions, such as adjacency, last‐in first‐out gates and towing requirements, which are known from the structure and layout of the airport. Some of the cost components in the objective function of the basic assignment model include notional penalty for not being able to assign a gate to an aircraft, penalty for the cost of towing an aircraft with a long layover, and penalty for not assigning preferred gates to certain turns. One of the major contributions of this paper is to provide mathematical model for all these complex constraints that are observed at a real airport. Further, we study the problem in both planning and operations modes simultaneously, and such an attempt is, perhaps, unique and unprecedented. For planning mode, we sequentially introduce new additional objectives to our gate assignment problem that have not been studied in the literature so far—(i) maximization of passenger connection revenues, (ii) minimization of zone usage costs, and (iii) maximization of gate plan robustness—and include them to the model along with the relevant constraints. For operations mode, the main objectives studied in this paper are recovery of schedule by minimizing schedule variations and maintaining feasibility by minimal retiming in the event of major disruptions. Additionally, the operations mode models must have very, very short run times of the order of a few seconds. These models are then applied to a functional airline at one of its most congested hubs. Implementation is carried out using Optimization Programming Language, and computational results for actual data sets are reported. For the planning mode, analyst perception of weights for the different objectives in the multi‐objective model is used wherever actual dollar value of the objective coefficient is not available. The results are also reported for large, reasonable changes in objective function coefficients. For the operations mode, flight delays are simulated, and the performance of the model is studied. The final results indicate that it is possible to apply this model to even large real‐life problems instances to optimality within short run times with clever formulation of conventional continuous time assignment model. Copyright © 2013 John Wiley & Sons, Ltd.     

Disruption Management of an Inequality-Based Multi-Fleet Airline Schedule by a Multi-Objective Genetic Algorithm

Abstract

This paper presents a novel application of a Method of Inequality-based Multi-objective Genetic Algorithm (MMGA) to generate an efficient time-effective multi-fleet aircraft routing algorithm in response to the schedule disruption of short-haul flights. It attempts to optimize objective functions involving ground turn-around times, flight connections, flight swaps, total flight delay time and a 30-minute maximum delay time of original schedules. The MMGA approach, which combines a traditional Genetic Algorithm (GA) with a multi-objective optimization method, can address multiple objectives at the same time, then explore the optimal solution. The airline schedule disruption management problem is traditionally solved by Operations Research (OR) techniques that always require a precise mathematical model. However, airline operations involve too many factors that must be considered dynamically, making a precise mathematical model difficult to define. Experimental results based on a real airline flight schedule demonstrate that the proposed method, Multi-objective Optimization Airline Disruption Management by GA, can recover the perturbation efficiently within a very short time. Our results further demonstrate that the application can yield high quality solutions quickly and, consequently, has potential to be employed as a real-time decision support tool for practical complex airline operations.     

A fuzzy approach to addressing uncertainty in Airport Ground Movement optimisation

Allocating efficient routes to taxiing aircraft, known as the Ground Movement problem, is increasingly important as air traffic levels continue to increase. If taxiways cannot be reliably traversed quickly, aircraft can miss valuable assigned slots at the runway or can waste fuel waiting for other aircraft to clear. Efficient algorithms for this problem have been proposed, but little work has considered the uncertainties inherent in the domain. This paper proposes an adaptive Mamdani fuzzy rule based system to estimate taxi times and their uncertainties. Furthermore, the existing Quickest Path Problem with Time Windows (QPPTW) algorithm is adapted to use fuzzy taxi time estimates. Experiments with simulated taxi movements at Manchester Airport, the third-busiest in the UK, show the new approach produces routes that are more robust, reducing delays due to uncertain taxi times by 10–20% over the original QPPTW.     

Metaheuristics for efficient aircraft scheduling and re-routing at busy terminal control areas

Intelligent decision support systems for the real-time management of landing and take-off operations can be very effective in helping air traffic controllers to limit airport congestion at busy terminal control areas. The key optimization problem to be solved regards the assignment of airport resources to take-off and landing aircraft and the aircraft sequencing on them. The problem can be formulated as a mixed integer linear program. However, since this problem is strongly NP-hard, heuristic algorithms are typically adopted in practice to compute good quality solutions in a short computation time. This paper presents a number of algorithmic improvements implemented in the AGLIBRARY solver (a state-of-the-art optimization solver to deal with complex routing and scheduling problems) in order to improve the possibility of finding good quality solutions quickly. The proposed framework starts from a good initial solution for the aircraft scheduling problem with fixed routes (given the resources to be traversed by each aircraft), computed via a truncated branch-and-bound algorithm. A metaheuristic is then applied to improve the solution by re-routing some aircraft in the terminal control area. New metaheuristics, based on variable neighbourhood search, tabu search and hybrid schemes, are introduced. Computational experiments are performed on an Italian terminal control area under various types of disturbances, including multiple aircraft delays and a temporarily disrupted runway. The metaheuristics achieve solutions of remarkable quality, within a small computation time, compared with a commercial solver and with the previous versions of AGLIBRARY.     

The flight perturbation problem

Airlines spend considerable time, effort and financial resources on planning. It is essential to create a competitive timetable and construct a fleet and a crew schedule that utilizes these resources to the maximum. Unfortunately, it is all too common that an airline is faced with the necessity of reconstructing their schedules due to some unforeseen event, for example an aircraft breakdown or a crew member that is indisposed. In this paper, an application that can help airlines solve the complex problem of reconstructing aircraft schedules is presented. A mixed integer multicommodity flow model with side constraints is developed and further reformulated into a set packing model using the Dantzig—Wolfe decomposition. Cancellations, delays and aircraft swaps are used to resolve the perturbation, and the model ensures that the schedule returns to normal within a certain time. Two column generation schemes for heuristically solving the model are tested on real problem data obtained from a Swedish domestic airline. The computational tests show that the application is capable of presenting high quality solutions in a few seconds and therefore can be used as a dynamic decision support tool by the airlines.     

A decision support framework for handling schedule perturbation

Perturbations of flight schedules may occur everyday. Poor scheduling of flights may result in a substantial loss of profit and decreased levels of service for air carriers. This research aims at developing a framework to help carriers in handling schedule perturbations caused by the breakdown of aircraft. The framework is based on a basic schedule perturbation model constructed as a dynamic network from which several perturbed network models are developed for scheduling following incidents. These network models are formulated as pure network flow problems or network flow problems with side constraints. The former are solved using the network simplex method while the latter are solved using Lagrangian relaxation with subgradient methods. To show how to apply the framework in the real world, a case study focusing on the operations of a major Taiwan air carrier in East Asia is presented.     

Airline’s choice of aircraft size – Explanations and implications

When facing a growth in demand, airlines tend to respond more by means of increasing frequencies than by increasing aircraft size. At many of the world’s largest airports there are fewer than 100 passengers per air transport movement, although congestion and delays are growing. Furthermore, demand for air transport is predicted to continue growing but aircraft size is not. This paper aims to investigate and explain this phenomenon, the choice of relatively small aircraft. It seems that this choice is associated mainly with the benefits of high frequency service, the competitive environment in which airlines operate and the way airport capacity is allocated and priced. Regression analysis of over 500 routes in the US, Europe and Asia provides empirical evidence that the choice of aircraft size is mainly influenced by route characteristics (e.g. distance, level of demand and level of competition) and almost not at all by airport characteristics (e.g. number of runways and whether the airport is a hub or slot coordinated). We discuss the implications of this choice of aircraft size and suggest that some market imperfections exist in the airline industry leading airlines to offer excessive frequency on some routes and too low frequency on others.     

Airport taxi service regulation: An analysis of an exclusive contract

Taxi service at a number of major airports is supplied by one taxi company under an exclusive contract with the airport operating authority. Conventional wisdom suggests that airport taxi service produced under exclusive contract is socially inefficient. This was found to be true at the Dallas/Fort Worth Airport. In this paper we analyze the exclusive airport taxi service at Honolulu International Airport as a case study. At Honolulu International Airport, the terms of the exclusive airport taxi service contract are far less restrictive than those at Dallas/Fort Worth. Our analysis indicates that exclusive airport service can provide high quality service, reasonable prices and revenues to finance airport service. We conclude that is not the exclusivity, but rather the terms of the contract and the circumstances specific to each market that determines which system is best for a particular place.     

Airline scheduling: a heurisitic approach

In this paper a practical technique for finding improved airline routings and schedules is developed. A dynamic programming algorithm is combined with a heuristic method for assigning routes to the aircraft such that the expected total contribution to profit is maximum. Expected passenger demands and priorities are taken to be an input to the model. The model may be used to check the effect on the total system of adding or removing aircraft or of varying aircraft capacity. Although the test runs were made on data for a six city‐ten aircraft array a smaller, more simple numerical example is given to demonstrate the model logic.