Skip to main content
SpringerLink
Log in

Integrated Line Planning and Passenger Routing: Connectivity and Transfers

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

The integrated line planning and passenger routing problem is an important planning problem in service design of public transport. A major challenge is the treatment of transfers. In this paper we show that analysing the connectivity aspect of a line plan gives a new idea how to integrate a transfer handling.

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

Access this chapter

Log in via an institution
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

References

  1. Balakrishnan, A., Mangnanti, T.L., Mirchandani, P.: Network design. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, chapter 18, pp. 311–334. Wiley, Chichester (1997)

    Google Scholar 

  2. Borndörfer, R., Friedow, I., Karbstein, M.: Optimierung des Linienplans 2010 in Potsdam. Der Nahverkehr 30(4), 34–39 (2012)

    Google Scholar 

  3. Borndörfer, R., Hoàng, N.D., Karbstein, M., Koch, T., Martin, A.: How many Steiner terminals can you connect in 20 years? In: Jünger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization; Festschrift for Martin Grötschel, pp. 215–244. Springer (2013)

    Google Scholar 

  4. Borndörfer, R., Karbstein, M.: Metric inequalities for routings on direct connections with application to line planning. Discrete Optimization, 18, pp. 56–73 (2015)

    Google Scholar 

  5. Borndörfer, R., Karbstein, M., Pfetsch, M.E.: The Steiner connectivity problem. Math. Program. 142(1), 133–167 (2013)

    Article  Google Scholar 

  6. Bussieck, M.R.: Optimal lines in public rail transport. Ph.D. thesis, TU Braunschweig (1997)

    Google Scholar 

  7. Karbstein, M.: Line planning and connectivity. Ph.D. thesis, TU Berlin (2013)

    Google Scholar 

Download references

Acknowledgments

The work of Marika Karbstein was supported by the DFG Research Center Matheon “Mathematics for key technologies”

Author information

Authors and Affiliations

  1. Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany

    Marika Karbstein

Authors
  1. Marika Karbstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marika Karbstein .

Editor information

Editors and Affiliations

  1. Operations Research, RWTH Aachen University, Aachen, Germany

    Marco Lübbecke

  2. Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany

    Arie Koster

  3. RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Peter Letmathe

  4. E.ON Energy Research Center, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Reinhard Madlener

  5. Management Science, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Britta Peis

  6. Chair of Operations Management, RWTH Aachen University, Aachen, Germany

    Grit Walther

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Karbstein, M. (2016). Integrated Line Planning and Passenger Routing: Connectivity and Transfers. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_37

Download citation

Publish with us

Policies and ethics

Search

Navigation