Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 529-557 |
| Number of pages | 29 |
| Journal | Journal of Global Optimization |
| Volume | 81 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Oct 2021 |
Keywords
- Air traffic management
- Bilevel programming
- Cutting plane
- Deconfliction
- Mathematical programming
Fingerprint
Dive into the research topics of 'Detecting and solving aircraft conflicts using bilevel programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver