Interfleet and Intrafleet Models for Crew Recovery Problems

This paper investigates the intrafleet and interfleet models for the solution of crew recovery problems during irregular airline operations. The intrafleet model groups crew members together and assigns them to flights in the same fleet. The interfleet model splits crew groups and reassigns them to flights across different fleets. Both models belong to the set covering problems with side constraints; however, the former is a 0–1 set covering problem whereas the latter is a general set covering problem. The models exhibit different computational characteristics. Various solution approaches are discussed, and a simulated annealing algorithm is developed for models that are difficult to solve. Computational results using data from a major airline show that the algorithm is able to provide effective and efficient solutions. These results also show that the intrafleet model, though widely used by airlines in practice, limits the solution space and can lead to inferior solutions. The interfleet model offers better recovery solutions for airlines under irregular operations.

[1]  Cynthia Barnhart,et al.  Flight operations recovery: New approaches considering passenger recovery , 2006, J. Sched..

[2]  Claude P. Medard,et al.  Airline crew scheduling from planning to operations , 2007, Eur. J. Oper. Res..

[3]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

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

[5]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

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

[7]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[8]  K. Al-Sultan,et al.  A Genetic Algorithm for the Set Covering Problem , 1996 .

[9]  George L. Nemhauser,et al.  Airline Crew Recovery , 2000, Transp. Sci..

[10]  Gang Yu,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: A New Era for Crew Recovery at Continental Airlines , 2003, Interfaces.

[11]  Egon Balas,et al.  On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} , 1986, Math. Program..

[12]  Ahmed F. Abdelghany,et al.  A Proactive Crew Recovery Decision Support Tool for Commercial Airlines During Irregular Operations , 2004, Ann. Oper. Res..

[13]  Thomas Emden-Weinert,et al.  Best Practice Simulated Annealing for the Airline Crew Scheduling Problem , 1999, J. Heuristics.

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

[15]  Xiangtong Qi,et al.  Disruption Management: Framework, Models And Applications , 2004 .

[16]  Amy Cohn,et al.  Decreasing airline delay propagation by re-allocating scheduled slack , 2010 .

[17]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[18]  Jacques Desrosiers,et al.  The Operational Airline Crew Scheduling Problem , 1997, Transp. Sci..

[19]  Allan Larsen,et al.  Airline Disruption Management - Perspectives, Experiences and Outlook , 2007 .

[20]  Egon Balas,et al.  On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2} , 1989, Math. Program..

[21]  Antonio Sassano,et al.  Facets and lifting procedures for the set covering polytope , 1989, Math. Program..

[22]  Gang Yu,et al.  Optimization Model and Algorithm for Crew Management During Airline Irregular Operations , 1997, J. Comb. Optim..

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