Skip to main content

Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing Optimization

  • Conference paper
Network Optimization (INOC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6701))

Included in the following conference series:

  • 3312 Accesses

Abstract

For the complex task of scheduling airline crews, this paper discusses the integration of rostering requirements into the crew pairing optimization process. Our approach is based on a network flow model which uses a state expanded network to represent pairing chains for crew members at different domiciles. We enhance this model by proposing a refined representation of rest requirements along with preassignments such as pairings from the previous planning period, office and simulator activities as well as vacation and part-time leaves. In particular, we introduce the concept of availability blocks to mitigate the loss of information following from the aggregated anonymous flow of crew members in the network model. Experimental results with real world data sets show that the refined model remains tractable in practical settings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Andersson, E., Housos, E., Kohl, N., Wedelin, D.: Crew pairing optimization. In: Yu, G. (ed.) Operations Research in the Airline Industry, pp. 228–258. Kluwer, Boston (1998)

    Chapter  Google Scholar 

  2. Barnhart, C., Cohn, A., Johnson, E.L., Klabjan, D., Nemhauser, G.L., Vance, P.: Airline crew scheduling. In: Hall, R.W. (ed.) Handbook of Transportation Science, pp. 517–560 (2003)

    Google Scholar 

  3. Cappanera, P., Gallo, G.: A multicommodity flow approach to the crew rostering problem. Operations Research 52(4), 583–596 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Desaulniers, G., Desrosiers, J., Dumas, Y., Marc, S., Rioux, B., Solomon, M.M., Soumis, F.: Crew pairing at air france. European Journal of Operational Research 97(2), 245–259 (1997)

    Article  MATH  Google Scholar 

  5. Freling, R., Lentink, R.M., Wagelmans, A.P.: A decision support system for crew planning in passenger transportation using a flexible Branch-and-Price algorithm. Annals of Operations Research 127(1), 203–222 (2004)

    Article  MATH  Google Scholar 

  6. Gamache, M., Soumis, F., Marquis, G., Desrosiers, J.: A column generation approach for Large-Scale aircrew rostering problems. Operations Research 47(2), 247–263 (1999)

    Article  MATH  Google Scholar 

  7. Gopalakrishnan, B., Johnson, E.: Airline crew scheduling: State-of-the-Art. Annals of Operations Research 140(1), 305–337 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kohl, N., Karisch, S.E.: Airline crew rostering: Problem types, modeling, and optimization. Annals of Operations Research 127(1), 223–257 (2004)

    Article  MATH  Google Scholar 

  9. Lavoie, S., Minoux, M., Odier, E.: A new approach for crew pairing problems by column generation with an application to air transportation. European Journal of Operational Research 35(1), 45–58 (1988)

    Article  MATH  Google Scholar 

  10. Löbel, A.: Solving large-scale multiple-depot vehicle scheduling problems. Lecture notes in economics and mathematical systems, pp. 193–220 (1997)

    Google Scholar 

  11. Maenhout, B., Vanhoucke, M.: A hybrid scatter search heuristic for personalized crew rostering in the airline industry. European Journal of Operational Research 206(1), 155–167 (2010)

    Article  MATH  Google Scholar 

  12. Mellouli, T.: A network flow approach to crew scheduling based on an analogy to a Train/Aircraft maintenance routing problem. In: Voss, S., Daduna, J. (eds.) Computer-Aided Scheduling of Public Transport. LNEMS, vol. 505, pp. 91–120. Springer, Berlin (2001)

    Chapter  Google Scholar 

  13. Mellouli, T.: Scheduling and routing processes in public transport systems. Professorial dissertation, University of Paderborn (2003)

    Google Scholar 

  14. Mellouli, T.: A network flow optimization model for integrated capacity-based crew scheduling. In: 23rd EURO conference on Operational research, Bonn (2009)

    Google Scholar 

  15. Saddoune, M., Desaulniers, G., Elhallaoui, I., Soumis, F.: Integrated airline crew pairing and crew assignment by dynamic constraint aggregation. Working Paper G-2010-05, Montréal (2010)

    Google Scholar 

  16. Zeghal, F., Minoux, M.: Modeling and solving a crew assignment problem in air transportation. European Journal of Operational Research 175(1), 187–209 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Römer, M., Mellouli, T. (2011). Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing Optimization. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21527-8_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21526-1

  • Online ISBN: 978-3-642-21527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics