The Modulo Network Simplex with Integrated Passenger Routing

Ralf Borndörfer (), Heide Hoppmann (), Marika Karbstein () and Fabian Löbel ()
Additional contact information
Ralf Borndörfer: Zuse Institute
Heide Hoppmann: Zuse Institute
Marika Karbstein: Zuse Institute
Fabian Löbel: Zuse Institute

A chapter in Operations Research Proceedings 2016, 2018, pp 637-644 from Springer

Abstract: Abstract Periodic timetabling is an important strategic planning problem in public transport. The task is to determine periodic arrival and departure times of the lines in a given network, minimizing the travel time of the passengers. We extend the modulo network simplex method (Nachtigall and Opitz, Solving periodic timetable optimisation problems by modulo simplex calculations 2008 [6]), a well-established heuristic for the periodic timetabling problem, by integrating a passenger (re)routing step into the pivot operations. Computations on real-world networks show that we can indeed find timetables with much shorter total travel time, when we take the passengers’ travel paths into consideration.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-55702-1_84

Ordering information: This item can be ordered from
http://www.springer.com/9783319557021

DOI: 10.1007/978-3-319-55702-1_84

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().