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

  • 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.
Metadaten
Author:Fabian Löbel, Niels LindnerORCiD, Ralf BorndörferORCiD
Editor:Janis S. Neufeld, Udo Buscher, Rainer Lasch, Dominik Möst, Jörn Schönberger
Document Type:In Proceedings
Parent Title (English):Operations Research Proceedings 2019
First Page:757
Last Page:763
Publisher:Springer International Publishing
Place of publication:Cham
Year of first publication:2020
Preprint:urn:nbn:de:0297-zib-73868
DOI:https://doi.org/https://doi.org/10.1007/978-3-030-48439-2_92