Optimisation des procédures de départ et d'arrivée dans une zone terminale

Abstract : This thesis proposes a methodology for the optimization of departure and arrival routes in the Terminal Maneuvering Area (TMA). The design of these routes takes into account the configuration and environment around airports, and the related constraints, in particular the avoidance of obstacles and the separation between routes. We propose a mathematical formulation leading to a combinatorial optimization problem, as well as efficient ad hoc resolution methods for the problem. The problem is solved in two steps. First, we design an individual route avoiding obstacles with respect to minimum route length by using a Branch and Bound (B&B) method. Afterwards, the design of multiple routes is solved by two different approaches: a B&B-based approach (where routes are generated sequentially in a given order) and a Simulated Annealing approach (where routes are generated simultaneously). The simulation results of a set of (artificial and real) test problems show the efficiency of our approach.
Document type :
Liste complète des métadonnées

Cited literature [91 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Friday, May 25, 2018 - 9:57:06 AM
Last modification on : Tuesday, January 29, 2019 - 1:20:02 PM
Document(s) archivé(s) le : Sunday, August 26, 2018 - 12:56:41 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01518129, version 2



Jun Zhou. Optimisation des procédures de départ et d'arrivée dans une zone terminale. Mathématiques générales [math.GM]. Université Paul Sabatier - Toulouse III, 2017. Français. ⟨NNT : 2017TOU30033⟩. ⟨tel-01518129v2⟩



Record views


Files downloads