Skip to Main content Skip to Navigation
Journal articles

Optimization of departure runway scheduling incorporating arrival crossings

Abstract : The runway is a key airport resource and an efficient runway operation is critical to enhance the airport efficiency and to reduce delays. This paper addresses the problem of scheduling aircraft departures incorporating arrival crossings. Constraints for wake turbulence separations, flight time window restrictions, and holding queue capacity at runway threshold are explicitly considered. We present two Integer Linear Programming (ILP) models and a simulated annealing (SA) algorithm. Comparison tests are conducted for the south side of Paris Charles De Gaulle Airport and show that the three proposed methods can significantly improve the solutions based on the simple first-come-first-served rule. Moreover, SA has sufficiently small computation time for real-time deployment.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-02064458
Contributor : Laurence Porte <>
Submitted on : Tuesday, March 26, 2019 - 4:20:57 PM
Last modification on : Wednesday, March 27, 2019 - 1:11:58 AM
Document(s) archivé(s) le : Thursday, June 27, 2019 - 12:32:30 PM

File

ITOR_MaSbihiDelahaye.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Ji Ma, Mohammed Sbihi, Daniel Delahaye. Optimization of departure runway scheduling incorporating arrival crossings. International Transactions in Operational Research, Wiley, In press, ⟨10.1111/itor.12657⟩. ⟨hal-02064458⟩

Share

Metrics

Record views

118

Files downloads

72