Abstract
Quality of public transit is characterized by different features such as cycles (headways), accessibility, direct relations. The attractiveness of the public transportation system can be improved if a demand oriented route network with fixed cycle operation is additionally tuned concerning the dispatch aspect so that transfer times are minimized.
Attractiveness of public transit can be evidently improved by optimum schedule synchronization without noteworthy investment. Optimum synchronization means minimizing transfer cost (passengers * waiting time) of transfer points. This special operational control task should be integrated into computer aided scheduling; prerequisite is a dialogue-oriented implementation which allows dispatching in form of sensitivity analysis, i.e. direct evaluation of computation results on a work-station.
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
Domschke, W.: Minimierung der Wartezeiten für Umsteiger im öffentlichen Nahverkehr. Unpublished manuscript, Technical University Darmstadt, Darmstadt 1988.
Domschke, W.; Drexl, A.: Logistik: Standorte. 2. Auflage, Oldenbourg; München, Wien 1985.
Noltemeier, H.: Graphentheorie mit Algorithmen und Anwendungen. Berlin, New York 1976.
Pape, U.: Algorithm 562 — Shortest path length (H). ACM Transact. on Math. Software 6 (1980), 450–455.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klemt, WD., Stemme, W. (1988). Schedule Synchronization for Public Transit Networks. In: Daduna, J.R., Wren, A. (eds) Computer-Aided Transit Scheduling. Lecture Note in Economics Mathematical Systems, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85966-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-85966-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19441-5
Online ISBN: 978-3-642-85966-3
eBook Packages: Springer Book Archive