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.
Supported by Lufthansa Systems Berlin.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, Branch-and-price: Column generation for solving huge integer programs, Operations Res., 46 (1998), pp. 316–329.
J. E. Beasley and N. Christofides, An algorithm for the resource constrained shortest path problem, Networks, 19 (1989), pp. 379–394.
R. Borndörfer, M. Grötschel, and A. Löbel, Duty scheduling in public transit, in Mathematics — Key Technology for the Future, W. Jäger and H.-J. Krebs, eds., Springer, 2003, pp. 653–674.
M. Desrochers, A new algorithm for the shortest path problem with resource constraints, Tech. Rep. 421A, Centre de Recherche sur les Transports, Univ. Montréal, 1986.
O. du Merle, D. Villeneuve, J. Desrosiers, and P. Hansen, Stabilized column generation, Discrete Math., 194 (1999), pp. 229–237.
C. Helmberg and K. C. Kiwiel, A spectral bundle method with bounds, Math. Prog., 2 (2002), pp. 173–194.
K. Hoffman and M. W. Padberg, Solving airline crew scheduling problems by branch-and-cut, Management Sci., 39 (1993), pp. 657–682.
K. C. Kiwiel, Proximal bundle methods, Math. Prog., 46 (1990), pp. 105–122.
R. Marsten, Airline crew scheduling. Talk at the 15th Int. Symp. Math. Prog., 1994.
D. Villeneuve, J. Desrosiers, M. E. Lübbecke, and F. Soumis, On compact formulations for integer programs solved by column generation, Tech. Rep. No. 2003/25, TU Berlin, 2003.
D. Wedelin, An algorithm for a large scale 0–1 integer programming with application to airline crew scheduling, Ann. Oper. Res., 57 (1995), pp. 283–301.
G. Yu, Operations Research in the Airline Industry, Kluwer, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borndörfer, R., Schelten, U., Schlechte, T., Weider, S. (2006). A Column Generation Approach to Airline Crew Scheduling. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_54
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)