Maintenance Routing for Train Units: The Transition Model

Authors:
Gábor Maróti;Leo Kroon
Affiliations:
CWI, Amsterdam, and NS Reizigers, Utrecht, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands;NS Reizigers, Utrecht, and Erasmus University, Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
Venue:
Transportation Science
Year:
2005

Citing 5
Cited 3

Flight scheduling and maintenance base planning

Management Science
The Four-Day Aircraft Maintenance Routing Problem

Transportation Science
The Aircraft Maintenance Routing Problem

Operations Research
Flight String Models for Aircraft Fleeting and Routing

Transportation Science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Efficient Circulation of Railway Rolling Stock

Transportation Science
Circulation of railway rolling stock: a branch-and-price approach

Computers and Operations Research
Evaluation of vehicle fleet maintenance management indicators by application of DEMATEL and ANP

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Train units need regular preventive maintenance. Given the train units that require maintenance in the forthcoming one to three days, the rolling stock schedule must be adjusted so that these urgent units reach the maintenance facility in time. Maróti and Kroon (2004) propose a model that requires a large amount of input data. In this paper we describe a less involved multicommodity flow type model for this maintenance routing problem. We study the complexity of the problem. It turns out that the feasibility problem for a single urgent train unit is polynomially solvable but the optimization version is NP-hard. Finally, we report our computational experiments on practical instances of NS Reizigers, the main Dutch operator of passenger trains.