Detecting and solving aircraft conflicts using bilevel programming
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...