Routing of railway carriages

Share/Save/Bookmark

Brucker, P. and Hurink, J.L. and Rolfes, T. (2003) Routing of railway carriages. Journal of Global Optimization, 27 (2-3). pp. 313-332. ISSN 0925-5001

[img] PDF
Restricted to UT campus only
: Request a copy
289kB
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.
Item Type:Article
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63173
Official URL:http://dx.doi.org/10.1023/A:1024843208074
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page