OASIcs.ATMOS.2010.45.pdf
- Filesize: 0.54 MB
- 16 pages
Document
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
Authors
-
Part of:
Volume:
10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) (ATMOS 2010)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2010-09-01
Cite AsGet BibTex
Frank Fischer and Christoph Helmberg. Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 45-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/OASIcs.ATMOS.2010.45
https://doi.org/10.4230/OASIcs.ATMOS.2010.45
Abstract
The aim of the train timetabling problem is to find a conflict free
timetable for a set of passenger and freight trains along their routes in an
infrastructure network. Several constraints like station capacities and
train dependent running and headway times have to be satisfied.
In this work we deal with large scale instances of the aperiodic train
timetabling problem for the German railway network. The problem is modelled
in a classical way via time discretised networks, its Lagrange-dual is
solved by a bundle method. In order to handle the enormous number of
variables and constraints dynamic graph generation and dynamic rolling
horizon techniques are employed.
Keywords
- combinatorial optimization
- train-timetabling
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads