The aircraft runway scheduling problem: A survey

Sana Ikli (1) , Catherine Mancel (1) , Marcel Mongeau (1) , Xavier Olive (2) , Emmanuel Rachelson (3)

1 ENAC - Ecole Nationale de l'Aviation Civile
2 ONERA / DTIS, Université de Toulouse [Toulouse]
3 DMIA - Département de Mathématiques, Informatique, Automatique

The aircraft scheduling problem consists in sequencing aircraft on airport runways and in scheduling their times of operations taking into consideration several operational constraints. It is known to be an NP-hard problem, an ongoing challenge for both researchers and air traffic controllers. The aim of this paper is to present a focused review on the most relevant techniques in the recent literature (since 2010) on the aircraft runway scheduling problem, including exact approaches such as mixed-integer programming and dynamic programming, metaheuristics, and novel approaches based on reinforcement learning. Since the benchmark instances used in the literature are easily solved by high-performance computers and current versions of solvers, we propose a new data set with challenging realistic problems constructed from real-world air traffic.

Mots clés: Runway scheduling problem; Aircraft landing problem; Aircraft take-off problem; Mixed-integer optimization; Metaheuristics; Survey

Domaines: Optimisation et contrôle [math.OC]

Sana Ikli, Catherine Mancel, Marcel Mongeau, Xavier Olive, Emmanuel Rachelson. The aircraft runway scheduling problem: A survey. Computers and Operations Research, 2021, Volume 132, August 2021, pp.105336. ⟨10.1016/j.cor.2021.105336⟩. ⟨hal-03204701⟩