A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany

Abstract EN

With the aim of supporting the process of adapting railway infrastructure and future traffic needs, we have developed a method to insert additional trains efficiently to an existing timetable without introducing large consecutive delays to scheduled trains.

In this work, the problem is characterized as a job-shop scheduling problem.

In order to meet the limited time requirement and minimize deviations to the existing timetable, the modification that consists of retiming or reordering trains is implemented if and only if it potentially leads to a better solution.

With these issues in mind, the problem of adding train paths is decomposed into two subproblems.

One is finding the optimal insertion for a fixed order timetable and the other is reordering trains.

The two subproblems are solved iteratively until no improvement is possible within a time limit of computation.

An innovative branch and bound algorithm and iterative reordering strategy are proposed to solve this problem in real time.

Unoccupied capacities are utilized as primary resources for additional trains and the transfer connections for passengers can be guaranteed in the new timetable.

From numerical investigations, the proposed framework and associated techniques are tested and shown to be effective.