IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i10p1742-1754.html
   My bibliography  Save this article

Solving a large-scale crew pairing problem

Author

Listed:
  • Gunes Erdogan

    (University of Bath, Bath, UK)

  • Mohamed Haouari

    (Qatar University, Doha, Qatar)

  • Melda Ormeci Matoglu

    (University of New Hampshire, Durham, USA)

  • Okan Orsan Ozener

    (Ozyegin University, Istanbul, Turkey)

Abstract

Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on the CPP of North American airlines, which widely differs from that of most European airline companies in terms of the objective function, the flight structure, and the planning horizon. In this study, we develop an optimization-driven heuristic algorithm that can efficiently handle large-scale instances of the CPP that must be solved on a monthly basis. We perform computational experiments using flight schedules of an European airline company to test the performance of the solution method. Our computational results demonstrate that our algorithm is able to provide high-quality solutions to monthly instances with up to 27 000 flight legs.

Suggested Citation

  • Gunes Erdogan & Mohamed Haouari & Melda Ormeci Matoglu & Okan Orsan Ozener, 2015. "Solving a large-scale crew pairing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1742-1754, October.
  • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:10:p:1742-1754
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n10/pdf/jors20152a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n10/full/jors20152a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Wen, Xin & Chung, Sai-Ho & Ji, Ping & Sheu, Jiuh-Biing, 2022. "Individual scheduling approach for multi-class airline cabin crew with manpower requirement heterogeneity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    2. Wen, Xin & Sun, Xuting & Sun, Yige & Yue, Xiaohang, 2021. "Airline crew scheduling: Models and algorithms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    3. Ding, Chengjin & Chen, Xinyuan & Wu, Weiwei & Wei, Wenbin & Xin, Zelin, 2023. "Game-theoretic analysis of the impact of crew overnight hotel cost on airlines’ fleet assignment and crew pairing," Journal of Air Transport Management, Elsevier, vol. 113(C).
    4. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    5. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).

    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:pal:jorsoc:v:66:y:2015:i:10:p:1742-1754. 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.palgrave-journals.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.