Airspace sectoring by evolutionary computation
Daniel Delahaye, Marc Schoenauer, Jean‐Marc Alliot · 2002
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.