Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Thursday, March 24, 2016 - 11:04:31 PM
Last modification on : Tuesday, October 27, 2020 - 1:14:02 PM
Long-term archiving on: : Monday, November 14, 2016 - 5:43:47 AM


Files produced by the author(s)


  • HAL Id : hal-01293554, version 1



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


Files downloads