Optimal location of dynamic military areas within civil aviation traffic
Résumé
In this study, we focus on the problem of locating optimally dynamic military areas with the aim of minimizing the number of civil flight trajectories potentially impacted by the military activity, and the distance between the military area and the military base. We model the military areas by 2D geometry shapes with a vertical extension associated to given flight levels during the temporary area-activation time window. We propose a mathematical formulation of this problem as a constrained-optimization problem. We then introduce a global-optimization methodology based on a simulated annealing algorithm featuring tailored neighborhood-search strategies and an astute computational evaluation of the otherwise costly objective function. This is applied to one day of French traffic involving 8,836 civil flights. The results show that the proposed method is efficient to locate the military area that is nearest from the military base, while minimizing the potential impact on civil flight trajectories.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...