Airspace congestion smoothing by stochastic optimization

Daniel Delahaye (1, 2) , Amedeo Odoni (2)

1 DGAC - Direction Générale de l'Aviation Civile
2 MIT - Massachusetts Institute of Technology

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.

Mots clés: genetic algorithm; airspace congestion; time of departure; route; network

Domaines: Mathématiques [math]; Optimisation et contrôle [math.OC]

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⟩