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.     

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.     

Heuristic approach to the airline schedule disturbances problem

Abstract

When disturbances make it impossible to realise the planned flight schedule, the dispatcher at the airline operational centre defines a new flight schedule based on airline policy, in order to reduce the negative effects of these perturbations. Depending on airline policy, when designing the new flight schedule, the dispatcher delays or cancels some flights and reassigns some flights to available aircraft. In this paper, a decision support system (DSS) for solving the airline schedule disturbances problem is developed aiming to assist decision makers in handling disturbances in real-time. The system is based on a heuristic algorithm, which generates a list of different feasible schedules ordered according to the value of an objective function. The dispatcher can thus select and implement one of them. In this paper, the possibilities of DSS are illustrated by real numerical examples that concern JAT Airways' flight schedule disturbances.     

Future electricity demand from battery‐powered vehicles

An important decision faced by airline schedulers is how to adapt the flight schedule and aircraft assignment to unforeseen perturbations in an established schedule. In the face of unforeseen aircraft delays, schedulers have to decide which flights to delay, and when delays become excessive, which to cancel. Current scheduling models deal with simple decision problems of delay or cancellation, but not with both simultaneously. But in practice the optimal decision may involve results from the integration of both flight cancellations and delays. In Part I of this paper, a quadratic programming model for the integration decision problem is given. The model can formulate the integration of flight cancellations and delays as well as some special cases, such as the ferrying of surplus aircraft and the possibility of swapping different types of aircraft. In this paper, based on the special structure of the model, an effective algorithm is presented, sufficient computational experiments are conducted and some results are reported. These show that we can expect to obtain a sufficiently good solution in terms of reasonable CPU time.     

Coordinated scheduling models for allied airlines

Recently, as a means of forming global networks and improving operation efficiency, major air carriers have increasingly entered into alliances with other carriers. Fleet routing and flight scheduling are not only important in individual airline operations, but also affect the alliances. The setting of a good flight schedule can not only enhance allied airline operating performance, but can also be a useful reference for alliance decision-making. In this research, we develop several coordinated scheduling models, which will help the allied airlines solve for the most satisfactory fleet routes and timetables under the alliance. We employ network flow techniques to construct the models. The models are formulated as multiple commodity network flow problems which can be solved using a mathematical programming solver. Finally, to evaluate the models, we perform a case study based on real operating data from two Taiwan airlines. The preliminary results are good, showing that the models could be useful for airline alliances.     

Integrated airline planning: Robust update of scheduling and fleet balancing under demand uncertainty

The airline schedule planning problem is defined as the sequence of decisions that need to be made to obtain a fully operational flight schedule. Historically, the airline scheduling problem has been sequentially solved. However, there have already been many attempts in order to obtain airline schedules in an integrated way. But due to tractability issues it is nowadays impossible to determine a fully operative and optimal schedule with an integrated model which accounts for all the key airline related aspects such as competitive effects, stochastic demand figures and uncertain operating conditions. Airlines usually develop base schedules, which are obtained much time in advance to the day of operations and not accounting for all the related uncertainty. This paper proposes a mathematical model in order to update base schedules in terms of timetable and fleet assignments while considering stochastic demand figures and uncertain operating conditions, and where robust itineraries are introduced in order to ameliorate miss-connected passengers. The proposed model leads to a large-scale problem which is difficult to be solved. Therefore, a novel improved and accelerated Benders decomposition approach is proposed. The analytical work is supported with case studies involving the Spanish legacy airline, IBERIA. The presented approach shows that the number of miss-connected passengers may be reduced when robust planning is applied.     

A math-heuristic algorithm for the integrated air service recovery

A sophisticated flight schedule might be easily disrupted due to adverse weather, aircraft mechanical failures, crew absences, etc. Airlines incur huge costs stemming from such flight schedule disruptions in addition to the serious inconveniences experienced by passengers. Therefore, an efficient recovery solution that simultaneously decreases an airline's recovery cost while simultaneously mitigating passenger dissatisfaction is of great importance to the airline industry. In this paper, we study the integrated airline service recovery problem in which the aircraft and passenger schedule recovery problems are simultaneously addressed, with the objective of minimizing aircraft recovery and operating costs, passenger itinerary delay cost, and passenger itinerary cancellation cost.Recognizing the inherent difficulty in modeling the integrated airline service recovery problem within a single formulation (due to its huge solution space and quick response requirement), we propose a three-stage sequential math-heuristic framework to efficiently solve this problem, wherein the flight schedules and aircraft rotations are recovered in the first stage, Then, a flight rescheduling problem and passenger schedule recovery problems are iteratively solved in the next two stages. Time-space network flow representations, along with mixed-integer programming formulations, and algorithms that take advantages of the underlying problem structures, are proposed for each of three stages. This algorithm was tested on realistic data provided by the ROADEF 2009 challenge and the computational results reveal that our algorithm generated the best solution in nearly 72% of the test instances, and a near-optimal solution was achieved in the remaining instances within an acceptable timeframe. Furthermore, we also ran additional computational runs to explore the underlying characteristics of the proposed algorithm, and the recorded insights can serve as a useful guide during practical implementations of this algorithm.     

Anomaly detection via a Gaussian Mixture Model for flight operation and safety monitoring

Safety is key to civil aviation. To further improve its already respectable safety records, the airline industry is transitioning towards a proactive approach which anticipates and mitigates risks before incidents occur. This approach requires continuous monitoring and analysis of flight operations; however, modern aircraft systems have become increasingly complex to a degree that traditional analytical methods have reached their limits – the current methods in use can only detect ‘hazardous’ behaviors on a pre-defined list; they will miss important risks that are unlisted or unknown. This paper presents a novel approach to apply data mining in flight data analysis allowing airline safety experts to identify latent risks from daily operations without specifying what to look for in advance. In this approach, we apply a Gaussian Mixture Model (GMM) based clustering to digital flight data in order to detect flights with unusual data patterns. These flights may indicate an increased level of risks under the assumption that normal flights share common patterns, while anomalies do not. Safety experts can then review these flights in detail to identify risks, if any. Compared with other data-driven methods to monitor flight operations, this approach, referred to as ClusterAD-DataSample, can (1) better establish the norm by automatically recognizing multiple typical patterns of flight operations, and (2) pinpoint which part of a detected flight is abnormal. Evaluation of ClusterAD-DataSample was performed on two sets of A320 flight data of real-world airline operations; results showed that ClusterAD-DataSample was able to detect abnormal flights with elevated risks, which make it a promising tool for airline operators to identify early signs of safety degradation even if the criteria are unknown a priori.     

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.     

A heuristic model for frequency planning and aircraft routing in small size airlines

The flight schedule of an airline is the primary factor in finding the most effective and efficient deployment of the airline's resources. The flight schedule process aims at finding a set of routes with associated aircraft type, frequency of service and times of departures and arrivals in order to satisfy a specific objective such as profit maximization. In this paper, we develop a two‐phase heuristic model for airline frequency planning and aircraft routing for small size airlines. The first phase develops a frequency plan using an economic equilibrium model between passenger demand for flying a particular route and aircraft operating characteristics. The second phase uses a time‐of‐day model to develop an assignment algorithm for aircraft routing.     

Airline-driven ground delay programs: A benefits assessment

Three decades of research studies in ground delay program (GDP) decision-making, and air traffic flow management in general, have produced several analytical models and decision support tools to design GDPs with minimum delay costs. Most of these models are centralized, i.e., the central authority almost completely decides the GDP design by optimizing certain centralized objectives. In this paper, we assess the benefits of an airline-driven decentralized approach for designing GDPs. The motivation for an airline-driven approach is the ability to incorporate the inherent differences between airlines when prioritizing, and responding to, different GDP designs. Such differences arise from the airlines’ diverse business objectives and operational characteristics. We develop an integrated platform for simulating flight operations during GDPs, an airline recovery module for mimicking the recovery actions of each individual airline under a GDP, and an algorithm for fast solution of the recovery problems to optimality. While some of the individual analytical components of our framework, model and algorithm share certain similarities with those used by previous researchers, to the best of our knowledge, this paper presents the first comprehensive platform for simulating and optimizing airline operations under a GDP and is the most important technological contribution of this paper. Using this framework, we conduct detailed computational experiments based on actual schedule data at three of the busiest airports in the United States. We choose the recently developed Majority Judgment voting and grading method as our airline-driven decentralized approach for GDP design because of the superior theoretical and practical benefits afforded by this approach as shown by multiple recent studies. The results of our evaluation suggest that adopting this airline-driven approach in designing the GDPs consistently and significantly reduces airport-wide delay costs compared to the state-of-the-research centralized approaches. Moreover, the cost reduction benefits of the resultant airline-driven GDP designs are equitably distributed across different airlines.     

Performance assessment of transport services with the ERM-NDEA model: evidence from a domestic airline in Taiwan

Abstract

This paper estimates comprehensive operational performance measures for transport services. A network efficiency approach is used to analyze the production efficiency, service efficiency, and operational efficiency in a unified framework to reflect the transportation service characteristics of airline operations. We show how a modified version of the network data envelopment analysis model can be utilized for evaluating the performance of air route operations. This study considers 15 air routes operated by a domestic airline in Taiwan to highlight the value of the approach. The results of the analysis show the inputs and consumed outputs leading to production inefficiency and service inefficiency respectively as well as the magnitudes of excesses and shortfalls.     

An optimization model for aircraft maintenance scheduling and re-assignment

The aircraft maintenance scheduling is one among the major decisions an airline has to make during its operation. Though maintenance scheduling comes as an end stage in an airline operation, it has potential for cost savings. Maintenance scheduling is an easily understood but difficult to solve problem. Given a flight schedule with aircraft assigned to it, the aircraft maintenance-scheduling problem is to determine which aircraft should fly which segment and when and where each aircraft should undergo different levels of maintenance check required by the Federal Aviation Administration. The objective is to minimize the maintenance cost and any costs incurred during the re-assignment of aircraft to the flight segments.This paper provides a complete formulation for maintenance scheduling and a heuristic approach to solve the problem. The heuristic procedure provides good solutions in reasonable computation time. This model can be used by mid-sized airline corporations to optimize their maintenance costs.     

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.     

A probabilistic framework for weather-based rerouting and delay estimations within an Airspace Planning model

In this paper, we develop a novel severe weather-modeling paradigm to be applied within the context of a large-scale Airspace Planning and collaborative decision-making model in order to reroute flights with respect to a specified probability threshold of encountering severe weather, subject to collision safety, airline equity, and sector workload considerations. This approach serves as an alternative to the current practice adopted by the Federal Aviation Administration (FAA) of adjusting flight routes in accordance with the guidelines specified in the National Playbook. Our innovative contributions in this paper include (a) the concept of “Probability-Nets” and the development of discretized representations of various weather phenomena that affect aviation operations; (b) the integration of readily accessible severe weather probabilities from existing weather forecast data provided by the National Weather Service; (c) the generation of flight plans that circumvent severe weather phenomena with specified probability threshold levels, and (d) a probabilistic delay assessment methodology for evaluating planned flight routes that might encounter potentially disruptive weather along its trajectory. Additionally, we conduct an economic benefit analysis using a k-means clustering mechanism in concert with our delay assessment methodology in order to evaluate delay costs and system disruptions associated with variations in probability-net refinement-based information. Computational results and insights are presented based on flight test cases derived from the Enhanced Traffic Management System data provided by the FAA and using weather scenarios derived from the Model Output Statistics forecast data provided by the National Weather Service.     

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%.     

A graph-theoretic method to quantify the airline route authority

A U.S. certificated passenger airline must be authorized by the Civil Aeronautics Board before it can schedule a route to serve a set of cities. The route authority is described in a number of legal statements on a Route Certificate, which specifies the routing restrictions by which the airline must abide in offering the service. For cost considerations, an airline is often interested in the shortest flight-time routes between city pairs. This paper introduces a graph-theoretic method to quantify the legal statements in a Certificate. Through straightforward matrix operations, all the authorized nonstop and multistop routes, including the shortest time routes, can be generated. The method is a convenient tool to help an airline to generate alternative network routes as demonstrated by a case study of American Airlines.     

Simulation-based assessment methodology to improve ground service operations at a hub airport

ABSTRACT

Airport terminals are dynamic environments and security/passport services generally constitute costly bottlenecks in terminals. Increases in the number of airline passengers compels airport terminals to provide more efficient services to its customers under space and resource limitations. This study examines the level of service of passenger processes at Istanbul Atatürk Airport by constructing a comprehensive simulation model. It focuses mainly on passport control services and passenger transfer security services because of the airport's hub status and the strategy of Turkish Airlines. The increasing number of transfer passengers may cause disruptions in departure flight schedules due to slow passenger processes. After validating the model, we investigate the consequences of three main alternative solutions, including 17 sub-scenarios, to capture target quality levels. Finally, we provide the results for each scenario to investigate the optimum allocation of resources to terminal operations.     

Fueling for contingencies: The hidden cost of unpredictability in the air transportation system

The aviation community is increasing its attention on the concept of predictability when conducting aviation service quality assessments. Reduced fuel consumption and the related cost is one of the various benefits that could be achieved through improved flight predictability. A lack of predictability may cause airline dispatchers to load more fuel onto aircraft before they depart; the flights would then in turn consume extra fuel just to carry excess fuel loaded. In this study, we employ a large dataset with flight-level fuel loading and consumption information from a major US airline. With these data, we estimate the relationship between the amount of loaded fuel and flight predictability performance using a statistical model. The impact of loaded fuel is translated into fuel consumption and, ultimately, fuel cost and environmental impact for US domestic operations. We find that a one-minute increase in the standard deviation of airborne time leads to a 0.88 min increase in loaded contingency fuel and 1.66 min in loaded contingency and alternate fuel. If there were no unpredictability in the aviation system, captured in our model by eliminating standard deviation in flight time, the reduction in the loaded fuel would between 6.12 and 11.28 min per flight. Given a range of fuel prices, this ultimately would translate into cost savings for US domestic airlines on the order of $120–$452 million per year.     

A hybrid optimization-simulation approach for robust weekly aircraft routing and retiming

We address the robust weekly aircraft routing and retiming problem, which requires determining weekly schedules for a heterogeneous fleet that maximizes the aircraft on-time performance, minimizes the total delay, and minimizes the number of delayed passengers. The fleet is required to serve a set of flights having known departure time windows while satisfying maintenance constraints. All flights are subject to random delays that may propagate through the network. We propose to solve this problem using a hybrid optimization-simulation approach based on a novel mixed-integer nonlinear programming model for the robust weekly aircraft maintenance routing problem. For this model, we provide an equivalent mixed-integer linear programming formulation that can be solved using a commercial solver. Furthermore, we describe a Monte-Carlo-based procedure for sequentially adjusting the flight departure times. We perform an extensive computational study using instances obtained from a major international airline, having up to 3387 flights and 164 aircraft, which demonstrates the efficacy of the proposed approach. Using the simulation software SimAir to assess the robustness of the solutions produced by our approach in comparison with that for the original solutions implemented by the airline, we found that on-time performance was improved by 9.8–16.0%, cumulative delay was reduced by 25.4–33.1%, and the number of delayed passengers was reduced by 8.2–51.6%.