Railway Track Allocation - Simulation, Aggregation, and Optimization

Please always quote using this URN: urn:nbn:de:0297-zib-14031
  • Today the railway timetabling process and the track allocation is one of the most challenging problems to solve by a railway company. Especially due to the deregulation of the transport market in the recent years several suppliers of railway traffic have entered the market in Europe. This leads to more potential conflicts between trains caused by an increasing demand of train paths. Planning and operating railway transportation systems is extremely hard due to the combinatorial complexity of the underlying discrete optimization problems, the technical intricacies, and the immense size of the problem instances. In order to make best use of the infrastructure and to ensure economic operation, efficient planning of the railway operation is indispensable. Mathematical optimization models and algorithms can help to automatize and tackle these challenges. Our contribution in this paper is to present a renewed planning process due to the liberalization in Europe and an associated concept for track allocation, that consists of three important parts, simulation, aggregation, and optimization. Furthermore, we present results of our general framework for real world data.

Download full text files

Export metadata

  • Export Bibtex
Author:Ralf Borndörfer, Thomas Schlechte, Elmar Swarat
Document Type:ZIB-Report
Tag:railway models, railway capacity, track allocation framework
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C08 Special problems of linear programming (transportation, multi-index, etc.)
Date of first Publication:2011/09/22
Series (Serial Number):ZIB-Report (11-35)
Published in:Appeared in: Proc. 1st International Workshop on High-speed and Intercity Railways (IWHIR 2011), Yi-Qing Ni and Xiao-Wei Ye (eds.) 2012, pp. 53-70,
Licence (German):License LogoCreative Commons - Namensnennung

$Rev: 13581 $