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

Please always quote using this URN: urn:nbn:de:0297-zib-73868
accepted for publication
  • 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.

Download full text files

Export metadata

Metadaten
Author:Fabian Löbel, Niels LindnerORCiD, Ralf BorndörferORCiD
Document Type:ZIB-Report
Tag:Integrated Passenger Routing; Periodic Event Scheduling Problem; Periodic Timetabling; Shortest Routes in Public Transport
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
CCS-Classification:J. Computer Applications
Date of first Publication:2019/07/05
Series (Serial Number):ZIB-Report (19-36)
ISSN:1438-0064