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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
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 Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3315, pp. 164–173). Springer Verlag. https://doi.org/10.1007/978-3-540-30498-2_17
Mendeley helps you to discover research relevant for your work.