### Refine

#### Document Type

- Article (2)
- In Proceedings (2)
- Book (1)
- ZIB-Report (1)

#### Language

- English (6)

#### Is part of the Bibliography

- no (6)

#### Keywords

#### Institute

We consider the following freight train routing problem (FTRP). Given is a
transportation network with fixed routes for passenger trains and a
set of freight trains (requests), each defined by an origin and
destination station pair. The objective is to calculate a feasible
route for each freight train such that a sum of all expected delays and
all running times is minimal. Previous research concentrated on
microscopic train routings for junctions or inside major stations. Only
recently approaches were developed to tackle larger corridors or even
networks. We investigate the routing problem from a strategic
perspective, calculating the routes in a macroscopic transportation
network of Deutsche Bahn AG. Here macroscopic refers to an aggregation of
complex real-world structures are into fewer network elements. Moreover, the
departure and arrival times of freight trains are approximated.
The problem has a strategic
character since it asks only for a coarse routing through the network
without the precise timings. We give a mixed-integer nonlinear programming~(MINLP)
formulation for FTRP, which is a multi-commodity flow model on a time-expanded
graph with additional routing constraints. The model's nonlinearities are due to
an algebraic approximation of the delays of the trains on the arcs of
the network
by capacity restraint functions. The MINLP is reduced to a mixed-integer linear model~(MILP)
by piecewise linear approximation. The latter is solved by a state of the art MILP solver for various real-world test instances.

We consider the following freight train routing problem (FTRP).
Given is a transportation network with fixed routes for passenger
trains and a set of freight trains (requests), each defined by an
origin and destination station pair. The objective is to
calculate a feasible route for each freight train such that the
sum of all expected delays and all running times is minimal.
Previous research concentrated on microscopic train routings for
junctions or inside major stations. Only recently approaches were
developed to tackle larger corridors or even networks. We
investigate the routing problem from a strategic perspective,
calculating the routes in a macroscopic transportation network of
Deutsche Bahn AG. In this context, macroscopic refers to an
aggregation of complex and large real-world structures into fewer
network elements. Moreover, the departure and arrival times of
freight trains are approximated. The problem has a strategic
character since it asks only for a coarse routing through the
network without the precise timings. We provide a mixed-integer
nonlinear programming (MINLP) formulation for the FTRP, which is
a multicommodity flow model on a time-expanded graph with
additional routing constraints. The model’s nonlinearities
originate from an algebraic approximation of the delays of the
trains on the arcs of the network by capacity restraint
functions. The MINLP is reduced to a mixed-integer linear
model (MILP) by piecewise linear approximation. The latter is
solved by a state-of-the art MILP solver for various real-world
test instances.

Deutsche Bahn (DB) operates a large fleet of rolling stock (locomotives, wagons, and train sets) that must be combined into trains to perform rolling stock rotations. This train composition is a special characteristic of railway operations that distinguishes rolling stock rotation planning from the vehicle scheduling problems prevalent in other industries. DB models train compositions using hyperarcs. The resulting hypergraph models are ad-dressed using a novel coarse-to-fine method that implements a hierarchical column genera-tion over three levels of detail. This algorithm is the mathematical core of DB’s fleet em-ployment optimization (FEO) system for rolling stock rotation planning. FEO’s impact within DB’s planning departments has been revolutionary. DB has used it to support the company’s procurements of its newest high-speed passenger train fleet and its intermodal cargo locomotive fleet for cross-border operations. FEO is the key to successful tendering in regional transport and to construction site management in daily operations. DB’s plan-ning departments appreciate FEO’s high-quality results, ability to reoptimize (quickly), and ease of use. Both employees and customers benefit from the increased regularity of operations. DB attributes annual savings of 74 million euro, an annual reduction of 34,000 tons of CO2 emissions, and the elimination of 600 coupling operations in cross-border operations to the implementation of FEO.

This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art.
There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover:
Simulation
Capacity Assessment
Network Design
Train Routing
Robust Timetabling
Event Scheduling
Track Allocation
Blocking
Shunting
Rolling Stock
Crew Scheduling
Dispatching
Delay Propagation