Publication Date:
2020-12-01
Description:
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.
Language:
English
Type:
reportzib
,
doc-type:preprint
Format:
application/pdf
Permalink