A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Rolling Stock Rostering Optimization Under Maintenance Constraints
2014
Journal of Intelligent Transportation Systems / Taylor & Francis
This paper presents a mixed-integer linear-programming formulation for integrating shortterm maintenance planning in a network-wide railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires to cover a given set of services and maintenance works with a minimum amount of rolling stock units. In our formulation, a rostering solution is viewed as a minimal cost Hamiltonian cycle in a graph with service pairings, empty runs and short-term
doi:10.1080/15472450.2013.801712
fatcat:tc4hsdp3pvadxh6az55dnrv43y