Airspace congestion smoothing by stochastic optimization
Résumé
This paper addresses the general time-route assignment problem: One considers an air transportation network and a fleet of aircraft with their associated route and slot of departure. For each flight a set of alternative routes and a set of possible slots of departure are defined. One must find optimal route and slot allocation for each aircraft in a way that significantly reduces the peak of workload in the most congested sectors and in the most congested airports, during one day of traffic.
Origine : Fichiers produits par l'(les) auteur(s)