Routing of railway carriages: A case study

P. Brucker, Johann L. Hurink, T. Rolfes

Research output: Book/ReportReportOther research output

89 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 1999

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • IR-65686
  • EWI-3318
  • MSC-90B35

Cite this