Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling

摘要

The aim of the train timetabling problem is to find a conflict freetimetable for a set of passenger and freight trains along their routes in aninfrastructure network. Several constraints like station capacities andtrain dependent running and headway times have to be satisfied.In this work we deal with large scale instances of the aperiodic traintimetabling problem for the German railway network. The problem is modelledin a classical way via time discretised networks, its Lagrange-dual issolved by a bundle method. In order to handle the enormous number ofvariables and constraints dynamic graph generation and dynamic rollinghorizon techniques are employed.