Abstract
We are dealing with an application problem arising in a cooperation with the national German railway company. It occurs in the analysis of time table data and involves inferring the underlying railroad network and the actual travel route of the trains when only their time tables are known. The structural basis of our considerations in this paper is a directed graph constructed from train time tables, where train stations correspond to vertices, and where pairs of consecutive stops of trains correspond to edges. Determining the travel route of trains amounts to an edge classification problem in this graph. Exploiting the structure of the graph, we approach the edge classiffication problem by locating vertices that intuitively correspond to train stations where the underlying railroad network branches into several directions, and that induce a partition of the edge set into bundles.
We first describe the modeling process of the classification problem resulting in the bundle recognition problem. Given the NP-hardness of the corresponding optimization problem, we then present a heuristic that makes an educated guess at an initial vertex set of potential bundle end points which is then systematically improved. Finally, we perform a computational study using time table data from 13 European countries.
Partially supported by DFGgrant Wa 654/10-2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ulrik Brandes and Dorothea Wagner. Using Graph Layout to Visualize Train Interconnection Data. In Proceedings 6th International Symposium on Graph Drawing, pages 44–56. Springer Lecture Notes in Computer Science, vol. 1547, 1998.
Annegret Liebers, Dorothea Wagner, and Karsten Weihe. On the Hardness of Recognizing Bundles in Time Table Graphs. In Proceedings 25th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 325–337. Springer Lecture Notes in Computer Science, vol. 1665, 1999.
Frank Schulz, Dorothea Wagner, and Karsten Weihe. Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. In Proceedings 3rd Workshop on Algorithm Engineering, pages 110–123. Springer Lecture Notes in Computer Science, vol. 1668, 1999.
Karsten Weihe. Covering Trains by Stations or The Power of Data Reduction. In On-Line Proceedings 1st Workshop on Algorithms and Experiments, 1998. http://rtm.science.unitn.it/alex98/proceedings.html.
Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, and Thomas Willhalm. Empirical Design of Geometric Algorithms. In Proceedings 15th ACM Symposium on Computational Geometry, pages 86–94, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liebers, A., Weihe, K. (2001). Recognizing Bundles in Time Table Graphs - A Structural Approach. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-44691-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42512-0
Online ISBN: 978-3-540-44691-0
eBook Packages: Springer Book Archive