Scheduling aircraft landings - the static case

This is the publisher version of the article, obtained from the link below.In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and that separation criteria between the landing of a plane and the landing of all successive planes are respected. We present a mixed-integer zero–one formulation of the problem for the single runway case and extend it to the multiple runway case. We strengthen the linear programming relaxations of these formulations by introducing additional constraints. Throughout, we discuss how our formulations can be used to model a number of issues (choice of objective function, precedence restrictions, restricting the number of landings in a given time period, runway workload balancing) commonly encountered in practice. The problem is solved optimally using linear programming-based tree search. We also present an effective heuristic algorithm for the problem. Computational results for both the heuristic and the optimal algorithm are presented for a number of test problems involving up to 50 planes and four runways.J.E.Beasley. would like to acknowledge the financial support of the Commonwealth Scientific and Industrial Research Organization, Australia

Applications of stochastic modeling in air traffic management : Methods, challenges and opportunities for solving air traffic problems under uncertainty

In this paper we provide a wide-ranging review of the literature on stochastic modeling applications within aviation, with a particular focus on problems involving demand and capacity management and the mitigation of air traffic congestion. From an operations research perspective, the main techniques of interest include analytical queueing theory, stochastic optimal control, robust optimization and stochastic integer programming. Applications of these techniques include the prediction of operational delays at airports, pre-tactical control of aircraft departure times, dynamic control and allocation of scarce airport resources and various others. We provide a critical review of recent developments in the literature and identify promising research opportunities for stochastic modelers within air traffic management

Receding horizon control for aircraft arrival sequencing and scheduling.

Airports, especially busy hub airports, proved to be the bottleneck resources in the air traffic control system. How to carry out arrival scheduling and sequencing effectively and efficiently is one of main concerns to improve the safety, capacity, and efficiency of the airports. This paper introduces the concept of receding horizon control (RHC) to the problem of arrival scheduling and sequencing in a dynamic environment. The potential benefits RHC could bring in terms of airborne delay and computational burden are investigated by means of Monte Carlo simulations. It is pointed out that while achieving similar performance as existing schemes, the new arrival scheduling and sequencing scheme significantly reduces the computational burden and provides potential for developing new optimization algorithms for further reducing airborne delay

Approximate Algorithms for the Combined arrival-Departure Aircraft Sequencing and Reactive Scheduling Problems on Multiple Runways

The problem addressed in this dissertation is the Aircraft Sequencing Problem (ASP) in which a schedule must be developed to determine the assignment of each aircraft to a runway, the appropriate sequence of aircraft on each runway, and their departing or landing times. The dissertation examines the ASP over multiple runways, under mixed mode operations with the objective of minimizing the total weighted tardiness of aircraft landings and departures simultaneously. To prevent the dangers associated with wake-vortex effects, separation times enforced by Aviation Administrations (e.g., FAA) are considered, adding another level of complexity given that such times are sequence-dependent. Due to the problem being NP-hard, it is computationally difficult to solve large scale instances in a reasonable amount of time. Therefore, three greedy algorithms, namely the Adapted Apparent Tardiness Cost with Separation and Ready Times (AATCSR), the Earliest Ready Time (ERT) and the Fast Priority Index (FPI) are proposed. Moreover, metaheuristics including Simulated Annealing (SA) and the Metaheuristic for Randomized Priority Search (Meta-RaPS) are introduced to improve solutions initially constructed by the proposed greedy algorithms. The performance (solution quality and computational time) of the various algorithms is compared to the optimal solutions and to each other. The dissertation also addresses the Aircraft Reactive Scheduling Problem (ARSP) as air traffic systems frequently encounter various disruptions due to unexpected events such as inclement weather, aircraft failures or personnel shortages rendering the initial plan suboptimal or even obsolete in some cases. This research considers disruptions including the arrival of new aircraft, flight cancellations and aircraft delays. ARSP is formulated as a multi-objective optimization problem in which both the schedule\u27s quality and stability are of interest. The objectives consist of the total weighted start times (solution quality), total weighted start time deviation, and total weighted runway deviation (instability measures). Repair and complete regeneration approximate algorithms are developed for each type of disruptive events. The algorithms are tested against difficult benchmark problems and the solutions are compared to optimal solutions in terms of solution quality, schedule stability and computational time

Development of control systems for space shuttle vehicles, volume 1

Control of winged two-stage space shuttle vehicles was investigated. Control requirements were determined and systems capable of meeting these requirements were synthesized. Control requirements unique to shuttles were identified. It is shown that these requirements can be satisfied by conventional control logics. Linear gain schedule controllers predominate. Actuator saturations require nonlinear compensation in some of the control systems

On the waiting time of arriving aircrafts and the capacity of airports with one or two runways

In this paper we examine a model for the landing procedure of aircrafts at an airport. The characteristic feature here is that due to air turbulence the safety distance between two landing aircrafts depends on the types of these two machines. Hence, an eficient routing of the aircraft to two runways may reduce their waiting time. First, we use M/SM/1 queues (with dependent service times) to model a single runway. We give the stability condition and a formula for the average waiting time of the aircrafts. Moreover, we derive easy to compute bounds on the waiting times by comparison to simpler queuing systems. In particular we study the effect of neglecting the dependency of the service times when using M/G/1-models. We then consider the case of two runways with a number of heuristic routing strategies such as coin flipping, type splitting, Round Robin and variants of the join-the-least-load rule. These strategies are analyzed and compared numerically with respect to the average delay they cause. It turns out that a certain modication of join-the-least-load gives the best results

Stochastic Modelling of Aircraft Queues: A Review

In this paper we consider the modelling and optimal control of queues of aircraft waiting to use the runway(s) at airports, and present a review of the related literature. We discuss the formulation of aircraft queues as nonstationary queueing systems and examine the common assumptions made in the literature regarding the random distributions for inter-arrival and service times. These depend on various operational factors, including the expected level of precision in meeting pre-scheduled operation times and the inherent uncertainty in airport capacity due to weather and wind variations. We also discuss strategic and tactical methods for managing congestion at airports, including the use of slot controls, ground holding programs, runway configuration changes and aircraft sequencing policies

Decentralized aircraft landing scheduling at single runway non-controlled airports

The existing air transportation system is approaching a bottleneck because its dominant huband- spoke model results in a concentration of a large percentage of the air traffic at a few hub airports. Advanced technologies are greatly needed to enhance the transportation capabilities of the small airports in the U.S.A., and distribute the high volume of air traffic at the hub airports to those small airports, which are mostly non-controlled airports. Currently, two major focus areas of research are being pursued to achieve this objective. One focus concentrates on the development of tools to improve operations in the current Air Traffic Management system. A more long-term research effort focuses on the development of decentralized Air Traffic Management techniques. This dissertation takes the latter approach and seeks to analyze the degree of decentralization for scheduling aircraft landings in the dynamic operational environment at single runway noncontrolled airports. Moreover, it explores the feasibility and capability of scheduling aircraft landings within uninterrupted free-flight environment in which there is no existence of Air Traffic Control (ATC). First, it addresses the approach of developing static optimization algorithms for scheduling aircraft landings and, thus, analyzes the capability of automated aircraft landing scheduling at single runway non-controlled airports. Then, it provides detailed description of the implementation of a distributed Air Traffic Management (ATM) system that achieves decentralized aircraft landing scheduling with acceptable performance whereas a solution to the distributed coordination issues is presented. Finally real-time Monte Carlo flight simulations of multi-aircraft landing scenarios are conducted to evaluate the static and dynamic performance of the aircraft landing scheduling algorithms and operation concepts introduced. Results presented in the dissertation demonstrate that decentralized aircraft landing scheduling at single runway non-controlled airports can be achieved. It is shown from the flight simulations that reasonable performance of decentralized aircraft landing scheduling is achieved with successful integration of publisher/subscriber communication scheme and aircraft landing scheduling model. The extension from the non-controlled airport application to controlled airport case is expected with suitable amendment, where the reliance on centralized air traffic management can be reduced gradually in favor of a decentralized management to provide more airspace capacity, flight flexibility, and increase operation robustness

Runway operations scheduling using airline preferences

Koole, G.M. [Promotor