Optimisation de la gestion des avions dans un aéroport : affectation aux points de stationnement, routage au sol et ordonnancement à la piste.

摘要

In this thesis, we address the optimization of aircraft ground operations at airports, focusing on three main optimization problems: the stand allocation, the ground routing between stands and runways, and the sequencing of take-offs and landings.These works result from a close collaboration with Amadeus. Our approaches have been tested and validated with real data from European airports.The stand allocation problem is formulated as a Mixed Integer Program (MIP). We show that finding an allocation plan respecting operational requirements is NP-Complete and we strengthen our model in several directions. We obtain better solutions than the literature withing reasonable computation times for an industrial application.The ground routing problem is modeled by a MIP formulation adapted from the literature. We show that the main indicators of the industry are in contradiction with the objective of reducing taxi times and therefore air pollution. We propose new indicators based on take-off times instead of push back times.Lastly, we focus on the integration of the runway sequencing with the ground routing. We highlight that a better integration allows to reduce taxi times while improving the management of the runway. We propose a sequential heuristic based on an innovative MIP formulation of the runway sequencing problem. This heuristic is shown to provide high quality solutions in reasonable computation times, unlike the exact approach from the literature.