The fundamental task of every passenger railway operator is to offer an attractive railway timetable to the passengers while operating it as cost efficiently as possible. The available rolling stock has to be assigned to trips so that all trips are operated, operational requirements are satisfied, and the operating costs are minimum. This so-called Rolling Stock Rotation Problem (RSRP) is well studied in the literature. In this paper we consider an acyclic version of the RSRP that includes vehicle maintenance. As the latter is an important aspect, maintenance services have to be planned simultaneously to ensure the rotation’s feasibility in practice. Indeed, regular maintenance is important for the safety and reliability of the rolling stock as well as enforced by law in many countries. We present a new integer programming formulation that links a hyperflow to model vehicle compositions and their coupling decisions to a set of path variables that take care of the resource consumption of the individual vehicles. To solve the model we developed different column generation algorithms which are compared to each other as well as to the MILP flow formulation of [Ralf Borndörfer et al., 2016] on a test set of real world instances.
Assignment Based Resource Constrained Path Generation for Railway Rolling Stock Optimization
2023-08-31
15 pages , 660108 byte
OASIcs, Vol. 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), pages 13:1-13:15
Conference paper
Electronic Resource
English
Engineering Index Backfile | 1928
|DINING CAR FOR RAILWAY ROLLING STOCK AND RAILWAY ROLLING STOCK
European Patent Office | 2021
|Method for controlling railway rolling stock and corresponding railway rolling stock
European Patent Office | 2024
|Railway rolling-stock developments
Engineering Index Backfile | 1923