# Ant Colony Systems for Optimizing Sequences of Airspace Partitions

Abstract : In this paper, we introduce an Ant Colony System algorithm which finds optimal or near-optimal sequences of airspace partitions, taking into account some constraints on the transitions between two successive airspace configurations. The transitions should be simple enough to allow air traffic controllers to maintain their situation awareness during the airspace configuration changes. For the same reason, once a sector is opened it should remain so for a minimum duration. The Ant Colony System (ACS) finds a sequence of airspace configurations minimizing a cost related to the workload and the usage of manpower resources, while satisfying the transition constraints. This approach shows good results in a limited time when compared with a previously proposed $A$ * algorithm on some instances from the french air traffic control center of Aix (East qualification zone) where the $A$ * algorithm exhibited high computation times.00
Keywords :
Document type :
Conference papers

Cited literature [25 references]

https://hal-enac.archives-ouvertes.fr/hal-02547511
Contributor : Laurence Porte <>
Submitted on : Monday, April 20, 2020 - 10:08:48 AM
Last modification on : Tuesday, June 2, 2020 - 12:10:09 PM

### File

Files produced by the author(s)

### Citation

David Gianazza, Nicolas Durand. Ant Colony Systems for Optimizing Sequences of Airspace Partitions. AIDA-AT 2020 International Conference on Artificial Intelligence and Data Analytics for Air Transportation, Feb 2020, Singapour, Singapore. ⟨10.1109/AIDA-AT48540.2020.9049206⟩. ⟨hal-02547511⟩

Record views