Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Assignment Based Resource Constrained Path Generation for Railway Rolling Stock Optimization

  • 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.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Boris GrimmORCiD, Ralf BorndörferORCiD, Julian Bushe
Document Type:In Proceedings
Parent Title (English):23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)
Volume:115
First Page:13:1
Last Page:13:15
Series:Open Access Series in Informatics (OASIcs)
Publisher:Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication:Dagstuhl, Germany
Fulltext Url:https://drops.dagstuhl.de/storage/01oasics/oasics-vol115-atmos2023/OASIcs.ATMOS.2023.13/OASIcs.ATMOS.2023.13.pdf
Year of first publication:2023
DOI:https://doi.org/https://doi.org/10.4230/OASIcs.ATMOS.2023.13
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.