Allocating 3D-trajectories to air traffic flows using A* and genetic algorithms

Abstract : This paper introduces two methods, tested on a toy problem, which allocate optimal separated 3D-trajectories to air traffic flows. The first approach is a 1 vs n strategy which applies an A* algorithm iteratively to each flow. The second is a global approach using a genetic algorithm, applied to a population of trajectory sets.