Nothing Special   »   [go: up one dir, main page]

Skip to main content

Line Planning on Path Networks with Application to the Istanbul Metrobüs

  • Conference paper
  • First Online:
Operations Research Proceedings 2016

Abstract

Bus rapid transit systems in developing and newly industrialized countries often consist of a trunk with a path topology. On this trunk, several overlapping lines are operated which provide direct connections. The demand varies heavily over the day, with morning and afternoon peaks typically in reverse directions. We propose an integer programming model for this problem, derive a structural property of line plans in the static (or single period) “unimodal demand” case, and consider approaches to the solution of the multi-period version that rely on clustering the demand into peak and off-peak service periods. An application to the Metrobüs system of Istanbul is discussed.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Similar content being viewed by others

References

  1. Borndörfer, R., Grötschel, M., Jaeger, U.: Planning problems in public transit. Production Factor Mathematics, pp. 95–122 (2010). doi:10.1007/978-3-642-11248-5

  2. Liebchen, C.: Linien-, Fahrplan-, Umlauf- und Dienstplanoptimierung: Wie weit können diese bereits integriert werden? In: Heureka’08. Stiftung Heureka, FGSV Verlag (2008)

    Google Scholar 

  3. McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceedings of ACM, KDD ’00, pp. 169–178. ACM, New York, NY, USA (2000). doi:10.1145/347090.347123

  4. PTV AG. http://vision-traffic.ptvgroup.com/en-us/products/ptv-visum/

  5. Torres, L.M., Torres, R., Borndörfer, R., Pfetsch, M.E.: Line Planning on paths and tree networks with applications to the quito trolebus system. In: Fischetti, M., Widmayer, P. (eds.) ATMOS’08, OpenAccess Series in Informatics (OASIcs), vol. 9. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2008). doi:10.4230/OASIcs.ATMOS.2008.1583. http://drops.dagstuhl.de/opus/volltexte/2008/1583

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ralf Borndörfer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Borndörfer, R. et al. (2018). Line Planning on Path Networks with Application to the Istanbul Metrobüs. In: Fink, A., Fügenschuh, A., Geiger, M. (eds) Operations Research Proceedings 2016. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-55702-1_32

Download citation

Publish with us

Policies and ethics