Abstract

This is an author final draft version of published work that can be found at: https://arc.aiaa.org/doi/10.2514/1.D0081 Copyright © 2018 by Yan Xu and Xavier Prats. Published by the American Institute of Aeronautics and Astronautics, Inc., with permission. All requests for copying and permission to reprint should be submitted to CCC at www.copyright.com; employ the ISSN 2380-9450 (online) to initiate your request. See also AIAA Rights and Permissions www.aiaa.org/randp.

This paper introduces a strategy to include linear holding into air traffic flow management initiatives, together with the commonly used ground holding and airborne holding measures. In this way, flow management performance can be improved when handling delay assignment with uncertainty. First, a trajectory generation method is presented, aiming at computing, per flight, the maximum linear holding realizable using the same fuel as the original nominal flight. This information is assumed to be computed and shared by the different airlines and it is then used to build a network air traffic flow management model to optimally assign delays, in the scope of trajectory-based operations. Hence, the best distribution of delay is optimized at given positions along the flight trajectory (combining the three holding practices together) and taking into account the cost of delay, especially in the fuel consumption. The problem is formulated as a mixed integer linear program and solved with a commercial off-the-shelf solver. An illustrative example is given, showing that under the circumstance of capacity recovered ahead of schedule, including linear holding contributes to a notable delay reduction compared with the case where only ground and airborne holding apply. Read More: https://arc.aiaa.org/doi/10.2514/1.D0081

Peer Reviewed


Original document

The different versions of the original document can be found in:

https://upcommons.upc.edu/handle/2117/110051,
https://upcommons.upc.edu/bitstream/2117/118857/1/xu_JAT_postprint.pdf,
https://core.ac.uk/display/159237591,
https://academic.microsoft.com/#/detail/2767324810
http://dx.doi.org/10.2514/1.d0081
  • [ ]
Back to Top

Document information

Published on 01/01/2017

Volume 2017, 2017
DOI: 10.2514/1.d0081
Licence: CC BY-NC-SA license

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?