Abstract
We present an interactive application to assist planners in adding new trains on a complex railway network. It includes many trains with different characteristics, whose timetables cannot be modified because they are already in circulation. The application builds the timetable for new trains linking the available time slots to trains to be scheduled. A very flexible interface allows the user to specify the parameters of the problem. The resulting problem is formulated as a CSP and efficiently solved. The solving method carries out the search assigning values to variables in a given order verifying the satisfaction of constraints where these are involved. When a constraint is not satisfied, a guided backtracking is done. Finally, the resulting timetable is delivered to the user who can interact with it, guaranteeing the traffic constraint satisfaction.
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
Bussieck, M.R., Winter, T., Zimmermann, U.T.: Discrete optimization in public rail transport. Math. Programming 79(1-3), 415–444 (1997)
Chiu, C.K., Chou, C.M., Lee, J.H.M., Leung, H.F., Leung, Y.W.: A constraint based interactive train rescheduling took. Constraints 7, 167–198 (2002)
Cordeau, J.F., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation Science 32(4), 380–404 (1998)
Koci, L., Di Stefano, G.: A graph theoretical approach to shunting problems. In: Proceedings of ATMOS 2003 Algorithmic Methods and Models for Optimization of Railways, Electronic Notes in Theoretical Computer Science, Elsevier 92, vol. 1 (2003)
Kreuger, P., Carlsson, J.O., Sjoland, T., Astrom, E.: The tuff train scheduler. In: Puebla, G. (ed.) Proceedings of the workshop on Tools and Environments for (Constraints) Logic Programming at the International Logic Programming Symposium ILPS’97 (1997)
Liebchen, C.: Symmetry for periodic railway timetables. In: Proceedings of ATMOS 2003 Algorithmic Methods and Models for Optimization of Railways, Electronic Notes in Theoretical Computer Science 92, vol. 1 (2003)
Mammana, M.F., Mecke, S., Wagner, D.: The station location problem on two intersecting lines. In: Proceedings of ATMOS 2003 Algorithmic Methods and Models for Optimization of Railways, Electronic Notes in Theoretical Computer Science, Elsevier 92, vol. 1 (2003)
Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2(4), 550–581 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lova, A., Tormos, P., Barber, F., Ingolotti, L., Salido, M.A., Abril, M. (2007). Intelligent Train Scheduling on a High-Loaded Railway Network. In: Geraets, F., Kroon, L., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds) Algorithmic Methods for Railway Optimization. Lecture Notes in Computer Science, vol 4359. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74247-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74247-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74245-6
Online ISBN: 978-3-540-74247-0
eBook Packages: Computer ScienceComputer Science (R0)