Abstract
Mathematical programming approaches to driver scheduling have been reported at many previous workshops and have become the dominant approach to the problem. However the problem frequently is too large for mathematical programming to be able to guarantee an optimal schedule. TRACS II, developed at the University of Leeds, is one such mathematical programming-based scheduling system. Several improvements and alternative solution methods have now been incorporated into the mathematical programming component of the TRACS II system, including a column generation technique which implicitly considers many more valid shifts than standard linear programming approaches. All improvements and alternative strategies have been implemented into the mathematical programming component of TRACS II to allow different solution methods to be used where necessary, and to solve larger problems in a single pass, as well as to produce better solutions. Comparative results on real-world problems are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beale, E.M.L. (1968): Mathematical Programming in Practice. (Pitman) London.
Daduna, J.R./Branco, I./Paixáo, J.M.P. (eds), (1995): Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport, Computer-Aided Transit Scheduling. (Springer-Verlag) Berlin, Heidelberg, New York.
Desrochers, M./Gilbert, J./Sauve, M./Soumis, F. (1992): CREW-OPT: subproblem modelling in a column generation approach to urban crew scheduling. in: Desrochers, M./Rousseau, J.-M. (eds.): Computer-Aided Transit Scheduling. (Springer-Verlag) Berlin, Heidelberg, New York.
Desrochers, M./Rousseau, J.-M. (eds), (1992): Proceedings of the Fifth International Workshop on Computer-Aided Scheduling of Public Transport, Computer-Aided Transit Scheduling. (Springer-Verlag) Berlin, Heidelberg, New York.
Fores, S. (1996): Column Generation Approaches to Bus Driver Scheduling. PhD Thesis, University of Leeds.
Forrest, J.J./Goldfarb, D. (1992): Steepest edge simplex algorithms for linear programming. in: Mathematical Programming 57, 341 – 374.
Goldfarb, D./Reid, J.K. (1977): A practicable steepest-edge simplex algorithm. in: Mathematical Programming 12, 774 – 787.
Kwan, A.S.K./Kwan, R.S.K./Parker, M.E./Wren, A. (1996): Producing train driver shifts by computer, in: Allan, J./Brebbia, C.A./Hill, R.J./Sciutto, G./Sone, S. (eds.): Computers in Railways V, Vol. 1: Railway Systems and Management, (Computational Mechanics Publications) Southampton, Boston.
Marsten, R.E. (1974): An algorithm for large set partitioning problems. in: Management Science 20, 774 – 787.
Rousseau, J.-M. (1995): Results obtained with Crew-Opt, a column generation method for transit crew scheduling. in: Daduna, J.R./Branco, I./Paixáo, J.M.P. (eds.): Computer-Aided Transit Scheduling. (Springer-Verlag) Berlin, Heidelberg, New York.
Rousseau, J.-M./Blais, J.-Y. (1985): HASTUS: an interactive system for buses and crew scheduling. in: Rousseau, J.-M. (ed.): Computer Scheduling of Public Transport 2. (North-Holland) Amsterdam, New York, Oxford.
Sherali, H.D. (1982): Equivalent weights for lexicographic multi-objective programs: characterizations and computations. in: European Journal of Operations Research 18, 57 – 61.
Smith, B.M./Wren, A. (1988): A bus crew scheduling system using a set covering formulation. in: Transportation Research 22A 97 – 108.
Willers, W.P. (1995): Improved Algorithms for Bus Crew Scheduling, PhD Thesis, University of Leeds.
Willers, W.P./Proll, L.G./Wren, A. (1993): A dual strategy for solving the linear programming relaxation of a driver scheduling system. in: Annals of Operations Research 58, 519 – 531.
Wolfe, P. (1963): A technique for resolving degeneracy in linear programming. in: SIAM Journal 11, 205 – 211.
Wren, A./Kwan, R.S.K./Parker, M.E. (1994): Scheduling of rail driver duties. in: Murthy, T.K.S./Mellitt, B./Brebbia, C.A./Sciutto, G./Sone, S. (eds.): Computers in Railways IV, Vol. 2: Railway Operations. (Computational Mechanics Publications) Southampton, Boston.
Wren, A./Smith, B.M. (1988): Experiences with a crew scheduling system based on set covering. in: Daduna, J.R./Wren, A. (eds.): Computer-Aided Transit Scheduling. (Springer-Verlag) Berlin, Heidelberg, New York.
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
Fores, S., Proll, L., Wren, A. (1999). An Improved ILP System for Driver Scheduling. In: Wilson, N.H.M. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85970-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-85970-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65775-0
Online ISBN: 978-3-642-85970-0
eBook Packages: Springer Book Archive