Airspace sectoring by evolutionary computation

Abstract

International audience; 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.

Original document

The different versions of the original document can be found in:

• https://hal-enac.archives-ouvertes.fr/hal-00937715/file/Delahaye_ICEC1998.pdf

• http://xplorestaging.ieee.org/ielx4/5621/15048/00699504.pdf?arnumber=699504,

http://dx.doi.org/10.1109/icec.1998.699504

• https://hal-enac.archives-ouvertes.fr/hal-00937715,

https://hal-enac.archives-ouvertes.fr/hal-00937715/document,

https://hal-enac.archives-ouvertes.fr/hal-00937715/file/Delahaye_ICEC1998.pdf

• https://hal-enac.archives-ouvertes.fr/hal-00937715,

https://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=699504&contentType=Conference+Publications,

https://hal-enac.archives-ouvertes.fr/hal-00937715/document,

https://academic.microsoft.com/#/detail/1960041851