Crew pairing for a regional carrier

This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution approach based on extensive enumeration of all valid duties is impractical in this context where duties comprise ten to twelve legs. In order to alleviate this difficulty, we propose an alternative approach which takes into account all work rules and air traffic regulations during the construction of valid crew pairings. Two network structures compatible with this approach are described. The first is a leg-on-node model while the second involves a leg-on-arc representation. Computational results obtained with the GENCOL optimizer on problems varying from 63 to 986 legs lead us to conclude that the leg-on-arc representation is substantially more efficient. In addition, we study the cost impact of three changes in the operating scenario. Finally, we illustrate how bounded perturbation variables virtually eliminate degeneracy, hence significantly decreasing CPU time.

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

[2]  Teodor Gabriel Crainic,et al.  The Column Generation Principle And The Airline Crew Scheduling Problem , 1987 .

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

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

[5]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

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

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

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

[9]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

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

[11]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

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

[13]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

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

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

[16]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .

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

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

[19]  Harvey M. Salkin,et al.  Integer Programming , 2019, Engineering Optimization Theory and Practice.

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