Maintenance location routing for rolling stock under line and fleet planning uncertainty

Rolling stock needs regular maintenance in a maintenance facility. Rolling stock from different fleets are routed tomaintenance facilities by interchanging the destinations of trains at common stations and by using empty drives. We consider the problem of locating maintenance facilities in a railway network under uncertain or changing line planning, fleet planning, and other uncertain factors. These uncertainties and changes are modeled by a discrete set of scenarios. We show that this new problem is NP-hard and provide a twostage stochastic programming and a two-stage robust optimization formulation. The secondstage decision is a maintenance routing problem with similarity to a minimum cost-flow problem.We prove that the facility location decisions remain unchanged under a simplified routing problem, and this gives rise to an efficient mixed-integer programming (MIP) formulation. This result also allows us to find an efficient decomposition algorithm for the robust formulation based on scenario addition (SA). Computational work shows that our improved MIP formulation can efficiently solve instances of industrial size. SA improves the computational time for the robust formulation even further and can handle larger instances due to more efficientmemory usage. Finally, we apply our algorithms on practical instances of the Netherlands Railways and give managerial insights.