Crossing Waypoint Optimization in Free Route Airspace
Résumé
With the imminent growth in air travel, ensuring the
efficiency of airspace has become a necessity. This work addresses
this specific concern, namely, the optimization of a Free Route
Airspace (FRA). The FRA is a relatively recent concept applied
into the european airspace. Even though this approach has the
advantage of having the direct routing between origin and destination, there are still aspects that can be improved, regarding
conflict handling and air traffic controllers’ workload. To face this
problem, we study the incorporation of Crossing Waypoints (CWs)
into the FRA. These CWs will cluster the locations of conflicts,
facilitating the controller’s task. However, identifying their best
locations and connections poses a challenge. Along this research,
the problem of finding the optimal topology will be modeled in
order to minimize potential conflicts between flights, reduce the
workload on controllers, and decrease airlines’ costs. This will
lead to a multi-objective optimization problem, involving a balance
between safety and fuel consumption. To find a solution to this
issue, meta-heuristics algorithms were employed and compared
(Particle Swarm Optimization, Simulated Annealing and Tabu
Search). Initially the model will be validated in simple cases in
order to compare the use of direct routing and the CW approach.
Then the procedure is evaluated in a case-study of sector LFEEKF
in Reims. Finally, we present a comparison between the algorithms
to evaluate their individual performances.
Origine | Fichiers produits par l'(les) auteur(s) |
---|