IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v151y2021icp91-115.html
   My bibliography  Save this article

Causal analysis of flight en route inefficiency

Author

Listed:
  • Liu, Yulin
  • Hansen, Mark
  • Ball, Michael O.
  • Lovell, David J.

Abstract

En route inefficiency is measured in terms of extra distance flown by an aircraft, above a benchmark distance that relates to the theoretical shortest distance route (great circle route). In this paper, we have explored causal relations among en route inefficiency with multiple identified sources: convective weather, wind, miles-in-trail (MIT) restrictions, airspace flow programs (AFPs) and special activity airspace (SAA). We propose two mechanisms – strategic route choice and tactical reroute – to ascribe flight en route inefficiency to these factors. In our framework, we first propose an efficient trajectory clustering algorithm to identify nominal routes that reveal both air traffic flow patterns and air route structures in the national airspace system. Second, we develop a tree-based searching algorithm that matches different causal factors to the identified nominal routes in a 4-dimensional manner. Third, we employ a discrete choice modeling framework to quantitatively understand the flight route choice process, and establish a linear model to understand the tactical reroute process. Finally, we estimate the contributions of the identified causal factors to flight inefficiency through counterfactual analysis. Numerical experiments based on 8 representative airport pairs suggest strong negative impact of convection and headwind on route choice process, while MIT, AFP and SAA only demonstrate negative effects on some pairs. We have also shown that the contributions of convective weather, wind, traffic management initiatives, and SAA are up to 7.1%, 14.0%, 4.4%, 21.9%, respectively.

Suggested Citation

  • Liu, Yulin & Hansen, Mark & Ball, Michael O. & Lovell, David J., 2021. "Causal analysis of flight en route inefficiency," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 91-115.
  • Handle: RePEc:eee:transb:v:151:y:2021:i:c:p:91-115
    DOI: 10.1016/j.trb.2021.07.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261521001351
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2021.07.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nimrod Megiddo, 1983. "The Weighted Euclidean 1-Center Problem," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 498-504, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Ke & Zheng, Zhe & Zou, Bo & Hansen, Mark, 2023. "Airborne flight time: A comparative analysis between the U.S. and China," Journal of Air Transport Management, Elsevier, vol. 107(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wei-jie Cong & Le Wang & Hui Sun, 2020. "Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem," Computational Optimization and Applications, Springer, vol. 75(1), pages 237-262, January.
    2. Sándor P. Fekete & Joseph S. B. Mitchell & Karin Beurer, 2005. "On the Continuous Fermat-Weber Problem," Operations Research, INFORMS, vol. 53(1), pages 61-76, February.
    3. Piyush Kumar & E. Alper Yıldırım, 2009. "An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 614-629, November.
    4. P. M. Dearing & Mark E. Cawood, 2023. "The minimum covering Euclidean ball of a set of Euclidean balls in $$I\!\!R^n$$ I R n," Annals of Operations Research, Springer, vol. 322(2), pages 631-659, March.
    5. Nazlı Dolu & Umur Hastürk & Mustafa Kemal Tural, 2020. "Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances," Computational Optimization and Applications, Springer, vol. 75(2), pages 537-560, March.
    6. M. Cera & J. A. Mesa & F. A. Ortega & F. Plastria, 2008. "Locating a Central Hunter on the Plane," Journal of Optimization Theory and Applications, Springer, vol. 136(2), pages 155-166, February.
    7. P. Dearing & Andrea Smith, 2013. "A dual algorithm for the minimum covering weighted ball problem in $${\mathbb{R}^n}$$," Journal of Global Optimization, Springer, vol. 55(2), pages 261-278, February.
    8. Blanco, Víctor & Puerto, Justo, 2021. "Covering problems with polyellipsoids: A location analysis perspective," European Journal of Operational Research, Elsevier, vol. 289(1), pages 44-58.
    9. Nguyen Mau Nam & Maria Cristina Villalobos & Nguyen Thai An, 2012. "Minimal Time Functions and the Smallest Intersecting Ball Problem with Unbounded Dynamics," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 768-791, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:151:y:2021:i:c:p:91-115. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.