Abstract : 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.
https://hal-enac.archives-ouvertes.fr/hal-00937702 Contributeur : Laurence PorteConnectez-vous pour contacter le contributeur Soumis le : vendredi 18 avril 2014 - 16:31:22 Dernière modification le : mardi 27 octobre 2020 - 13:14:01 Archivage à long terme le : : dimanche 9 avril 2017 - 01:56:42
Daniel Delahaye, Amedeo Odoni. Airspace congestion smoothing by stochastic optimization. EP 97, 6th International Conference on Evolutionary Programming, Apr 1997, Indianapolis, United States. pp 163-176, ⟨10.1007/BFb0014809⟩. ⟨hal-00937702⟩