One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.
Real-time adaptive aircraft scheduling
1990-06-01
Report
No indication
English
Real time genetic scheduling of aircraft landing times
Tema Archive | 1998
|Scheduling of Time-Shared Jet Aircraft
Online Contents | 1998
|Real-time scheduling of aircraft arrivals and departures in a terminal maneuvering area
Tema Archive | 2015
|Scheduling of Time-Shared Jet Aircraft
British Library Online Contents | 1998
|