Abstract
We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumen- tal when modeling complex problem restrictions and, particularly, in efficiently searching the very large space of feasible solutions. The code was tested on real problem instances, containing an excess of 1:8 x 109 entries, which were solved to optimality in an acceptable running time when executing on a typical desktop PC.
Supported by FAPESP grant 98/05999-4, and CAPES.
Supported by FINEP (ProNEx 107/97), and CNPq (300883/94-3).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. E. Beasley and N. Christofides. An algorithm for the resource constrained shortest path problem. Networks, 19:379–394, 1989.
A. Caprara, M. Fischetti, and P. Toth. A heuristic method for the set covering problem. Technical Report OR-95-8, DEIS, Università di Bologna, 1995.
B. M. W. Cheng, K. M. F. Choi, J. H. M. Lee, and J. C. K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 1998. Accepted for publication.
K. Darby-Dowman and J. Little. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS Journal on Computing, 10(3), 1998.
M. Desrochers and F. Soumis. A column generation approach to the urban transit crew scheduling problem. Transportation Science, 23(1), 1989.
C. Gervet. Large Combinatorial Optimization Problems: a Methodology for Hybrid Models and Solutions. In JFPLC, 1998.
M. L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, (1):25–46, 1993.
N. Guerinik and M. Van Caneghem. Solving crew scheduling problems by constraint programming. In Lecture Notes in Computer Science, pages 481–498, 1995. Proceedings of the First International Conference on the Principles and Practice of Constraint Programming, CP’95.
J. Jourdan. Concurrent Constraint Multiple Models in CLP and CC Languages: Toward a Programming Methodology by Modeling. PhD thesis, Université Denis Diderot, Paris VII, February 1995.
J. Lever, M. Wallace, and B. Richards. Constraint logic programming for scheduling and planning. BT Technical Journal, (13):73–81, 1995.
C. R. Reeves, editor. Modern Heuristic Techniques for Combinatorial Problems. Wiley, 1993.
D. M. Ryan and B. A. Foster. An integer programming approach to scheduling. In A. Wren, editor, Computer Scheduling of Public Transport. North-Holland Publishing Company, 1981.
F. Vanderbeck. Decomposition and Column Generation for Integer Programming. PhD thesis, Université Catholique de Louvain, CORE, September 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yunes, T.H., Moura, A.V., de Souza, C.C. (1999). A Hybrid Approach for Solving Large Scale Crew Scheduling Problems. In: Pontelli, E., Santos Costa, V. (eds) Practical Aspects of Declarative Languages. PADL 2000. Lecture Notes in Computer Science, vol 1753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46584-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-46584-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66992-0
Online ISBN: 978-3-540-46584-3
eBook Packages: Springer Book Archive