Solving large-scale train timetable adjustment problems under infrastructure maintenance possessions

During infrastructure maintenance possessions, commonly not all trains can operate, and the original timetable may have to be adjusted accordingly. To deliver the best service to passengers, operators have to coordinate adjustment measures dealing with multiple possessions at the network level. In this paper, we consider the Train Timetable Adjustment Problem (TTAP) and present a mixed integer programming (MIP) model for solving TTAP. In order to solve large-scale problems, such as national Dutch network, and design high-quality solutions, modelling extensions are needed. First, we apply three network aggregation techniques to decrease the problem size, which enables to solve instances on the complete Dutch network within satisfactory computation times. Second, we model turnaround activities for short-turned trains and test different strategies. Third, we introduce flexible short-turning possibilities to the MIP to possibly reduce the number of cancelled train lines. We test the proposed model on real-life cases of Netherlands Railways (NS) and assess the effect on computation times and solution quality. Also, we identify differences with current planners’ practice. Planners were positive about the quality of generated solutions and the computation speed. The current model can also be used to decide on combinations of time windows for possessions.