Detecting and solving aircraft conflicts using bilevel programming

We present two bilevel programming formulations for the aircraft deconfliction problem: one based on speed regulation in k dimensions, the other on heading angle changes in 2 dimensions. We propose three reformulations of each problem based on KKT conditions and on two different duals of the lower-l...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 81; no. 2; pp. 529 - 557
Main Authors Cerulli, Martina, D’Ambrosio, Claudia, Liberti, Leo, Pelegrín, Mercedes
Format Journal Article
LanguageEnglish
Published New York Springer US 01.10.2021
Springer
Springer Nature B.V
Springer Verlag
Subjects
Air traffic controllers
Aircraft
Aircraft detection
Algorithms
Computer Science
Hierarchies
Mathematics
Mathematics and Statistics
Operations Research
Operations Research/Decision Theory
Optimization
Real Functions
Bilevel programming
Cutting plane
Deconfliction
Air traffic management
Mathematical programming
deconfliction
Air Traffic Management
cutting plane
bilevel programming
mathematical programming
Online AccessGet full text

Cover

More Information
Summary:We present two bilevel programming formulations for the aircraft deconfliction problem: one based on speed regulation in k dimensions, the other on heading angle changes in 2 dimensions. We propose three reformulations of each problem based on KKT conditions and on two different duals of the lower-level subproblems. We also propose a cut generation algorithm to solve the bilevel formulations. Finally, we present computational results on a variety of instances.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-021-00997-1