Routing of railway carriages

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

Research output: Contribution to journalArticleAcademicpeer-review

26 Citations (Scopus)


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 languageUndefined
Article number10.1023/A:1024843208074
Pages (from-to)313-332
Number of pages20
JournalJournal of global optimization
Issue number2-3
Publication statusPublished - Nov 2003


  • MSC-90B35
  • EWI-6076
  • IR-63173

Cite this