A Column Generation Approach to Airline Crew Scheduling

Please always quote using this URN: urn:nbn:de:0297-zib-8713
  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ralf Borndörfer, Uwe Schelten, Thomas Schlechte, Steffen Weider
Document Type:ZIB-Report
Tag:Airline Crew Scheduling; Branch and Generate; Integer Programming
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming
Date of first Publication:2005/08/01
Series (Serial Number):ZIB-Report (05-37)
Published in:Appeared in: Operations Research Proceedings 2005. H.-D. Haasis et al. (eds.) Springer 2006, 343-348