Maintenance Routing for Train Units: The Transition Model

Gábor Maróti () and Leo Kroon ()
Additional contact information
Gábor Maróti: CWI, Amsterdam, and NS Reizigers, Utrecht, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
Leo Kroon: NS Reizigers, Utrecht, and Erasmus University, Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands

Transportation Science, 2005, vol. 39, issue 4, 518-525

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.

Keywords: rail transportation; maintenance routing (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1050.0116 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:39:y:2005:i:4:p:518-525

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().