Route Search Algorithm in Timetable Graphs and Extension for Block Agents

  • Ion Cozac
Part of the Studies in Computational Intelligence book series (SCI, volume 473)


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.


timetable graph maximum allowed distance bridges in graph block agents 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    Bauer, R., Delling, D., Wagner, D.: Experimental Study of Speed-up Techniques for Timetable Information Systems. Journal Networks 57, 38–52 (2011)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Dijkstra, E.W.: A Note on Two Problems Ion Connection with Graphs. Numerische Mathematic 1, 269–271 (1959)MathSciNetMATHCrossRefGoogle Scholar
  4. 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
  5. 5.
  6. 6.
    Müller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.D.: Timetable Information: Models and Algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 67–90. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 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. 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
  9. 9.
    Salido, M.A., Abril, M., Barber, F., Ingolotti, L., Tormos, P., Lova, A.: Domain-Dependent Distributed Models for Railway Scheduling. Journal Knowledge Based Systems (Elsevier) 20, 186–194 (2007)CrossRefGoogle Scholar
  10. 10.
    Schulz, F., Wagner, D., Zaroliagis, C.D.: Using Multi-level Graphs for Timetable Information in Railway Systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 43–59. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Tarjan, R.E.: A Note on Finding the Bridges of a Graph. Information Processing Letters 2(6), 160–161 (1974)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Wooldridge, M., Jennings, R.: Agent Theories, Architectures, and Languages: A Survey. Intelligent Agents, 1–22 (1995)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  1. 1.”Petru Maior” University of Tirgu-MuresTirgu-MuresRomania

Personalised recommendations