# Ant Colony Optimization for Air Traffic Conflict Resolution

Abstract : The n aircraft conflict resolution problem is highly combinatorial and can be optimally solved using classical mathematical optimisation techniques only for small problems involving less than 5 aircraft. This article applies an Ant Colony Optimization (ACO) algorithm in order to solve large problems involving up to 30 aircraft. In order to limit the number of pheromone trails to update, a $n$ aircraft conflict resolution problem is not modeled by a single ant but by a bunch of $n$ ants choosing their trajectories independantly. A relaxation process is also used in order to be able to handle difficult conflicts for which partial solutions can help finding a path toward the optimal solution. Two different sizes of a toy problem are solved and presented.
Keywords :

Cited literature [12 references]

https://hal-enac.archives-ouvertes.fr/hal-01293554
Contributor : Laurence Porte <>
Submitted on : Thursday, March 24, 2016 - 11:04:31 PM
Last modification on : Friday, May 19, 2017 - 9:09:13 AM
Document(s) archivé(s) le : Monday, November 14, 2016 - 5:43:47 AM

### File

atm2009_durandalliot.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01293554, version 1

### Citation

Nicolas Durand, Jean-Marc Alliot. Ant Colony Optimization for Air Traffic Conflict Resolution . ATM Seminar 2009, 8th USA/Europe Air Traffic Management Research and Developpment Seminar, Jun 2009, Napa, California, United States. ⟨hal-01293554⟩

Record views