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.
Publié le : 1998-05-04
Classification:
aerospace control,
air traffic control,
air transportation,
aircraft navigation,
automatic control,
control systems,
evolutionary computation,
monitoring,
road accidents,
safety,
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-00937715,
author = {Delahaye, Daniel and Schoenauer, Marc and Alliot, Jean-Marc},
title = {Airspace sectoring by evolutionary computation},
journal = {HAL},
volume = {1998},
number = {0},
year = {1998},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00937715}
}
Delahaye, Daniel; Schoenauer, Marc; Alliot, Jean-Marc. Airspace sectoring by evolutionary computation. HAL, Tome 1998 (1998) no. 0, . http://gdmltest.u-ga.fr/item/hal-00937715/