Constraint Programming Based Column Generation for Crew Assignment

Airline crew assignment problems are large-scale optimization problems which can be adequately solved by column generation. The subproblem is typically a so-called constrained shortest path problem and solved by dynamic programming. However, complex airline regulations arising frequently in European airlines cannot be expressed entirely in this framework and limit the use of pure column generation. In this paper, we formulate the subproblem as a constraint satisfaction problem, thus gaining high expressiveness. Each airline regulation is encoded by one or several constraints. An additional constraint which encapsulates a shortest path algorithm for generating columns with negative reduced costs is introduced. This constraint reduces the search space of the subproblem significantly. Resulting domain reductions are propagated to the other constraints which additionally reduces the search space. Numerical results based on data of a large European airline are presented and demonstrate the potential of our approach.

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

[2]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[3]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[4]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[5]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[6]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[7]  Jacques Desrosiers,et al.  The Preferential Bidding System at Air Canada , 1997, Transp. Sci..

[8]  Evelina Lamma,et al.  Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem , 1998 .

[9]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..

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

[11]  César Rego,et al.  Subgraph ejection chains and tabu search for the crew scheduling problem , 1999, J. Oper. Res. Soc..

[12]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[13]  Matteo Fischetti,et al.  Modeling and Solving the Crew Rostering Problem , 1998, Oper. Res..

[14]  Cynthia Barnhart,et al.  An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem , 1998, Transp. Sci..

[15]  Matteo Fischetti,et al.  A Heuristic Algorithm for the Set Covering Problem , 1996, IPCO.

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

[17]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[18]  David M. Ryan,et al.  Flight Attendant Rostering for Short-Haul Airline Operations , 1997, Oper. Res..

[19]  Henri Beringer,et al.  Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers , 1995, Logic Programming: Formal Methods and Practical Applications.

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

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

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

[24]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[25]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..