Airspace sectoring by evolutionary computation

Daniel Delahaye (1, 2) , Marc Schoenauer (1) , Jean-Marc Alliot (2)

1 CMAP - Centre de Mathématiques Appliquées
2 DGAC - Direction Générale de l'Aviation Civile

This paper addresses the classical graph partitioning problem applied to the air network. We consider an air transportation network with aircraft inducing a control workload. This network has to be partitioned into K balanced sectors for which the cutting flow is minimized.

Mots clés: aerospace control; air traffic control; air transportation; aircraft navigation; automatic control; control systems; evolutionary computation; monitoring; road accidents; safety

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

Daniel Delahaye, Marc Schoenauer, Jean-Marc Alliot. Airspace sectoring by evolutionary computation. IEEE 1998, International Conference on Evolutionary Computation, May 1998, Anchorage, United States. pp 218 - 223, ⟨10.1109/ICEC.1998.699504⟩. ⟨hal-00937715⟩