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.
Computing 4D near-optimal trajectories for dynamic air traffic flow management with column generation and branch-and-price
Transportation Planning and Technology ; 34 , 5 ; 389-411
2011-07-01
23 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Computing Optimal Multiarc Trajectories
NTRS | 1989
|Automated Generation of Realistic Near-Optimal Aircraft Trajectories
Online Contents | 2008
|Near-optimal low-thrust lunar trajectories
AIAA | 1996
|Near-Optimal Low-Thrust Lunar Trajectories
Online Contents | 1996
|