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
Contributor : Laurence Porte <>
Submitted on : Friday, April 18, 2014 - 4:31:22 PM Last modification on : Tuesday, October 27, 2020 - 1:14:01 PM Long-term archiving on: : Sunday, April 9, 2017 - 1:56:42 AM
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⟩