Airspace sectoring by evolutionary computation
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|