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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M.L. Balinski and R.E. Gomory, “A mutual primal-dual simplex method”, Recent Advances in Mathematical Programming, McGraw-Hill, pp 17–26, (1963).
R.E. Bixby, “Progress in linear programming”, ORSA journal on computing, vol. 6, No. 1, (1994), pp. 15–22.
V. Chvàtal, “Linear Programming”, W.H. Freeman and Company editors, New York, 1983.
J.J. Forrest, D. Goldfarb, “Steepest-edge simplex algorithms for linear programming”, Mathematical Programming, 57, p. 341–374, 1992.
K.L. Hoffman and M. Padberg, “Solving airline crew sheduling by Branch and Cut”, Management Science vol. 39, No. 6, June 1993, 657–682.
Roseaux, “Exercices et problemes resolus de recherche operationnelle (T3: programmation linéaire et extensions; problèmes classiques”, Masson, Paris 1991.
Author information
Authors and Affiliations
Editor information
Rights 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