h1

TY  - THES
AU  - Spönemann, Jacob
TI  - Network design for railway infrastructure by means of linear programming
CY  - Aachen
PB  - Publikationsserver der RWTH Aachen University
M1  - RWTH-CONV-143651
SP  - XIV, 126 S. : graph. Darst.
PY  - 2013
N1  - Aachen, Techn. Hochsch., Diss., 2013
AB  - The network design problem for railway infrastructure NDRI aims to find a network of railway infrastructure which meets given traffic demands at the lowest possible design costs. This problem, for example, comes up in long-term infrastructure planning processes. Railway infrastructure is represented by a network consisting of nodes and arcs. Nodes represent stations, arcs lines connecting the stations. Traffic demand is represented by traffic flows consisting of train counts, source and sink nodes. Stations are assumed to be equipped with unbounded capacity to reduce complexity, so design issues are the network topology and the capacity of lines. Using macroscopic models for infrastructure and operation and a timetable independent model for the capacity consumption of traffic flows, NDRI is modeled as a non-linear multicommodity flow problem on a complete multi-graph. The model is transformed to a mixed integer linear programming problem, called NDRI-MIP, using configurations similar to cutting patterns used in the widely known cutting stock problem. Besides NDRI-MIP, another optimization model based on worst-case timetables is introduced. A network designed by these means provides an upper bound on the infrastructure needed to satisfy the given traffic demand. Both models use path flows instead of arc flows. This provides the opportunity to restrict the sets of routes, which are available to traffic flows, to sets which are reasonable in relation to practice. To improve the performance of the solution process some valid inequalities are presented and a branch-and-price approach for NDRI-MIP is introduced.
KW  - Ganzzahlige Optimierung (SWD)
KW  - Infrastruktur (SWD)
KW  - Eisenbahn (SWD)
KW  - Netzwerk (SWD)
KW  - lineare Optimierung (SWD)
LB  - PUB:(DE-HGF)11
UR  - https://publications.rwth-aachen.de/record/210582
ER  -