Route Search Algorithm in Timetable Graphs and Extension for Block Agents
This paper describes an algorithm that determines routes using three graphs: the railway graph, the train timetable graph and the summary timetable graph. The search in the timetable graphs is guided by a subgraph of the railway graph, which is defined by the nodes that form an ellipse around the minimum distance path from departure to arrival. We also present some performance evaluations of our proposed algorithm. Finally we describe an extension of this algorithm that can be used in conjunction with block agents to find routes in large timetable graphs, and some applications for medical domain.
Keywordstimetable graph maximum allowed distance bridges in graph block agents
Unable to display preview. Download preview PDF.
- 1.Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Proceedings of 10th Workshop of Algorithms and Engineering Experiments (ALENEX 2008), pp. 13–26. SIAM (April 2008)Google Scholar
- 4.Frede, L., Müller-Hannemann, M., Schnee, M.: Efficient On-trip Timetable Information in the Presence of Delays. In: ATMOS 2008, 8th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization and Systems, pp. 1–16 (2008)Google Scholar
- 7.Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Toward Realistic Modeling of Time-table Information Through the Time-dependent Approach. In: Proc. of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). ENTCS, vol. 92, pp. 85–103. Elsevier (2004)Google Scholar
- 8.Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithms 12, Article 2.4 (2007)Google Scholar
- 12.Wooldridge, M., Jennings, R.: Agent Theories, Architectures, and Languages: A Survey. Intelligent Agents, 1–22 (1995)Google Scholar