This paper introduces two algorithms which allocate optimal separated 3D-trajectories to the main 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. The algorithms are first tried on a toy problem, and then applied to real traffic data, using operational aircraft performances. The cumulated costs of the trajectory deviations are used to compare the two algorithms.
Publié le : 2004-10-24
Classification:
air traffic control,
aircraft,
costs,
delay,
Europe,
genetic algorithms,
iterative algorithms,
stochastic processes,
telecommunication traffic,
traffic control,
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-00938063,
author = {Gianazza, David and Durand, Nicolas},
title = {Separating air traffic flows by allocating 3D-trajectories},
journal = {HAL},
volume = {2004},
number = {0},
year = {2004},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00938063}
}
Gianazza, David; Durand, Nicolas. Separating air traffic flows by allocating 3D-trajectories. HAL, Tome 2004 (2004) no. 0, . http://gdmltest.u-ga.fr/item/hal-00938063/