Skip to main content

A Greedy Heuristic for Airline Crew Rostering: Unique Challenges in a Large Airline in China

  • Conference paper
Modern Approaches in Applied Intelligence (IEA/AIE 2011)

Abstract

We study a unique challenge in the crew rostering problem faced by a large airline in China, where fairness for crewmembers is the main concern. The fairness aspect of rosters produced by a commercial optimizer is not satisfactory. We discuss the challenges imposed by the fairness constraint and devise a greedy heuristic to directly address these challenges. The resulting algorithm is not only much faster but also produces a more balanced plan based on actual data from the airline in question.

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.

References

  1. Etschmaier, M.M., Mathaisel, D.F.X.: Airline Scheduling: An Overview. Transportation Science 19(2), 127–138 (1985)

    Article  Google Scholar 

  2. Campbell, K.W., Durfee, R.B., Hines, G.S.: FedEx Generates Bid Lines Using Simulated Annealing. Interfaces 27(2), 1–16 (1997)

    Article  Google Scholar 

  3. Jarrah, A.I.Z., Diamond, J.T.: The Problem of Generating Crew Bidlines. Interfaces 27(4), 49–64 (1997)

    Article  Google Scholar 

  4. Anbil, R., Gelman, E., Patty, B., Tanga, R.: Recent Advances in Crew-Pairing Optimization at American Airlines. Interfaces 21(1), 62–74 (1991)

    Article  Google Scholar 

  5. Barnhart, C., Johnson, E.L., Anbil, R., Hatay, L.: A column-generation technique for the long-haul crew-assignment problem, pp. 7–24. John Wiley & Sons, Inc., New York (1994)

    MATH  Google Scholar 

  6. Gershkoff, I.: Optimizing Flight Crew Schedules. Interfaces 19(4), 29–43 (1989)

    Article  Google Scholar 

  7. Hoffman, K.L., Padberg, M.: Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science 39(6), 657–682 (1993)

    Article  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. 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 

  10. Fahle, T., Junker, U., Karisch, S.E., Kohl, N., Sellmann, M., Vaaben, B.: Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics 8(1), 59–81 (2002)

    Article  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

Chen, Q., Lim, A., Zhu, W. (2011). A Greedy Heuristic for Airline Crew Rostering: Unique Challenges in a Large Airline in China. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21827-9_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21826-2

  • Online ISBN: 978-3-642-21827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics