Journal
JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS
Volume 18, Issue 1, Pages 95-105Publisher
TAYLOR & FRANCIS INC
DOI: 10.1080/15472450.2013.801712
Keywords
Maintenance; Railway Planning; Rolling Stock Circulation; Mixed-Integer Linear-Programming
Funding
- Italian Ministry of Research [RBIP06BZW8]
Ask authors/readers for more resources
This article presents a mixed-integer linear-programming formulation for integrating short-term maintenance planning in a network-wide railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires covering 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 maintenance tasks. We use a commercial MILP solver to compute efficient solutions in a short time. Experimental results on real-world scenarios from the main Italian railway company Trenitalia show that this integrated approach can reduce significantly the number of trains and empty runs when compared with the current rolling stock circulation plan.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available