Abstract
When a train arrives at a station, it often stops for some time before continuing, giving rise to a window of relief opportunities (WRO), during which the train may be handed over between drivers. Incorporating these windows into the scheduling model may help improve the robustness and efficiency of driver schedules. However, if it is formulated as a set covering problem, the incorporation of WROs would cause the resulting model to be too big to be solved in realistic times with current technology.
In this paper, we propose a combined integer programming and local search approach. In the first step, WROs are approximated, and the problem is solved using integer programming. Using the solution thus obtained as a starting point, WROs are restored and a multi-neighbourhood local search algorithm takes over. We also investigate the possibility of deriving a new set of approximations from the local search solution, and loop back to the integer programming phase.
The algorithm is tested using real-life data from a large rail network in Scotland, producing improved, operational schedules for this network.
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
Ageeva, Y.: Approaches to Incorporating Robustness into Airline Scheduling. Master’s Thesis. Massachusetts Institute of Technology (2000)
Ehrgott, M., Ryan, D.M.: Constructing Robust Crew Schedules with Bicriteria Optimization. J. Multi-Criteria Decision Anal. 11, 139–150 (2002)
Fores, S., Proll, L., Wren, A.: Experiences with a Flexible Driver Scheduler. In: Voss, S., Daduna, J.R. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 137–152. Springer, Berlin (2001)
Glover, F.: Tabu Search—Part I. ORSA J. Comput. 1, 190–206 (1989)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
Kwan, A.S.K., Parker, M.E., Kwan, R.S.K., Fores, S., Proll, L., Wren, A.: Recent Advances in TRACS. In: Proc. 9th Int. Conf. on Computer-Aided Scheduling of Public Transport (2004)
Kwan, R.S.K.: Bus and Train Driver Scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 51, CRC Press, Boca Raton (2004)
Shen, Y.: Tabu Search for Bus and Train Driver Scheduling with Time Windows. Ph.D. Thesis. School of Computing, University of Leeds (2001)
Shen, Y., Kwan, R.S.K.: Tabu Search for Driver Scheduling. In: Voss, S., Daduna, J.R. (eds.) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol. 505, pp. 121–135. Springer, Berlin (2001)
Wren, A., Fores, S., Kwan, A., Kwan, R., Parker, M., Proll, L.: A Flexible System for Scheduling Drivers. J. Scheduling 6, 437–455 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laplagne, I., Kwan, R.S.K., Kwan, A.S.K. (2005). A Hybridised Integer Programming and Local Search Method for Robust Train Driver Schedules Planning. In: Burke, E., Trick, M. (eds) Practice and Theory of Automated Timetabling V. PATAT 2004. Lecture Notes in Computer Science, vol 3616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593577_5
Download citation
DOI: https://doi.org/10.1007/11593577_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30705-1
Online ISBN: 978-3-540-32421-8
eBook Packages: Computer ScienceComputer Science (R0)