Using Multi-level Graphs for Timetable Information in Railway Systems
In many fields of application, shortest path finding problems in very large graphs arise. Scenarios where large numbers of on-line queries for shortest paths have to be processed in real-time appear for example in traffic information systems. In such systems, the techniques considered to speed up the shortest path computation are usually based on precomputed information. One approach proposed often in this context is a space reduction, where precomputed shortest paths are replaced by single edges with weight equal to the length of the corresponding shortest path. In this paper, we give a first systematic experimental study of such a space reduction approach. We introduce the concept of multi-level graph decomposition. For one specific application scenario from the field of timetable information in public transport, we perform a detailed analysis and experimental evaluation of shortest path computations based on multi-level graph decomposition.
KeywordsShort Path Station Graph Original Graph Short Path Problem Short Path Algorithm
Unable to display preview. Download preview PDF.
- 3.U. Brandes, F. Schulz, D. Wagner, and T. Willhalm. Travel Planning with Self-Made Maps. Proc. 3rd Workshop Algorithm Engineering and Experiments (ALENEX’ 01), Springer LNCS Vol. 2153, 132–144, 2001.Google Scholar
- 4.A. Car and A. Frank. Modelling a Hierarchy of Space Applied to Large Road Networks. Proc. Int. Worksh. Adv. Research Geogr. Inform. Syst. (IGIS’ 94), 15–24, 1994.Google Scholar
- 9.http://bahn.hafas.de. Hafas is a trademark of Hacon Ingenieurgesellschaft mbH, Hannover, Germany.
- 10.M. Müller-Hannemann and K. Weihe. Pareto Shortest Paths is Often Feasible in Practice. Proc. 5th Workshop on Algorithm Engineering (WAE’01), Springer LNCS 2141, 185–197, 2001.Google Scholar
- 11.K. Ishikawa, M. Ogawa, S. Azume, and T. Ito. Map Navigation Software of the Electro Multivision of the’ 91 Toyota Soarer. IEEE Int. Conf. Vehicle Navig. Inform. Syst., 463–473, 1991.Google Scholar
- 12.R. Jakob, M. Marathe, and K. Nagel. A Computational Study of Routing Algorithms for Realistic Transportation Networks. The ACM Journal of Experimental Algorithmics, Vol. 4, Article 6, 1999.Google Scholar
- 13.S. Jung and S. Pramanik. HiTi Graph Model of Topographical Road Maps in Navigation Systems. Proc. 12th IEEE Int. Conf. Data Eng., 76–84, 1996.Google Scholar
- 15.T. Preuss and J.-H. Syrbe. An Integrated Traffic Information System. Proc. 6th Int. Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning (europIA’ 97), 1997.Google Scholar
- 16.S. Shekhar, A. Fetterer, and G. Goyal. Materialization trade-offs in hierarchical shortest path algorithms. Proc. Int. Symp. Large Spatial Databases, Springer LNCS 1262, 94–111, 1997.Google Scholar
- 17.S. Shekhar, A. Kohli, and M. Coyle. Path Computation Algorithms for Advanced Traveler Information System (ATIS). Proc. 9th IEEE Int. Conf. Data Eng., 31–39, 1993.Google Scholar
- 20.F. Schulz, D. Wagner, and K. Weihe. Dijkstra’s Algorithm On-Line: An Empirical Study from Public Railroad Study. ACM Journal of Experimental Algorithmics, Vol. 5, Article 12, 2000, Special issue on WAE’99.Google Scholar