The Restricted Modulo Network Simplex Method for Integrated Periodic Timetabling and Passenger Routing

Fabian Löbel (), Niels Lindner () and Ralf Borndörfer ()
Additional contact information
Fabian Löbel: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Niels Lindner: Konrad-Zuse-Zentrum für Informationstechnik Berlin
Ralf Borndörfer: Konrad-Zuse-Zentrum für Informationstechnik Berlin

A chapter in Operations Research Proceedings 2019, 2020, pp 757-763 from Springer

Abstract: Abstract The Periodic Event Scheduling Problem is a well-studied NP-hard problem with applications in public transportation to find good periodic timetables. Among the most powerful heuristics to solve the periodic timetabling problem is the modulo network simplex method. In this paper, we consider the more difficult version with integrated passenger routing and propose a refined integrated variant to solve this problem on real-world-based instances.

Keywords: Periodic event scheduling problem; Periodic timetabling; Integrated passenger routing; Shortest routes in public transport (search for similar items in EconPapers)
Date: 2020
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-030-48439-2_92

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

DOI: 10.1007/978-3-030-48439-2_92

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 ().