Airline Crew Scheduling: State-of-the-Art

The airline industry is faced with some of the largest scheduling problems of any industry. The crew scheduling problem involves the optimal allocation of crews to flights. Over the last two decades the magnitude and complexity of crew scheduling problems have grown enormously and airlines are relying more on automated mathematical procedures as a practical necessity. In this paper we survey different approaches studied and discuss the state-of-the-art in solution methodology for the airline crew scheduling problem. We conclude with a discussion about promising areas for further work to make it possible to get very good solutions for the crew scheduling problem.

[1]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[2]  Efthymios Housos,et al.  Automatic Optimization of Subproblems in Scheduling Airline Crews , 1997 .

[3]  John J. H. Forrest,et al.  Column generation and the airline crew pairing problem. , 1998 .

[4]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[5]  Peter Sanders,et al.  Parallel Integer Optimization for Crew Scheduling , 2000, Ann. Oper. Res..

[6]  Ellis L. Johnson,et al.  Cyclic group and knapsack facets , 2003, Math. Program..

[7]  Richard D. McBride,et al.  Flight crew scheduling , 1993 .

[8]  Ellis L. Johnson.  Modelling and strong linear programs for mixed integer programming , 1989 .

[9]  William J. Cook,et al.  Parallel Mixed Integer Programming , 1995 .

[10]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

[11]  Michael A. Saunders,et al.  Inertia-Controlling Methods for General Quadratic Programming , 1991, SIAM Rev..

[12]  J F Barutt,et al.  AIRLINE CREW SCHEDULING : SUPERCOMPUTERS AND ALGORITHMS , 1990 .

[13]  Ellis L. Johnson,et al.  T-space and cutting planes , 2003, Math. Program..

[14]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[15]  Manfred W. Padberg,et al.  Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..

[16]  Ira Gershkoff,et al.  Optimizing Flight Crew Schedules , 1989 .

[17]  Cynthia Barnhart,et al.  Deadhead Selection for the Long-Haul Crew Pairing Problem , 1995, Oper. Res..

[18]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[19]  Michael Ball,et al.  A Graph Partitioning Approach to Airline Crew Scheduling , 1985, Transp. Sci..

[20]  Diego Klabjan,et al.  Airline Crew Pairing Generation in Parallel , 2001, PP.

[21]  Erik Andersson,et al.  Crew Pairing Optimization , 1998 .

[23]  Jing Hu,et al.  Computational results with a primal-dual subproblem simplex method , 1999, Oper. Res. Lett..

[24]  Jing Hu.  Solving linear programs using primal-dual subproblem simplex method and quasi-explicit matrices , 1996 .

[25]  D. Ryan,et al.  On the integer properties of scheduling set partitioning models , 1988 .

[26]  Bernard Gendron,et al.  Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..

[27]  Martin W. P. Savelsbergh,et al.  A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..

[28]  Manfred W. Padberg.  Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

[29]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[30]  Ellis L. Johnson,et al.  Solving Large Scale Crew Scheduling Problems , 1997 .

[31]  M R Rosekind,et al.  Flight crew fatigue VI: a synthesis. , 1998, Aviation, space, and environmental medicine.

[32]  Mark R Rosekind.  FATIGUE IN AVIATION , 1994 .

[33]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[34]  Edward K. Baker,et al.  THE DEVELOPMENT AND IMPLEMENTATION OF A HEURISTIC SET COVERING BASED SYSTEM FOR AIR CREW SCHEDULING , 1985 .

[35]  KlabjanDiego,et al.  Solving Large Airline Crew Scheduling Problems , 2001 .

[36]  A. Hoffman,et al.  Totally-Balanced and Greedy Matrices , 1985 .

[37]  Ellis L. Johnson,et al.  A Global Approach to Crew-Pairing Optimization , 1992, IBM Syst. J..

[38]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[39]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .

[40]  Michael Jünger,et al.  Introduction to ABACUS - a branch-and-cut system , 1998, Oper. Res. Lett..

[41]  C. Lemaréchal.  An extension of davidon methods to non differentiable problems , 1975 .

[42]  George L. Nemhauser,et al.  A Heuristic Branch-and-Price Approach for the Airline Crew Pairing Problem , 1997 .

[43]  Ellis L. Johnson,et al.  Corner Polyhedra and their connection with cutting planes , 2003, Math. Program..

[44]  Egon Balas,et al.  Gomory cuts revisited , 1996, Oper. Res. Lett..

[45]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[46]  Cynthia Barnhart,et al.  A column-generation technique for the long-haul crew-assignment problem , 1994 .

[47]  Dennis Huisman,et al.  Models and Algorithms for Integration of Vehicle and Crew Scheduling , 2000, J. Sched..

[48]  P. Wolfe.  Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[49]  Srini Ramaswamy,et al.  Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching , 2001, Comput. Optim. Appl..

[50]  Matthias Ehrgott,et al.  Constructing robust crew schedules with bicriteria optimization , 2002 .

[51]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[52]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[53]  G. Nemhauser,et al.  BRANCH-AND-PRICE: GENERATION FOR SOLVING HUGE INTEGER PROGRAMS , 1998 .

[54]  Srini Ramaswamy,et al.  Airline Crew Scheduling with Time Windows and Plane-Count Constraints , 2002, Transp. Sci..

[55]  Gérard Cornuéjols,et al.  On the 0, 1 facets of the set covering polytope , 1989, Math. Program..

[56]  Martin Desrochers,et al.  A Breakthrough in Airline Crew Scheduling , 1991 .

[57]  Kurt Spielberg,et al.  Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..

[58]  Eric Gelman,et al.  Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .

[59]  Jacques Desrosiers,et al.  Crew Pairing at Air France , 1993 .

[60]  Srini Ramaswamy,et al.  Airline Crew Scheduling with Regularity , 2001, Transp. Sci..

[61]  M. Padberg.  Essays in integer programming , 1971 .

[62]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[63]  Dennis F. X. Mathaisel,et al.  Airline Scheduling: An Overview , 1985, Transp. Sci..

[64]  M. Padberg.  On the Complexity of Set Packing Polyhedra , 1977 .

[65]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[66]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[67]  Jeffery David Weir.  A three phase approach to solving the bidline generation problem with an emphasis on mitigating pilot fatigue through circadian rule enforcement , 2002 .

[68]  Leslie E. Trotter,et al.  Branch, Cut, and Price: Sequential and Parallel , 2000, Computational Combinatorial Optimization.

[69]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[70]  J. Mitchell.  Branch-and-Cut Algorithms for Combinatorial Optimization Problems , 1988 .

[71]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[72]  J. P. Arabeyre,et al.  The Airline Crew Scheduling Problem: A Survey , 1969 .

[73]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[74]  Diego Klabjan,et al.  A parallel primal-dual simplex algorithm , 2000, Oper. Res. Lett..

[75]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[76]  Michael Jünger,et al.  Computational Combinatorial Optimization , 2001, Lecture Notes in Computer Science.

[77]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[78]  M Minoux,et al.  COLUMN GENERATION TECHNIQUES IN COMBINATORIAL OPTIMIZATION : A NEW APPLICATION TO CREW PAIRING , 1984 .

[79]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .