IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v76y2025i7p1338-1354.html
   My bibliography  Save this article

A novel untapped flight segment flow prediction framework based on graph deep learning and heuristic algorithm for sustainable transport development

Author

Listed:
  • Linlin Chen
  • Shuihua Han
  • Shivam Gupta
  • Uthayasankar Sivarajah
  • Fred A. Yamoah

Abstract

This study explores a novel machine learning framework for predicting the flow of untapped flight segments, focusing on the unique challenges posed by the absence of historical flow data in airline networks. Utilizing a real-world datasets from a major airline, we evaluate the performance of a graph deep learning-based approach that combines Multi-Graph Attention Networks (MGAT) and Long Short-Term Memory (LSTM) networks, as well as Nondominated Sorting Genetic Algorithm II. The results demonstrate that the proposed framework significantly outperforms traditional models in accurately predicting passenger flow for new flight segments, particularly when compared to statistical benchmarks like time-series models that rely on historical flow data. Moreover, we find that optimizing the affinity coefficients within MGAT using the NSGA- II not only enhances predictive accuracy but also improves the interpretability of the model. Finally, we provide an in-depth analysis of the key factor that influence the predicted outcomes, highlighting the critical role of market competition in untapped segment operations.

Suggested Citation

  • Linlin Chen & Shuihua Han & Shivam Gupta & Uthayasankar Sivarajah & Fred A. Yamoah, 2025. "A novel untapped flight segment flow prediction framework based on graph deep learning and heuristic algorithm for sustainable transport development," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 76(7), pages 1338-1354, July.
  • Handle: RePEc:taf:tjorxx:v:76:y:2025:i:7:p:1338-1354
    DOI: 10.1080/01605682.2024.2433191
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2024.2433191
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2024.2433191?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:76:y:2025:i:7:p:1338-1354. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.