IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_54.html
   My bibliography  Save this book chapter

A Column Generation Approach to Airline Crew Scheduling

In: Operations Research Proceedings 2005

Author

Listed:
  • Ralf Borndörfer

    (Konrad-Zuse-Zentrum für Informationstechnik Berlin)

  • Uwe Schelten

    (Lufthansa Systems Berlin)

  • Thomas Schlechte

    (Konrad-Zuse-Zentrum für Informationstechnik Berlin)

  • Steffen Weider

    (Konrad-Zuse-Zentrum für Informationstechnik Berlin)

Abstract

Summary The airline crew scheduling problem deals with the construction of crew rotations in order to cover the flights of a given schedule at minimum cost. The problem involves complex rules for the legality and costs of individual pairings and base constraints for the availability of crews at home bases. A typical instance considers a planning horizon of one month and several thousand flights. We propose a column generation approach for solving airline crew scheduling problems that is based on a set partitioning model. We discuss algorithmic aspects such as the use of bundle techniques for the fast, approximate solution of linear programs, a pairing generator that combines Lagrangean shortest path and callback techniques, and a novel “rapid branching” IP heuristic. Computational results for a number of industrial instances are reported. Our approach has been implemented within the commercial crew scheduling system NetLine/Crew of Lufthansa Systems Berlin GmbH.

Suggested Citation

  • Ralf Borndörfer & Uwe Schelten & Thomas Schlechte & Steffen Weider, 2006. "A Column Generation Approach to Airline Crew Scheduling," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 343-348, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_54
    DOI: 10.1007/3-540-32539-5_54
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. 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:spr:oprchp:978-3-540-32539-0_54. 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.