@book{22fc060be8e84d8c9a488f22828d0097,

title = "Routing of railway carriages: A case study",

abstract = "In the context of organizing timetables for railway companies the following railway carriage routing problem occurs. Given a timetable containing rail links with departure and destination times/stations and the composition of the trains, find a routing of railway carriages such that the required carriages are always available when a train departs. We will present a local search approach for this routing problem for the railway carriages. The approach uses structural properties of an integer multi-commodity network flow formulation of the problem. Computational results for a real world instance are given.",

keywords = "IR-65686, EWI-3318, MSC-90B35",

author = "P. Brucker and Hurink, {Johann L.} and T. Rolfes",

note = "Imported from MEMORANDA",

year = "1999",

language = "Undefined",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1498",

}