The punctuality performance of aircraft rotations in a network of airports

The aim of this paper is to investigate the influence of aircraft turnaround performance at airports on the schedule punctuality of aircraft rotations in a network of airports. A mathematical model is applied, composed of two sub-models, namely the aircraft turnaround model (turnaround simulations) and the enroute model (enroute flight time simulations). A Markovian type model is featured in the aircraft turnaround model to simulate the operation of aircraft turnarounds at an airport by considering operational uncertainties and schedule punctuality variance. In addition, stochastic Monte Carlo simulations are employed to carry out stochastic sampling and simulations in both the aircraft turnaround model and the enroute model. Results of simulations show the robustness of the aircraft rotation model in capturing uncertainties from aircraft rotations. The propagation of knock-on delays in aircraft rotations is found to be significant when the short-connection-time policy is used by an airline at its hub airport. It is also found that the proper inclusion of schedule buffer time in the aircraft rotation schedule helps control the propagation of knock-on delays and, therefore, stabilize the punctuality performance of aircraft rotations.     

Emissions from auxiliary power units and ground power units during intraday aircraft turnarounds at European airports

It is widely known that emissions from aircraft engines, Auxiliary Power Units (APU) and ground handling equipment contribute to air pollution at airports. During the aircraft turnaround process, the main source of emissions is the APU. The use of the APU can be significantly reduced if the aircraft stand is equipped to supply external electrical power and pre-conditioned air to the cabin. This paper analyses the actual duration of APU and external power usage during intraday aircraft turnarounds at 125 airports during June 2015. The data is derived from flight data recording units of more than 200 short-haul, narrow-body jet aircraft, conducting some 25,195 aircraft turnarounds and thus provides the most detailed assessment of aircraft power usage available. A common practice is for the APU to be running for a short period on arrival at the stand (arrival-cycle) and then again for a short period prior to departure (departure-cycle). It is identified in this study that departure-cycle emissions are three times greater than arrival-cycle emissions. These emissions could be reduced if more accurate forecasts of departure times are available to flight crew. The provision of external ground power is found to reduce emissions by up to 47.6%. However, the study also highlights that when the source of external power is a diesel-fuelled mobile Ground Power Unit (GPU), there is a net doubling in emissions of hydrocarbons. APU usage is also observed to vary with outside air temperature (OAT) leading to possible increases in emissions of up to 6%.     

Implementation and application of a stochastic aircraft boarding model

The aircraft turnaround processes is mainly controlled by the ground handling, airport or airline staff, except the aircraft boarding, which is driven by the passengers’ experience and willingness or ability to follow the proposed boarding procedures. The paper uses a prior developed, calibrated, stochastic aircraft boarding model, which is applied to different boarding strategies (chronological order of passenger arrival, hand luggage handling), group constellations and innovative infrastructural changes (Flying Carpet, Side-Slip Seat, Foldable Passenger Seat). In this context, passenger boarding is assumed to be a stochastic, agent-based, forward-directed, one-dimensional and discrete process. The stochastic model covers individual passenger behavior as well as operational constraints and deviations. A comprehensive assessment using one model allows for efficient comparison of current research approaches and innovative operational solutions for efficient passenger boarding.     

The airline perturbation problem: considering disrupted passengers

Abstract

When airlines are faced with some unforeseen short-term events, they have to reconstruct their flight schedules. Although aircraft recovery decisions affect passengers, these disrupted passengers and recovering them have not been explicitly considered in most previous aircraft recovery models. This paper presents an assignment model for airline schedule recovery which recovers both aircraft and disrupted passengers simultaneously, using a rolling horizon time framework. Our model examines possible flight retiming, aircraft swapping, over-flying, ferrying, utilization of reserve aircraft, cancellation and passenger reassignment to generate an efficient schedule recovery plan. The model ensures that the schedule returns to normal within a certain time and the objective is to minimize operational recovery aircraft cost, cancellation and delay cost as well as disrupted passenger cost. The model is tested using a data-set with two disruption scenarios. The computational results show that it is capable of handling the integrated aircraft and passenger recovery problem successfully.     

A Heuristic Algorithm for the Allocation of Airport Runway System Capacity

Abstract

This paper develops a heuristic algorithm for the allocation of airport runway capacity to minimise the cost of arrival and departure aircraft/flight delays. The algorithm is developed as a potential alternative to optimisation models based on linear and integer programming. The algorithm is based on heuristic (‘greedy’) criteria that closely reflect the ‘rules of thumb’ used by air traffic controllers. Using inputs such as arrival and departure demand, airport runway system capacity envelopes and cost of aircraft/flight delays, the main output minimises the cost of arrival and departure delays as well as the corresponding interdependent airport runway system arrival and departure capacity allocation. The algorithm is applied to traffic scenarios at three busy US airports. The results are used to validate the performance of the proposed heuristic algorithm against results from selected benchmarking optimisation models.     

Dynamic yield management when aircraft assignments are subject to swap

As a practical form of demand driven dispatch at some major airlines in North America, cockpit compatible aircraft of different capacities are paired in the fleet assignment for a possible future swap on the two involved flights. They are paired in such a way that the swap does not affect their aircraft routings on other legs. The swap decision depends on demand realization on the two flights and is made at a predetermined time prior to departure. Yield management on the two flights is studied in this paper. We begin by studying a base problem in which at a certain time before departure, the assignment on a flight is subject to change with a fixed probability. The base problem extends the threshold policy into the case where future capacity is uncertain. Secondly, we propose a heuristic for yield management over two flights with swappable aircraft by repeatedly updating the swap probability as demand unfolds. Our numerical result shows that this policy significantly enhances the airline’s capability to increase revenue under demand driven dispatch. In addition, the base problem may shed lights on derivation of optimal yield management policy in irregular operational settings where final capacity assignment is independent of yield management policy.     

The influence of attitude towards individuals’ choice for a remotely piloted commercial flight: A latent class logit approach

The Remotely Piloted Commercial Passenger Aircraft Attitude Scale (RPCPAAS) was created to measure positive and negative attitudes towards a new and plausible form of air travel. This information was then used, in combination with a latent class logit model built on data generated from a stated choice experiment to gain insight into the choice behaviour between conventionally piloted aircraft (CPA) with a pilot on-board and remotely piloted aircraft (RPA) with a pilot on the ground. The results revealed that individuals, on-average, if presented a choice between a CPA and a RPA of equivalent attributes, would elect for the CPA option. However, there is variability in the passengers’ sensitivity to various flight attributes, and these sensitivities were influenced by individuals’ attitude towards the new technology (i.e., RPA). From an operational perspective, and assuming that one day passengers of commercial airlines are offered the choice between CPA and RPA, the strategies employed by airlines to encourage the use of the new technology need to be different, based on individuals’ attitude towards RPA.     

An environmental assessment of air traffic speed constraints in the departure phase of flight: A case study at Gothenburg Landvetter Airport,Sweden

This paper considers the environmental effects of air traffic management speed constraints during the departure phase of flight. We present a CO₂ versus noise trade-off study that compares aircraft departure procedures subject to speed constraints with a free speed scenario. A departure route at Gothenburg Landvetter Airport in Sweden is used as a case study and the analysis is based on airline flight recorded data extracted from the Airbus A321 aircraft. Results suggest that CO₂ emissions could be reduced by 180 kg per flight if all departure speed constraints were removed at a cost of increased noise exposure below 70 dB(A).     

Monitoring Aircraft Turnaround Operations – Framework Development,Application and Implications for Airline Operations

Abstract

A real-time operation monitoring system – Aircraft Turnaround Monitoring System – is developed based on a system framework to monitor aircraft turnaround operations at an airport. Mobile computing devices (PDAs) and wireless network technology General Packet Radio Service (GPRS) are used to implement the real-time monitoring system for an airline. System implementation and test results indicate that real-time operation monitoring can potentially reduce delays occurring from airline operations. Proactive measures can be taken immediately by ground handling staff to reduce delays, once the risk of delays and potential delay propagation is identified. The availability of detailed operating data can help airlines identify the root delay causes from complex connections among aircraft, flight/cabin crew and passengers. In addition, these operating data also shed some light on the future development of aircraft routing algorithms in order to consider explicitly stochastic disruptions and delay propagation in airline schedule planning.     

Optimal assignment for check-in counters based on passenger arrival behaviour at an airport

Establishing how to utilize check-in counters at airport passenger terminals efficiently is a major concern facing airport operators and airlines. Inadequate terminal capacity and the inefficient utilization of facilities such as check-in counters are major factors causing congestion and delays at airport passenger terminals. However, such delays and congestion can be reduced by increasing the efficiency of check-in counter operations, based on an understanding of passengers' airport access behaviour. This paper presents an assignment model for check-in counter operations, based on passengers' airport arrival patterns. In setting up the model, passenger surveys are used to determine when passengers arrive at the airport terminals relative to their flight departure times. The model then uses passenger arrival distribution patterns to calculate the most appropriate number of check-in counters and the duration of time that each counter should be operated. This assignment model has been applied at the Seoul Gimpo International Airport in Korea. The model provides not only a practical system for the efficient operations of time-to-time check-in counter assignments, but also a valuable means of developing effective longer-term solutions to the problem of passenger terminal congestion and delays. It also offers airlines a means of operating check-in counters with greater cost effectiveness, thus leading to enhanced customer service.     

Airline flight scheduling for oligopolistic competition with direct flights and a point to point network

In this research, we consider a flight scheduling problem for oligopolistic competition with direct flights and a point to point network. In this type of market situation, passengers are sensitive to the departure time of a flight rather than the transfer time. The airline needs to carefully consider the departure times of their competitors when determining their own. Therefore, unlike past approaches which have only considered one departure time for a competitor's flight, a flight scheduling framework is developed which takes into consideration possible competitor departure times. The framework includes two dependent stages which are repeatedly solved during the solution process. In addition, an upper bound model is also designed to evaluate the solution quality. Numerical tests are performed using data for Taiwan's outlying island route which is characterized by the above market situation. Satisfactory results are obtained, showing the good performance of the framework. Copyright © 2017 John Wiley & Sons, Ltd.     

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.     

Flight and passenger delay assignment optimization strategies

This paper compares different optimization strategies for the minimization of flight and passenger delays at two levels: pre-tactical, with on-ground delay at origin, and tactical, with airborne delay close to the destination airport. The optimization model is based on the ground holding problem and uses various cost functions. The scenario considered takes place in a busy European airport and includes realistic values of traffic. A passenger assignment with connections at the hub is modeled. Statistical models are used for passenger and connecting passenger allocation, minimum time required for turnaround and tactical noise; whereas uncertainty is also introduced in the model for tactical noise. Performance of the various optimization processes is presented and compared to ration by schedule results.     

A multi-objective approach for Dynamic Airspace Sectorization using agent based and geometric models

A key limitation when accommodating the continuing air traffic growth is the fixed airspace structure including sector boundaries. The geometry of sectors has stayed relatively constant despite the fact that route structures and demand have changed dramatically over the past decade. Dynamic Airspace Sectorization is a concept where the airspace is redesigned dynamically to accommodate changing traffic demands. Various methods have been proposed to dynamically partition the airspace to accommodate the traffic growth while satisfying other sector constraints and efficiency metrics. However, these approaches suffer from several operational drawbacks, and their computational complexity increases fast as the airspace size and traffic volume increase. In this paper, we evaluate and identify the gaps in existing 3D sectorization methods, and propose an improved Agent Based Model (iABM) to address these gaps. We also propose three additional models using KD-Tree, Bisection and Voronoi Diagrams in 3D, to partition the airspace to satisfy the convexity constraint and reduce computational cost. We then augment these methods with a multi-objective optimization approach that uses four objectives: minimizing the variance of controller workload across the sectors, maximizing the average sector flight time, and minimizing the distance between sector boundaries and the traffic flow crossing points. Experimental results show that iABM has the best performance on workload balancing, but it is restrictive when it comes to the convexity constraint. Bisection- and Voronoi Diagram-based models perform worse than iABM on workload balancing but better on average sector flight time, and they can satisfy the convexity constraint. The KD-tree-based model has a lower computational cost, but with a poor performance on the given objectives.     

Predicting the operational acceptance of airborne flight reroute requests using data mining

For tools that generate more efficient flight routes or reroute advisories, it is important to ensure compatibility of automation and autonomy decisions with human objectives so as to ensure acceptability by the human operators. In this paper, the authors developed a proof of concept predictor of operational acceptability for route changes during a flight. Such a capability could have applications in automation tools that identify more efficient routes around airspace impacted by weather or congestion and that better meet airline preferences. The predictor is based on applying data mining techniques, including logistic regression, a decision tree, a support vector machine, a random forest and Adaptive Boost, to historical flight plan amendment data reported during operations and field experiments. Cross validation was used for model development, while nested cross validation was used to validate the models. The model found to have the best performance in predicting air traffic controller acceptance or rejection of a route change, using the available data from Fort Worth Air Traffic Control Center and its adjacent Centers, was the random forest, with an F-score of 0.77. This result indicates that the operational acceptance of reroute requests does indeed have some level of predictability, and that, with suitable data, models can be trained to predict the operational acceptability of reroute requests. Such models may ultimately be used to inform route selection by decision support tools, contributing to the development of increasingly autonomous systems that are capable of routing aircraft with less human input than is currently the case.     

An optimization model for a real-time flight scheduling problem

Although airlines plan aircraft routes and crew schedules in advance, perturbations occur everyday. As a result, flight schedules may become infeasible and would need to be updated. This Day of Operations Scheduling problem impacts the entire system of an airline as the decisions enforced are final. When perturbations are relatively small, the airline may be able to at least preserve the planned aircraft and crew itineraries. We propose a model that determines new flight schedules based on planned crew transfers, rest periods, passenger connections, and maintenance. Its dual is shown to be a network model, hence solvable in a real-time environment. In addition, it can be used in more sophisticated operational and planning systems.     

Dynamic airspace sectorisation for flight-centric operations

Today’s air traffic operations follow the paradigm of ‘flow follows structure’, which already limits the operational efficiency and punctuality of current air traffic movements. Therefore, we introduce the dynamic airspace sectorisation and consequently change this paradigm to the more appropriate approach of ‘structure follows flow’. The dynamic airspace sectorisation allows an efficient allocation of scarce resources considering operational, economic and ecological constraints in both nominal and variable air traffic conditions. Our approach clusters traffic patterns and uses evolutionary algorithms for optimisation of the airspace, focusing on high capacity utilisation through flexible use of airspace, appropriate distribution of task load for air traffic controllers and fast adaptation to changed operational constraints. We thereby offer a solution for handling non-convex airspace boundaries and provide a proof of concept using current operational airspace structures and enabling a flight-centric air traffic management. We are confident that our developed dynamic airspace sectorisation significantly contributes to the challenges of future airspace by providing appropriate structures for future 4D aircraft trajectories taking into account various operational aspects of air traffic such as temporally restricted areas, limited capacities, zones of convective weather or urban air mobility. Dynamic sectorisation is a key enabling technology in the achievement of the ambitious goals of Single European Sky and Flightpath 2050 through a reduction in coordination efforts, efficient resource allocation, reduced aircraft emissions, fewer detours, and minimisation of air traffic delays.     

Surrounding traffic complexity analysis for efficient and stable conflict resolution

The constant increase in air traffic demand increases a probability of the separation minima infringements in certain areas as a consequence of increased traffic density. The Annual Safety Report 2016 reports that in recent years the number of infringements, measured per million flight hours, had been increased at a lower rate (Eurocontrol, 2018). However, this level of infringements still generates a continuous pressure on the air traffic control (ATC) system and seeks for more control resources ready to tactically solve potential conflicts, while increasing at the same time the operational costs. Considering present air traffic management (ATM) trade-off criteria: increased airspace capacity and traffic efficiency but reducing the cost while preserving safety, new services must be designed to distribute the separation management ATC task loads among other actors. Based on the Single European Sky Air Traffic Management Research and Next Generation Air Transportation System initiatives, this paper proposes an innovative separation management service to shift the completely centralized tactical ATC interventions to more efficient decentralized tactical operations relying on an advanced surrounding traffic analysis tool, to preserve the safety indicators while considering the operational efficiency. A developed methodology for the proposed service is an application-oriented, trying to respond to characteristics and requirements of the current operational environment. The paper further analysis the traffic complexity taking into consideration the so-called domino effect, i.e. a number of the surrounding aircraft causally involved in the separation management service by the means of identification of the spatiotemporal interdependencies between them and the conflicting aircraft. This complexity is driven by the interdependencies structure and expressed as a time-criticality in quantifying the total number of the system solutions, that varies over time as the aircraft are approaching to each other. The results from two randomly selected ecosystem scenarios, extracted from a simulated traffic, illustrate different avoidance capacities for a given look-ahead time and the system solutions counts, that in discrete moments reach zero value.     

Estimation of aircraft taxi fuel burn using flight data recorder archives

This paper builds a model for estimating the fuel consumption of a taxiing aircraft using flight data recorder information from operational aircraft. The taxi fuel burn is modeled as a linear function of several potential explanatory variables including the taxi time, number of stops, number of turns and number of acceleration events, and the coefficients are estimated using least-squares regression. The statistical significance of each potential factor is investigated. Our analysis shows that in addition to the taxi time, the number of acceleration events is a significant factor in determining taxi fuel consumption. Since the model parameters are estimated using data from operational aircraft, they provide more accurate estimates of fuel burn than methods that use idealized physical models of fuel consumption based on aircraft velocity profiles, or the baseline fuel consumption estimates provided by the International Civil Aviation Organization.     

A reverse causal-effect modeling approach for signal control of an oversaturated intersection

A novel approach is presented in which signalized intersections are treated as normal highway bottlenecks for improved computational efficiency. It is unique in two ways. First, it treats the signalized intersections as common freeway bottlenecks by a reversed cause and effect modeling approach. Both traffic arrivals and departures are modeled by smooth continuous functions of time as if there were no interruptions to traffic flows from signals. The use of smooth continuous functions for departure curves instead of commonly used step functions makes it easy to apply differential calculus in optimization and future extension to a system of intersections. Second, a dynamic linear programming (LP) model is then developed to maximize the total vehicular output from the intersection during the entire period of congestion subject to prevailing capacity and other operational constraints. The continuous optimal departure flow rate (the effect) is then converted to signal timing parameters (the cause) that can be readily implemented. Two numerical examples are presented to demonstrate the properties of the proposed algorithm and examine its performance.