Skip to main navigation Skip to search Skip to main content

Routing of railway carriages: A case study

Research output: Book/Report › Report › Professional

274 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente
Number of pages22
Publication statusPublished - 1999

Publication series

NameMemorandum
PublisherDepartment of Applied Mathematics, University of Twente
No.1498
ISSN (Print)0169-2690

Access to Document

  • ReportFinal published version, 173 KB

    Fingerprint

    Dive into the research topics of 'Routing of railway carriages: A case study'. Together they form a unique fingerprint.
    View full fingerprint

    • Routing of Railway Carriages

      Brucker, P., Hurink, J. L. & Rolfes, T., Nov 2003, In: Journal of global optimization. 27, 2-3, p. 313-332 20 p.

      Research output: Contribution to journal › Article › Academic › peer-review

      Open Access
      File
      32   Link opens in a new tab Citations (Scopus)
      102 Downloads (Pure)

    Cite this