Skip to main content
SpringerLink
Log in

Implementing a branch and price and cut method for the airline crew pairing optimization problem

  • Original Paper
  • Published:
Public Transport Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We discuss the airline crew pairing optimization problem and present a solution method based on a combination of column and cut generation. The generated cuts are a subclass of subset-row inequalities. The pricing subproblem is solved by a label-setting algorithm with a new backtracking scheme and consideration of the generated cuts. The solution method for the linear relaxation is embedded in a branch-and-bound procedure with a constraint branching strategy and a new search strategy. We test our method on instances from domestic flight schedules of a European Airline.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Anbil R, Forrest JJ, Pulleyblank WR (1998) Column generation and the airline crew pairing problem. Jahresber Dtsch Math-Ver ICM(III):677–686

    Google Scholar 

  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46:316–329

    Article  Google Scholar 

  • Barnhart C, Cohn AM, Johnson EL, Klabjan D, Nemhauser GL, Vance PH (2003) Airline crew scheduling. In: Handbook of transportation science. Springer, New York, pp 517–560

    Google Scholar 

  • Bixby R, Gregory J, Lustig I, Marsten R, Shanno D (1992) Very large-scale linear programming: a case study in combining interior point and simplex methods. Oper Res 40(5):885–897

    Article  Google Scholar 

  • Chvátal V (2006) Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math 306(10–11):886–904

    Article  Google Scholar 

  • Desaulniers G, Desrosiers J, Dumas Y, Marc S, Rioux B, Solomon MM, Soumis F (1997) Crew pairing at Air France. Eur J Oper Res 97(2):245–259

    Article  Google Scholar 

  • Desaulniers G, Desrosiers J, Lasry A, Solomon MM (1999) Crew pairing for a regional carrier. In: Lecture notes in economics and mathematical systems, vol 471, pp 19–41

    Google Scholar 

  • Desrosiers J, Lübbecke M (2005) A primer in column generation. In: Column generation. Springer, New York, pp 1–32

    Chapter  Google Scholar 

  • European Parliament and the Council (2006) Regulation (ec) no 1899/2006

  • Fahle T, Junker U, Karisch SE, Kohl N, Sellmann M, Vaaben B (2002) Constraint programming based column generation for crew assignment. J Heuristics 8(1):59–81. doi:10.1023/A:1013613701606

    Article  Google Scholar 

  • Galia R, Hjorring C (2004) Modelling of complex costs and rules in a crew pairing column generator. In: Ahr D, Fahrion R, Oswald M, Reinelt G (eds) Operations research proceedings 2003–selected papers of the international conference on operations research (OR 2003). Springer, Berlin, pp 133–140

    Google Scholar 

  • Gopalakrishnan B, Johnson EL (2005) Airline crew scheduling: state-of-the-art. Ann Oper Res 140:305–337

    Article  Google Scholar 

  • IBM ILOG (2009) http://www.ilog.com/. Last access on 19th October 2009

  • Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Column generation. Springer, Berlin, pp 33–65

    Chapter  Google Scholar 

  • Jans R, Degraeve Z (2004) An industrial extension of the discrete lot-sizing and scheduling problem. IIE Trans 36(1):47–58

    Article  Google Scholar 

  • Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2):497–511

    Article  Google Scholar 

  • Klabjan D, Johnson EL, Nemhauser GL, Gelman E, Ramaswamy S (2001) Solving large airline crew scheduling problems: random pairing generation and strong branching. Comput Optim Appl 20:73–91

    Article  Google Scholar 

  • MOPS Optimierungssysteme GmbH, Co KG (2009) http://www.mops-optimizer.com. Last access on 19th October 2009

  • Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5(1):199–215

    Article  Google Scholar 

  • Ryan DM, Foster BA (1981) An integer programming approach to scheduling. In: Computer scheduling of public transport, vol 1, pp 269–280

    Google Scholar 

  • Vance PH, Atamtürk A, Barnhart C, Gelman E, Johnson EL, Krishna A, Mahidhara D, Nemhauser GL, Rebello R (1997a) A heuristic branch-and-price approach for the airline crew pairing problem. Tech Rep LEC-97-06, Georgia Institute of Technology

  • Vance PH, Barnhart C, Johnson EL, Nemhauser GL (1997b) Airline crew scheduling: a new formulation and decomposition algorithm. Oper Res 45(2):188–200

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Decision Support & Operations Research Lab, University of Paderborn, Warburger Str. 100, 33098, Paderborn, Germany

    Viktor Dück, Franz Wesselmann & Leena Suhl

Authors
  1. Viktor Dück
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franz Wesselmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leena Suhl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Viktor Dück.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dück, V., Wesselmann, F. & Suhl, L. Implementing a branch and price and cut method for the airline crew pairing optimization problem. Public Transp 3, 43–64 (2011). https://doi.org/10.1007/s12469-011-0038-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12469-011-0038-9

Keywords

Search

Navigation