Abstract
Consider a railway network where all trains arrive and depart regularly. We discuss the task to find a timetable which minimizes network caused waiting times for passengers changing lines. A usual approach in the railway literature is to minimize a weighted sum of waiting times arising at a selected class of change opportunities.
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
P. Brucker, R. Burkard, and J. Hurink, Cyclic schedules for r irregularly oc-curing events, Journal of Computational and Applied Mathematics, 30 (1990), pp. 173–189.
P. Brucker and J. Hurink, A railway scheduling problem, Zeitschrift fdr Operations Research, (1986), pp. 223–227.
R. E. Burkard, Optimal schedules for periodically recurring events, Discrete Applied Mathematics, (1986), pp. 167–180.
M. Gondran and M. Minoux, Graphs and algorithms., J. Wiley sons, 1984.
K. Nachtigall, Time periodic network optimization, Hildesheimer Informatik-Berichte, 8 /93 (1993).
A. Schrijver, Theory of linear and integer programming., J. Wiley and sons, Chichester New York Brisbane Toronto Singapore, 1986.
P. Serafini and W. Ukovich, A mathematical model for periodic scheduling problems, SIAM J. Discrete Math., 2 (1989), pp. 550–581.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Physica-Verlag Heidelberg
About this paper
Cite this paper
Nachtigall, K. (1994). Periodic networks and railway scheduling. In: Bachem, A., Derigs, U., Jünger, M., Schrader, R. (eds) Operations Research ’93. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-46955-8_86
Download citation
DOI: https://doi.org/10.1007/978-3-642-46955-8_86
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0794-3
Online ISBN: 978-3-642-46955-8
eBook Packages: Springer Book Archive