A model and strategy for train pathing with choice of lines, platforms, and routes

Abstract

Train pathing is concerned with assigning trains and train times for a set of rail links, stations stops, etc., so as to meet a system of constraints on headways, trip times, dwell times, etc. while minimizing delays or costs and meeting travel demands. In a previous paper we presented a model, algorithms, and strategy for pathing trains of different speeds and stopping patterns for a double track rail line dedicated to trains in one direction. Here we extend this to more general more complex rail networks, with choice of lines, station platforms, etc, as is more typical of the high density scheduled passenger railways in Britain and Europe. We apply the model to a small network and find acceptable solution times. Applying addition search strategies from the previous paper should reduce solution times by further orders of magnitude.