Abstract
The efficient use of infrastructures is a hard requirement for railway companies. Thus, the scheduling of trains should aim toward optimality, which is an NP-hard problem. The paper presents a friendly and flexible computer-based decision support system for railway timetabling. It implements an efficient method, based on meta-heuristic techniques, which provides railway timetables that satisfy a realistic set of constraints and, that optimize a multi-criteria objective function.
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
Cordeau, J., Toth, P., Vigo, D.: A survey of optimization models for train routing and scheduling. Transportation Science 32, 380–446 (1998)
Lova, A., Tormos, P., Barber, F., Ingolotti, L., Salido, M.A., Abril, M.: Intelligent Train Scheduling on a High-Loaded Railway Network. In: ATMOS 2004: Algorithmic Methods and Models for Optimization of Railways. LNCS. Springer, Heidelberg (2005)
MOM: Mdulo Optimizador de Mallas: http://www.dsic.upv.es/users/ia/gps/MOM/
Nachtigall, K., Voget, S.: Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks 103, 610–627 (1997)
Schrijver, A., Steenbeek, A.: Timetable construction for railned. Technical Report, CWI, Amsterdam, The Netherlands (in Dutch) (1994)
Schirmer, A., Riesenberg, S.: Parameterized heuristics for project scheduling- Biased random sampling methods. Technical Report 456. Institute für Betriebswirtschaftslehre der UNIVERSITÄT KIEL (1997)
Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics 2(4), 550–581 (1989)
Silva de Oliveira, E.: Solving Single-Track Railway Scheduling Problem Using Constraint Programming. Phd Thesis. Univ. of Leeds, School of Computing (2001)
Tormos, P., Lova, A.: A Competitive Heuristic Solution Technique For Resource-Constrained Project Scheduling. Annals Of Operations Research 102, 65–81 (2001)
Tormos, P., et al.: A Genetic Approach to Train Scheduling on a High-Traffic Railway Line. In: Algorithmic methods and Models for Optimization of railway SATMOS 2005. Electronic Notes in Theoretical Computer Science (to be appear)
Walker, C., Snowdon, J., Ryan, D.: Simultaneous disruption recovery of a train timetable and crew roster in real time. Comput. Oper. Res. 32(8), 2077–2094 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ingolotti, L., Lova, A., Barber, F., Tormos, P., Salido, M.A., Abril, M. (2006). New Heuristics to Solve the “CSOP” Railway Timetabling Problem. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_44
Download citation
DOI: https://doi.org/10.1007/11779568_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)