The Maintenance Location Choice Problem for Railway Rolling Stock

12/08/2020
by   Jordi Zomer, et al.
0

Due to increasing railway use, the capacity at railway yards and maintenance locations is becoming limiting to accommodate existing rolling stock. To reduce capacity issues at maintenance locations during nighttime, railway undertakings consider performing more daytime maintenance, but the choice at which locations personnel needs to be stationed for daytime maintenance is not straightforward. Among other things, it depends on the planned rolling stock circulation and the maintenance activities that need to be performed. This paper presents the Maintenance Location Choice Problem (MLCP) and provides a Mixed Integer Linear Programming model for this problem. The model demonstrates that for a representative rolling stock circulation from the Dutch railways a substantial amount of maintenance activities can be performed during daytime. Also, it is shown that the location choice delivered by the model is robust under various time horizons and rolling stock circulations. Moreover, the running time for optimizing the model is considered acceptable for planning purposes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2021

The Maintenance Scheduling and Location Choice Problem for Railway Rolling Stock

Due to increasing railway use, the capacity at railway yards and mainten...
research
10/17/2016

Weekly maintenance scheduling using exact and genetic methods

The weekly maintenance schedule specifies when maintenance activities sh...
research
06/07/2022

Singapore Soundscape Site Selection Survey (S5): Identification of Characteristic Soundscapes of Singapore via Weighted k-means Clustering

The ecological validity of soundscape studies usually rests on a choice ...
research
01/27/2020

Long term planning of military aircraft flight and maintenance operations

We present the Flight and Maintenance Planning (FMP) problem in its mili...
research
03/09/2019

Towards Software Analytics: Modeling Maintenance Activities

Lehman's Laws teach us that a software system will become progressively ...
research
12/13/2018

Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants

Scheduling the maintenances of nuclear power plants is a complex optimiz...
research
07/27/2017

An Evolutionary Stochastic-Local-Search Framework for One-Dimensional Cutting-Stock Problems

We introduce an evolutionary stochastic-local-search (SLS) algorithm for...

Please sign up or login with your details

Forgot password? Click here to reset