Skip to main content
SpringerLink
Log in

High performance integer optimization for crew scheduling

  • Track C1: (Industrial) End-user Applications of HPCN
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1593))

Included in the following conference series:

Abstract

Performance aspects of a Lagrangian relaxation based heuristic for solving large 0–1 integer linear programs are discussed. In particular, we look at its application to airline and railway crew scheduling problems. We present a scalable parallelization of the original algorithm used in production at Carmen Systems AB, Göteborg, Sweden, based on distributing the variables and a new sequential active set strategy which requires less work and is better adapted to the memory hierachy properties of modern RISC processors. The active set strategy can even be parallelized on networks of workstations.

This work has been supported by the ESPRIT HPCN program, project PAROS.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Alefragis, C. Goumopoulos, E. Housos, P. Sanders, T. Takkula, and D. Wedelin. Parallel crew scheduling in PAROS. In EUROPAR'98, Lecture Notes in Computer Science, 1998. to appear.

    Google Scholar 

  2. E. Andersson, E. Housos, N. Kohl, and D. Wedelin. OR in the Airline Industry, chapter Crew Pairing Optimization, Kluwer Academic Publishers, Boston, London, Dordrecht, 1997.

    Google Scholar 

  3. C. Barnhart and R. G. Shenoi. An alternate model and solution approach for the long-haul crew pairing problem. Jul 1996.

    Google Scholar 

  4. A. Caprara, M. Fischetti, and P. Toth. A heuristic algorithm for the set covering problem. In Lecture Notes in Computer Science, pages 72–84, 1996.

    Google Scholar 

  5. The Carmen System, version 5.1. Carmen Systems AB, Göteborg, Sweden.

    Google Scholar 

  6. S. Ceria, P. Nobili, and A. Sassano. A Lagrangian-based heuristic for large-scale set covering problems. Technical report, Dipartimento di Informatica e Sistemistica, Università di Roma, La Sapienza, Italy, 1995.

    Google Scholar 

  7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.

    Google Scholar 

  8. G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M. Solomon, and F. Soumis. Crew pairing at Air France. European Journal of Operational Research, 97:245–259, 1997.

    Article  MATH  Google Scholar 

  9. M. L. Fisher. The Lagrangian relaxation method for solving integer programming problems. Management Sciences, 27(1):1–18, 1981.

    MATH  Google Scholar 

  10. C. Goumopoulos, P. Alefragis, and E. Housos. Parallel algorithms for airline crew planning on networks of workstations. In International Conference on Parallel Processing, Minneapolis, 1998.

    Google Scholar 

  11. C. Goumopoulos, E. Housos, and O. Liljenzin. Parallel crew scheduling on work-station networks using PVM. In Euro PVM-MPI, number 1332 in LNCS, Cracow, Poland, 1997.

    Google Scholar 

  12. K. L. Hoffman and M. Padberg. Solving airline crew scheduling problems by branch-and-cut. Management Science, 39(6):657–682, 1993.

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. R. Marsten. RALPH: Crew Planning at Delta Air Lines. Technical Report. Cutting Edge Optimization, 1997.

    Google Scholar 

  15. J. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.

    Google Scholar 

  16. M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI—the Complete Reference. MIT Press, 1996.

    Google Scholar 

  17. P. H. Vance. Crew Scheduling, Cutting Stock, and Column Generation: Solving Huge Integer Programs. PhD thesis, Georgia Institute of Technology, August 1993.

    Google Scholar 

  18. D. Wedelin. An algorithm for large scale 0–1 integer programming with application to airline crew scheduling. Annals of Operations Research, 57:283–301, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  19. A. Wool and T. Grossman. Computational experience with approxima-tion algorithms for the set covering problem. Technical Report CS94-25, Weizmann Institute of Science, Faculty of Mathematical Sciences, Jan. 1, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institute for Computer Science, Saarbrücken, Germany

    Peter Sanders

  2. Chalmers University of Technology, Computing Science, Göteborg, Sweden

    Tuomo Takkula & Dag Wedelin

Authors
  1. Peter Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tuomo Takkula
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dag Wedelin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Alfons Hoekstra Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Sanders, P., Takkula, T., Wedelin, D. (1999). High performance integer optimization for crew scheduling. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100560

Download citation

  • DOI: https://doi.org/10.1007/BFb0100560

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65821-4

  • Online ISBN: 978-3-540-48933-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation