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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Separating air traffic flows by allocating 3D-trajectories


    Contributors:
    Gianazza, D. (author) / Durand, N. (author)


    Publication date :

    2004-01-01


    Size :

    775065 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Mining activity pattern trajectories and allocating activities in the network

    Allahviranloo, Mahdieh / Recker, Will | Online Contents | 2015


    Mining activity pattern trajectories and allocating activities in the network

    Allahviranloo, Mahdieh / Recker, Will | Online Contents | 2015


    A Reserve Capacity Model of Optimal Traffic Lane Allocating

    Zhang, Peng / Li, Wen-quan | ASCE | 2009


    A Reserve Capacity Model of Optimal Traffic Lane Allocating

    Zhang, P. / Li, W.-q. | British Library Conference Proceedings | 2009


    Fuel-Efficient Trajectories Traffic Synchronization

    Pawełek, Adrian / Lichota, Piotr / Dalmau, Ramon et al. | AIAA | 2018