Skip to main content

Schedule Synchronization for Public Transit Networks

  • Conference paper
Computer-Aided Transit Scheduling

Part of the book series: Lecture Note in Economics Mathematical Systems ((LNE,volume 308))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Domschke, W.: Minimierung der Wartezeiten für Umsteiger im öffentlichen Nahverkehr. Unpublished manuscript, Technical University Darmstadt, Darmstadt 1988.

    Google Scholar 

  2. Domschke, W.; Drexl, A.: Logistik: Standorte. 2. Auflage, Oldenbourg; München, Wien 1985.

    Google Scholar 

  3. Noltemeier, H.: Graphentheorie mit Algorithmen und Anwendungen. Berlin, New York 1976.

    Google Scholar 

  4. Pape, U.: Algorithm 562 — Shortest path length (H). ACM Transact. on Math. Software 6 (1980), 450–455.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics