Abstract

International audience; Preventing aircraft from getting too close to each other is an essential element of safety of the air transportation industry, which becomes ever more important as the air traffic increases. The problem consists in enforcing a minimum distance threshold between flying aircraft, which naturally results in a bilevel formulation with a lower-level subproblem for each pair of aircraft. We propose two single-level reformulations, present a cut generation algorithm which directly solves the bilevel formulation and discuss comparative computational results.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1007/978-3-030-34960-8_18 under the license http://www.springer.com/tdm
https://hal.archives-ouvertes.fr/hal-02869682/document,
https://hal.archives-ouvertes.fr/hal-02869682/file/Aircraft-bilevel-ods19.pdf
https://academic.microsoft.com/#/detail/3002003843
Back to Top

Document information

Published on 01/01/2020

Volume 2020, 2020
DOI: 10.1007/978-3-030-34960-8_18
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?