Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Solving crew scheduling problems by constraint programming

  • Applications
  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP '95 (CP 1995)

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

Abstract

Programming by linear constraints makes it possible to express complex problems of operations research. However, real industrial problems cannot be solved in a reasonable amount of time if one insists on coding everything only in constraint programming languages.

We have experienced this fact in the case of the Airline and bus Crew Scheduling problem. We propose a method based on constraint programming with a part of the implementation written in C. This allows us to solve more easily and also as efficiently as the best existing programs, difficult problems (300 flights and 500000 pairings). This program is currently used for a French airline company.

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. M.L. Balinski and R.E. Gomory, “A mutual primal-dual simplex method”, Recent Advances in Mathematical Programming, McGraw-Hill, pp 17–26, (1963).

    Google Scholar 

  2. R.E. Bixby, “Progress in linear programming”, ORSA journal on computing, vol. 6, No. 1, (1994), pp. 15–22.

    Google Scholar 

  3. V. Chvàtal, “Linear Programming”, W.H. Freeman and Company editors, New York, 1983.

    Google Scholar 

  4. J.J. Forrest, D. Goldfarb, “Steepest-edge simplex algorithms for linear programming”, Mathematical Programming, 57, p. 341–374, 1992.

    Article  Google Scholar 

  5. K.L. Hoffman and M. Padberg, “Solving airline crew sheduling by Branch and Cut”, Management Science vol. 39, No. 6, June 1993, 657–682.

    Google Scholar 

  6. Roseaux, “Exercices et problemes resolus de recherche operationnelle (T3: programmation linéaire et extensions; problèmes classiques”, Masson, Paris 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de la Méditerranée, 163 avenue de Luminy, 13288, Marseille cedex 09, France

    Nabil Guerinik & Michel Van Caneghem

  2. Prologia, case 919 Luminy, 13288, Marseille cedex 09, France

    Nabil Guerinik & Michel Van Caneghem

Authors
  1. Nabil Guerinik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Van Caneghem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guerinik, N., Van Caneghem, M. (1995). Solving crew scheduling problems by constraint programming. In: Montanari, U., Rossi, F. (eds) Principles and Practice of Constraint Programming — CP '95. CP 1995. Lecture Notes in Computer Science, vol 976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60299-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-60299-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60299-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation