You are here: Home 8th Seminar Papers Ant Colony Optimization for Air Traffic ...
Document Actions

Paper 52 -- Ant Colony Optimization for Air Traffic Conflict Resolution

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.
Theme: Innovative ATM Concepts
Keywords: Air Traffic Conflict Resolution, Ant Colony Optimization, Metaheuristic
Posted by: Nicolas Durand / Other authors: Jean-Marc Alliot
Note: Unset Received On Jan 23, 2009

| Site Map | Accessibility | Contact |

Hosted and maintained by EUROCONTROL