Routing of Railway Carriages

Peter Brucker, Johann L. Hurink, Thomas Rolfes

Research output: Contribution to journalArticleAcademicpeer-review

28 Citations (Scopus)
8 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. The problem is formulated as an integer multi-commodity network flow problem with nonlinear objective function. We will present a local search approach for this NP-hard problem. The approach uses structural properties of the integer multi-commodity network flow formulation of the problem. Computational results for a real world instance are given.
Original languageEnglish
Pages (from-to)313-332
Number of pages20
JournalJournal of global optimization
Volume27
Issue number2-3
DOIs
Publication statusPublished - Nov 2003

Fingerprint

Dive into the research topics of 'Routing of Railway Carriages'. Together they form a unique fingerprint.

Cite this