Integrated Optimization of Railway Timetables and Rolling Stock Scheduling

This study presents an efficient approach for integrated railway timetabling and rolling stock planning. The method employs a slot graph and a maximal clique algorithm to generate a conflict-free timetable. When additional slots are required, a column generation procedure suggests alternative paths, improving network coverage. Rolling stock allocation is optimized through the use of fictive nodes and edges, minimizing resource consumption and reducing empty trips. Overall, this integrated framework simplifies timetable generation and resource management, offering a robust solution for complex railway networks.