Train Maintenence Routing
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F03%3A06094188" target="_blank" >RIV/68407700:21260/03:06094188 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Train Maintenence Routing
Original language description
We present an informal narrative and a formal model of the train maintenance routing problem. The problem to ve tackled is ad follows: There is a railway net. There are stations and lines in the net. Trains travel from station to station according to given schedule and rolling stock roster. Trains are composed of assemblies. There are several types of assemblies and several types of maintenances. Each assembly has to be maintained before a certain time interval between maintenance elapses, and at a limited numbers of maintenance stations. At stations pairs of assemblies may be exchanged.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Formal Methods for Railway Operation and Control Systems
ISBN
963 9457 45 0
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
313-322
Publisher name
L'Harmattan
Place of publication
Budapest
Event location
Budapest
Event date
May 15, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—