Abstract
The paper presents an optimization model for cyclic railway timetabling that extends the feasibility model by Schrijver and Steenbeek (1994). We use a mixed integer non-linear programming formulation for the problem, where the integer variables correspond to cycles in the graph induced by the constraints. Objective functions are proposed for minimizing passengers’ travel time, maximizing the robustness of the timetable, and minimizing the number of trains needed to operate the timetable. We show how to approximate the non-linear part of the formulation, thereby transforming it into a mixed integer linear programming problem. Furthermore, we describe preprocessing procedures that considerably reduce the size of the problem instances. The usefulness and practical applicability of the formulation and the objective functions is illustrated by several variants of an instance representing the Dutch intercity train network.1
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.
Bibliography
Goverde, R.M.P. (1999). Improving punctuality and transfer reliability by railway timetable optimization. In P.H.L. Bovy (Ed.), Proceedings TRAIL 5th Annual Congress, 2, Delft.
Hassin, R. (1996). A flow algorithm for network synchronization. Operations Research 44, 570–579.
Hurkens, C. (1996). Een polyhedrale aanpak van treinrooster problemen (A polyhedral approach to railway timetabling problems). Unpublished. In Dutch.
ILOG (2001). ILOG CPLEX. http://www.Ilog.Com/products/cplex/, 07.04.2001.
Kroon, L.G. and L.W.P. Peeters (1999). A variable running time model for cyclic railway timetabling. Erasm management report series 28–1999, Erasm, Rotterdam, The Netherlands.
Lindner, T. (2000). Train Schedule Optimization in Public Rail Transport. Ph.D. thesis, Technical University Braunschweig, Braunschweig, Germany.
Nachtigall, K. (1999). Periodic Network Optimization and Fixed Interval Timetables. Habilitation thesis, University Hildesheim.
Odijk, M.A. (1996). A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research B 30, 455–464.
Odijk, M.A. (1997). Railway Timetable Generation. Ph.D. thesis, Delft University of Technology, Delft, The Netherlands.
Peeters, L.W.P. (1999). An optimization approch to railway timetabling. In P.H.L. Bovy (Ed.), Proceedings TRAIL 5th Annual Congress, 1, Delft.
Rockafellar, R.T. (1984). Network Flows and Monotropic Optimization. Wiley, New York.
Schrijver, A. (1986). Theory of Linear and Integer Programming. Wiley, New York.
Schrijver, A. and A. Steenbeek (1994). Dienstregelingontwikkeling voor Railned (Timetable construction for Railned). Technical report, CWI, Center for Mathematics and Computer Science, Amsterdam. In Dutch.
Serafini, P. and W. Ukovich (1989). A mathematical model for periodic event scheduling problems. SIAM Journal of Discrete Mathematics 2, 550–581.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Peeters, L., Kroon, L. (2001). A Cycle Based Optimization Model for the Cyclic Railway Timetabling Problem. In: Voß, S., Daduna, J.R. (eds) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56423-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-56423-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42243-3
Online ISBN: 978-3-642-56423-9
eBook Packages: Springer Book Archive