Abstract
With the aim of supporting the process of adapting railway infrastructure to present and future traffic needs, we have developed a method to build train timetables efficiently. In this work, we describe the problem in terms of constraints derived from railway infrastructure, user requirements and traffic constraints, and we propose a method to solve it efficiently. This method carries out the search by assigning values to variables in a given order and verifying the satisfaction of constraints where these are involved. When a constraint is not satisfied, a guided backtracking is done. The technique reduces the search space allowing us to solve real and complex problems efficiently.
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
Bussieck, M.R., Winter, T., Zimmermann, U.T.: Discrete optimization in public rail transport. Math. Programming 79(1-3), 415–444 (1997)
Cordeau, J.F., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation Science 32(4), 380–404 (1998)
Chiu, C.K., Chou, C.M., Lee, J.H.M., Leung, H.F., Leung, Y.W.: A constraint based interactive train rescheduling tool. Constraints 7, 167–198 (2002)
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, vol. 92, p. 1. Elsevier, Amsterdam (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 (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, vol. 92, p. 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, vol. 92, p. 1. Elsevier, Amsterdam (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
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ingolotti, L., Barber, F., Tormos, P., Lova, A., Salido, M.A., Abril, M. (2004). An Efficient Method to Schedule New Trains on a Heavily Loaded Railway Network. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive