Skip to Main content Skip to Navigation
Journal articles

The aircraft runway scheduling problem: A survey

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-enac.archives-ouvertes.fr/hal-03204701
Contributor : Laurence Porte <>
Submitted on : Wednesday, April 21, 2021 - 5:23:09 PM
Last modification on : Sunday, May 16, 2021 - 5:51:36 PM
Long-term archiving on: : Thursday, July 22, 2021 - 7:27:48 PM

File

rsp_survey_author_version.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

97

Files downloads

114