Skip to main content
Intended for healthcare professionals
Restricted access
Research article
First published online January 1, 2013

Interfleet and Intrafleet Models for Crew Recovery Problems

Abstract

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.

Get full access to this article

View all access and purchase options for this article.

References

1. Yu G., Arguello M., Song M., McCowan S., and White A. A New Era for Crew Recovery at Continental Airlines. Interfaces, Vol. 33, No. 1, 2003, pp. 5–22.
2. AhmadBeygi S., Cohn A., and Lapp M. Decreasing Airline Delay Propagation by Re-allocating Scheduled Slack. IIE Tractions on Operations Engineering, Vol. 42, No. 7, 2010, pp. 478–489.
3. Graves G. W., McBride R. D., Gershkoff I., Anderson D., and Mahidhara D. Flight Crew Scheduling. Management Science, Vol. 36, No. 6, 1993, pp. 736–745.
4. Wei G., Yu G., and Song M. Optimization Model and Algorithm for Crew Management During Airline Irregular Operations. Journal of Combinatorial Optimization, Vol. 1, No. 3, 1997, pp. 305–321.
5. Stojkvic M., Soumis F., and Desrosiers J. The Operational Airline Crew Scheduling Problem. Transportation Science, Vol. 32, No. 3, 1998, pp. 232–245.
6. Lettovsky L., Johnson E. L., and Nemhauser G. L. Airline Crew Recovery. Transportation Science, Vol. 34, No. 3, 2000, pp. 337–348.
7. Abdelghany A., Ekollu G., Narasimhan R., and Abdelghany K. A Proactive Crew Recovery Decision Support Tool for Commercial Airlines During Irregular Operations. Annals of Operations Research, Vol. 127, No. 1-4, 2004, pp. 309–331.
8. Yu G., and Qi X. Disruption Management: Framework, Models and Applications. World Scientific, Singapore, 2004.
9. Medard C. P., and Sawhney N. Airline Crew Scheduling from Planning to Operation. European Journal of Operational Research, Vol. 183, No. 3, 2007, pp. 1013–1027.
10. Bratu S., and Barnhart C. Flight Operations Recovery—New Approaches Considering Passenger Recovery. Journal of Scheduling, Vol. 9, No. 3, 2006, pp. 279–298.
11. Kohl N., Larsen A., Larsen J., Ross A., and Tiourine S. Airline Disruption Management Perspectives, Experiences and Outlook. Journal of Air Transport Management, Vol. 13, No. 3, 2007, pp. 149–162.
12. Fisher M. L., and Kedia P. Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics. Management Science, Vol. 36, No. 6, 1990, pp. 674–688.
13. Wedelin D. An Algorithm for Large Scale 0–1 Integer Programming with Application to Airline Crew Scheduling. Annals of Operations Research, Vol. 57, No. 1, 1995, pp. 283–301.
14. Balas E., and Carrera M. A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Operations Research, Vol. 44, No. 6, 1996, pp. 875–890.
15. Caprara A., Fischetti M., and Toth P. A Heuristic Method for the Set Covering Problem. Operations Research, Vol. 47, No. 5, 1999, pp. 730–743.
16. Barahona F., and Anbil R. The Volume Algorithm: Producing Primal Solutions with a Subgradient Method. Technical report. IBM T. J. Watson Research Center, Yorktown Heights, N.Y., 1997.
17. Balas E., and Ng S. M. On the Set Covering Polytope: I. All the Facets with Coefficients in [0, 1, 2]. Mathematical Programming, Vol. 45, No. 1, 1989, pp. 1–20.
18. Balas E., and Ng S. M. On the Set Covering Polytope: II. Lifting the Facets with Coefficients in {0, 1, 2}. Mathematical Programming, Vol. 45, No. 1, 1989, pp. 1–20.
19. Nobili P., and Sassano A. Facets and Lifting Procedures for the Set-Covering Polytope. Mathematical Programming Ser B, Vol. 45, No. 1/3, 1989, pp. 111–137.
20. Cornuejols G., and Sassano A. On the 0, 1 Facets of the Set-Covering Problem. Mathematical Programming Ser A, Vol. 43, No. 1/3, 1989, pp. 45–55.
21. Feo T. A., and Resende M. G. C. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Operations Research Letters, Vol. 8, No. 2, 1998, pp. 67–71.
22. Beasley J. E., and Chu P. C. A Genetic Algorithm for the Set Covering Problem. European Journal of Operational Research, Vol. 94, No. 2, 1996, pp. 392–404.
23. Weinert T. E., and Proksch M. Best Practice Simulated Annealing for the Airline Crew Scheduling Problem. Journal of Heuristics, Vol. 5, No. 5, 1999, pp. 419–436.
24. Johnson E., Lettovsky L., Nemhauser G.et al. Final Report to Northwest Airlines on the Crew Recovery Problem. Technical report. Logistics Institute, Georgia Institute of Technology, Atlanta, 1994.

Cite article

Cite article

Cite article

OR

Download to reference manager

If you have citation software installed, you can download article citation data to the citation manager of your choice

Share options

Share

Share this article

Share with email
EMAIL ARTICLE LINK
Share on social media

Share access to this article

Sharing links are not relevant where the article is open access and not available if you do not have a subscription.

For more information view the Sage Journals article sharing page.

Information, rights and permissions

Information

Published In

Article first published online: January 1, 2013
Issue published: January 2013

Rights and permissions

© 2013 National Academy of Sciences.
Request permissions for this article.

Authors

Affiliations

Qiang Liu
Computer Integrated Manufacturing System Laboratory, Guangdong University of Technology, Guangzhou Higher Education Mega Center, No. 100 Waihuan Xi Road, Guangzhou 510006, China.
Xinhui Zhang
Department of Biomedical, Industrial, and Human Factors Engineering, Wright State University, 207 Russ Engineering Center, 3640 Colonel Glen Highway, Dayton, OH 45435.
Xin Chen
Computer Integrated Manufacturing System Laboratory, Guangdong University of Technology, Guangzhou Higher Education Mega Center, No. 100 Waihuan Xi Road, Guangzhou 510006, China.
Xindu Chen
Computer Integrated Manufacturing System Laboratory, Guangdong University of Technology, Guangzhou Higher Education Mega Center, No. 100 Waihuan Xi Road, Guangzhou 510006, China.

Notes

Metrics and citations

Metrics

Journals metrics

This article was published in Transportation Research Record: Journal of the Transportation Research Board.

VIEW ALL JOURNAL METRICS

Article usage*

Total views and downloads: 14

*Article usage tracking started in December 2016


Altmetric

See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores



Articles citing this one

Receive email alerts when this article is cited

Web of Science: 0

Crossref: 3

  1. A Necessity for Sustainability: Operational Resilience Through Disrupt...
    Go to citation Crossref Google Scholar
  2. Dynamic Model of Contingency Flight Crew Planning Extending to Crew Fo...
    Go to citation Crossref Google Scholar
  3. Airline disruption management: A literature review and practical chall...
    Go to citation Crossref Google Scholar

Figures and tables

Figures & Media

Tables

View Options

Get access

Access options

If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:


Alternatively, view purchase options below:

Purchase 24 hour online access to view and download content.

Access journal content via a DeepDyve subscription or find out more about this option.

View options

PDF/ePub

View PDF/ePub