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.
A Heuristic Algorithm for the Allocation of Airport Runway System Capacity
Transportation Planning and Technology ; 30 , 5 ; 501-520
2007-10-01
20 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
A Heuristic Algorithm for the Allocation of Airport Runway System Capacity
Online Contents | 2007
|Issues in Airport Runway Capacity Charging and Allocation
Online Contents | 2008
|Capacity Planning for Airport Runway Systems
British Library Conference Proceedings | 2019
|SAE Technical Papers | 2016
SAE Technical Papers | 2023