A New Method for Inserting Train Paths into a Timetable

TL;DR

This paper introduces a fast, scalable dynamic programming algorithm for inserting train paths into timetables, facilitating train rerouting and handling ad-hoc requests efficiently in complex railway networks.

Contribution

It presents a novel path-insertion algorithm that outputs multiple suitable train paths quickly, applicable to large networks and various operational scenarios.

Findings

Algorithm finds 8 suitable paths within 0.3 seconds for a 7-hour window

Uses macroscopic data, scalable to any network size

Demonstrated on a real railway line from Göteborg to Norway

Abstract

A seemingly simple, yet widely applicable subroutine in automated train scheduling is the insertion of a new train path to a timetable in a railway network. We believe it to be the first step towards a new train-rerouting framework in case of large disturbances or maintenance works. Other applications include handling ad-hoc requests and modifying train paths upon request from railway undertakings. We propose a fast and scalable path-insertion algorithm based on dynamic programming that is able to output multiple suitable paths. Our algorithm uses macroscopic data and can run on railway networks with any number of tracks. We apply the algorithm on the line from G\"oteborg S\"aven\"as to the Norwegian border at Kornsj\"o. For a time window of seven hours, we obtain eight suitable paths for a freight train within 0.3 seconds after preprocessing.