Public Transit Labeling

  • Daniel Delling
  • Julian DibbeltEmail author
  • Thomas Pajor
  • Renato F. Werneck
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9125)


We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approaches either require massive preprocessing effort or provide limited speedups. Leveraging recent advances in Hub Labeling, the fastest algorithm for road networks, we revisit the well-known time-expanded model for public transit. Exploiting domain-specific properties, we provide simple and efficient algorithms for the earliest arrival, profile, and multicriteria problems, with queries that are orders of magnitude faster than the state of the art.


Public Transit Early Arrival Arrival Event Event Label Distance Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: HLDB: location-based services in databases. In: SIGSPATIAL, pp. 339–348. ACM (2012)Google Scholar
  2. 2.
    Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24–35. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  3. 3.
    Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349–360 (2013)Google Scholar
  4. 4.
    Bast, H., Carlsson, E., Eigenwillig, A., Geisberger, R., Harrelson, C., Raychev, V., Viger, F.: Fast routing in very large public transportation networks using transfer patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 290–301. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  5. 5.
    Bast, H., Delling, D., Goldberg, A.V., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. Technical Report MSR-TR-2014-4, Microsoft Research (2014)Google Scholar
  6. 6.
    Bast, H., Storandt, S.: Frequency-based search for public transit. In: SIGSPATIAL, pp. 13–22. ACM (2014)Google Scholar
  7. 7.
    Cheng, J., Huang, S., Wu, H., Fu, A.W.-C.: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph. In: SIGMOD, pp. 193–204 (2013)Google Scholar
  8. 8.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM Journal on Computing 32(5), 1338–1355 (2003)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321–333. Springer, Heidelberg (2014) Google Scholar
  10. 10.
    Delling, D., Katz, B., Pajor, T.: Parallel computation of best connections in public transportation networks. ACM JEA 17(4), 4.1–4.26 (2012)MathSciNetGoogle Scholar
  11. 11.
    Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transportation Science (2014). Accepted for publicationGoogle Scholar
  12. 12.
    Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Intriguingly simple and fast transit routing. In: Demetrescu, C., Marchetti-Spaccamela, A., Bonifaci, V. (eds.) SEA 2013. LNCS, vol. 7933, pp. 43–54. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  13. 13.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Geisberger, R.: Contraction of timetable networks with realistic transfers. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 71–82. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  15. 15.
    Jin, R., Wang, G.: Simple, fast, and scalable reachability oracle. VLDB 6(14), 1978–1989 (2013)MathSciNetGoogle Scholar
  16. 16.
    Merz, F., Sanders, P.: PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 701–712. Springer, Heidelberg (2014) Google Scholar
  17. 17.
    Müller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1), 269–286 (2006)zbMATHMathSciNetCrossRefGoogle Scholar
  18. 18.
    Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM JEA 12(2.4), 1–39 (2008)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Seufert, S., Anand, A., Bedathur, S., Weikum, G.: Ferrari: flexible and efficient reachability range assignment for graph indexing. In: ICDE, pp. 1009–1020 (2013)Google Scholar
  20. 20.
    Strasser, B., Wagner, D.: Connection scan accelerated. In: ALENEX, pp. 125–137. SIAM (2014)Google Scholar
  21. 21.
    Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. In: CIKM, pp. 1601–1606. ACM (2013)Google Scholar
  22. 22.
    Yildirim, H., Chaoji, V., Zaki, M.J.: GRAIL: Scalable reachability index for large graphs. VLDB 3(1), 276–284 (2010)Google Scholar
  23. 23.
    Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: SIGMOD, pp. 1323–1334. ACM (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Daniel Delling
    • 1
  • Julian Dibbelt
    • 2
    Email author
  • Thomas Pajor
    • 3
  • Renato F. Werneck
    • 4
  1. 1.SunnyvaleUSA
  2. 2.Karlsruhe Institute of TechnologyKarlsruheGermany
  3. 3.Microsoft ResearchNew YorkUSA
  4. 4.San FranciscoUSA

Personalised recommendations