Abstract Runways are typically identified as the primary bottleneck of the airport operations system that causes delays. Hence, operational efficiency of runways constitutes a critical factor for the overall air transportation system. Multiple Runway Aircraft Scheduling Problem involves assigning both landing and taking-off aircraft to runways, sequencing them on each runway and assigning each aircraft a landing or take-off time while considering predetermined time windows for each aircraft to land or take-off. Also, sequence-dependent separation times between each aircraft pair in the sequence need to be taken into account in order to avoid wake vortex (turbulence) effects which can pose a hazard caused by preceding aircraft. Several variations of this combinatorial optimization problem are researched extensively in the past decades and a wide variety of algorithms have been proposed for small-scale problems. However, from a practical point of view large-scale real-life problems require fast response times and remain challenging computationally. This chapter aims to present a Tabu Search (TS) algorithm for the static (offline) case of the problem, where all information of aircraft is known in advance. Also, computational results for the proposed algorithm are presented for a number of benchmark instances obtained from literature.
A Tabu Search Algorithm for the Multiple Runway Aircraft Scheduling Problem
1st ed. 2016
01.01.2016
22 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Carrier-based aircraft support operation scheduling based on improved tabu search algorithm
DOAJ | 2018
|A memetic algorithm to solve the dynamic multiple runway aircraft landing problem
DOAJ | 2016
|Tabu Search Algorithm for the Railroad Blocking Problem
Online Contents | 2013
|An optimal algorithm for a two runway scheduling problem
Online Contents | 2013
|