Rolling Stock Rostering Optimization Under Maintenance Constraints

Giovanni Luca Giacco, Andrea D'Ariano, Dario Pacciarelli
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
more » ... tasks. We use a commercial MIP solver to compute efficient solutions in a short time. Experimental results on real-world scenarios from 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.
doi:10.1080/15472450.2013.801712 fatcat:tc4hsdp3pvadxh6az55dnrv43y