IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i5d10.1007_s10878-025-01324-0.html
   My bibliography  Save this article

Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition

Author

Listed:
  • Cong Li

    (University of Chinese Academy of Sciences)

  • Suixiang Gao

    (University of Chinese Academy of Sciences
    Zhongguancun Laboratory)

  • Wenguo Yang

    (University of Chinese Academy of Sciences)

  • Zhipeng Jiang

    (University of Chinese Academy of Sciences)

Abstract

For the aircraft routing and crew pairing problems, a sequential approach is usually used to solve they. When solving the crew pairing problem, the impact of aircraft routing problem is often neglected so that these two problems are independent. This approach reduces the complexity of the solution process, but it may obtain a suboptimal solution. In this paper, we consider an integrated aircraft routing and crew pairing problem. We propose an integrated model that integrates the aircraft routing and crew pairing problems. We propose a solution algorithm based on a heuristic alternating Lagrangian decomposition to address coupling constraint of the integrated model. The solution algorithm iterates between the first Lagrangian subproblem about aircraft routing and the second Lagrangian subproblem about crew pairing. These two Lagrangian subproblems are solved by a branch-and-price algorithm. In the branch-and-price algorithm, we present a heuristic branching strategy. The computational experiments are conducted on several real-world data sets.

Suggested Citation

  • Cong Li & Suixiang Gao & Wenguo Yang & Zhipeng Jiang, 2025. "Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-15, July.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01324-0
    DOI: 10.1007/s10878-025-01324-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01324-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01324-0?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.

    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:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01324-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.