A railway operator creates (rolling stock) rotations in order to have a precise master plan for the
operation of a timetable by railway vehicles. A rotation is considered as a cycle that multiply
traverses a set of operational days while covering trips of the timetable. As it is well known,
the proper creation of rolling stock rotations by, e.g., optimization algorithms is challenging
and still a topical research subject. Nevertheless, we study a completely different but strongly
related question in this paper, i.e.: How to visualize a rotation? For this purpose, we introduce
a basic handout concept, which directly leads to the visualization, i.e., handout of a rotation. In
our industrial application at DB Fernverkehr AG, the handout is exactly as important as the
rotation itself. Moreover, it turns out that also other European railway operators use exactly the
same methodology (but not terminology). Since a rotation can have many handouts of different
quality, we show how to compute optimal ones through an integer program (IP) by standard
software. In addition, a construction as well as an improvement heuristic are presented. Our
computational results show that the heuristics are a very reliable standalone approach to quickly
find near-optimal and even optimal handouts. The efficiency of the heuristics is shown via a
computational comparison to the IP approach.
[1]
S.,et al.
An Efficient Heuristic Procedure for Partitioning Graphs
,
2022
.
[2]
Ralf Borndörfer,et al.
Konrad-zuse-zentrum Für Informationstechnik Berlin a Hypergraph Model for Railway Vehicle Rotation Planning a Hypergraph Model for Railway Vehicle Rotation Planning *
,
2022
.
[3]
Konstantin Andreev,et al.
Balanced Graph Partitioning
,
2004,
SPAA '04.
[4]
H. Kuhn.
The Hungarian method for the assignment problem
,
1955
.
[5]
Brian W. Kernighan,et al.
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
,
1973,
Oper. Res..