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
Abstract : 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.
Keywords : aerospace control air traffic control air transportation aircraft navigation automatic control control systems evolutionary computation monitoring road accidents safety
Document type :
Conference papers
Complete list of metadatas
https://hal-enac.archives-ouvertes.fr/hal-00937715
Contributor : Laurence Porte <>
Submitted on : Tuesday, April 29, 2014 - 5:26:55 PM
Last modification on : Friday, January 10, 2020 - 3:42:10 PM
Long-term archiving on: Tuesday, July 29, 2014 - 10:45:38 AM

File

Delahaye_ICEC1998.pdf
Files produced by the author(s)

Identifiers

Collections

MAIAA | MAIAA-OPTIM | INSMI | CNRS | X-CMAP | CMAP | PARISTECH | X | ENAC | UVSQ | TDS-MACS | DGAC | X-DEP-MATHA

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

682

Files downloads

186