Rolling Stock Rostering Optimization Under Maintenance Constraints
Rolling Stock Rostering Optimization Under Maintenance Constraints
- New search for: Giacco, Giovanni Luca
- New search for: D’Ariano, Andrea
- New search for: Pacciarelli, Dario
- New search for: Giacco, Giovanni Luca
- New search for: D’Ariano, Andrea
- New search for: Pacciarelli, Dario
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.
Document information
Rolling Stock Rostering Optimization Under Maintenance Constraints
Journal of Intelligent Transportation Systems ; 18 , 1 ; 95-105
2014-01-02
11 pages
Article (Journal)
Electronic Resource
English
Similar titles
MISTRAL - short- and mid-term rolling stock rostering for NMBS-SNCB
| IuD Bahn | 2007
Modelling constraints in automatic vehicle rostering - demands and possibilities
| British Library Conference Proceedings | 2004
| Engineering Index Backfile | 1896
Automated Rolling Stock Maintenance
| British Library Conference Proceedings | 2001
Airline Crew Rostering: Problem Types, Modeling, and Optimization
| Springer Verlag | 2004