Periodic Timetable Optimization

The planning process in public transport is a highly complex task. Currently, this can only be handled by splitting it into subtasks. These are grouped into two blocks: service planning (network design, line planning, timetabling) and operations planning (vehicle scheduling, duty scheduling, crew rostering). Only for the latter, algorithms have entered practice. A rich graph model (Periodic Event Scheduling Problem, PESP) for periodic timetabling has been known for several years. It even offers to integrate core aspects of vehicle scheduling. To solve the resulting MIP, several valid inequalities are known. There have even been first attempts to profit from short cycle bases. The goal of this project is to integrate further planning steps into the PESP, thus into a mixed-integer linear model. Further, we want to clarify to what extent short cycle bases are useful for periodic timetabling. Finally, we want to bring optimization techniques into practice by computing timetables that finally get into daily operation.

Category:

Education

Tags:

• 2010
• MIF
• B5
• en
• web
• Periodic
• Timetable
• Optimization
• berlin
• dfg
• research
• center
• matheon
• mathematicrolf
• möhring