The current air traffic system faces recurrent saturation problems. Numerous studies are dedicated to this issue, including the present research on a new dynamic regulation filter holding frequent trajectory optimisations in a real-time sliding horizon loop process. We consider a trajectory optimisation problem arising in this context, where a feasible four-dimensional (4D) trajectory is to be built and assigned to each regulated flight to suppress sector overloads while minimising the cost of the chosen policy. We model this problem with a mixed integer linear programme and solve it with a branch-and-price approach. The pricing sub-problem looks for feasible trajectories in a dynamic three-dimensional (3D) network and is solved with a specific algorithm based on shortest path labelling algorithms and on dynamic programming. Each algorithm is tested on real-world data corresponding to a complete traffic day in the European air traffic system; experimental results, including computing times measurement, validate the solution process.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Computing 4D near-optimal trajectories for dynamic air traffic flow management with column generation and branch-and-price


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2011-07-01


    Format / Umfang :

    23 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Computing Optimal Multiarc Trajectories

    Jezewski, Donald J. | NTRS | 1989



    Near-optimal low-thrust lunar trajectories

    Kluever, Craig A. / Chang, Kun-Rong | AIAA | 1996


    Near-Optimal Low-Thrust Lunar Trajectories

    Kluever, C.A. | Online Contents | 1996