Skip to main content
Book cover

Integrating Routing Decisions in Public Transportation Problems

  • Book
  • © 2014

Overview

  • Provides insight into which factors influence public transportation problems via extensive complexity analysis
  • Contains a new model for customer-oriented public transportation problems, resulting in more objective solutions
  • Provides a framework in which methods for optimization and routing can be combined to solve network problems with integrated routing
  • Presents exact integer programming approaches as well as a heuristic approach which alternates traffic assignment and optimization steps

Part of the book series: Springer Optimization and Its Applications (SOIA, volume 89)

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

Access this book

eBook USD 19.99 USD 39.99
50% discount Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 29.99 USD 54.99
45% discount Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 29.99 USD 54.99
45% discount Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

Keywords

About this book

This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously.

This work is technically deep, with insightful finding regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems.

The book models line planning, timetabling and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing step is proposed to solve the problems.

Authors and Affiliations

  • Institute for Numerical and Applied Math, University of Göttingen, Göttingen, Germany

    Marie E. Schmidt

Bibliographic Information

Publish with us