Routing of railway carriages

Autor(en): Brucker, P
Hurink, J
Rolfes, T
Stichwörter: local search; Mathematics; Mathematics, Applied; multi-commodity flow; NETWORK DESIGN; Operations Research & Management Science; railway scheduling
Erscheinungsdatum: 2003
Herausgeber: SPRINGER
Journal: JOURNAL OF GLOBAL OPTIMIZATION
Volumen: 27
Ausgabe: 2-3
Startseite: 313
Seitenende: 332
Zusammenfassung: 
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.
Beschreibung: 
International Workshop on Optimization with High Technology Applications, HONG KONG, PEOPLES R CHINA, OCT 23-25, 2000
ISSN: 09255001
DOI: 10.1023/A:1024843208074

Show full item record

Page view(s)

1
Last Week
0
Last month
1
checked on Feb 22, 2024

Google ScholarTM

Check

Altmetric