Advertisement

Dynamic Public Transit Labeling

  • Mattia D’EmidioEmail author
  • Imran KhanEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11619)

Abstract

We study the journey planning problem in transit networks which, given the timetable of a schedule-based transit system, asks to answer to queries such as, e.g., “seek a journey that arrives at a given destination as early as possible”. The state-of-the-art solution to such problem, in terms of query time, is Public Transit Labeling (ptl), proposed in [Delling et al., SEA 2015], that consists of three main ingredients: (i) a graph data structure for storing transit networks; (ii) a compact labeling-based representation of the transitive closure of such graph, computed via a time-consuming preprocessing routine; (iii) an efficient query algorithm exploiting both graph and precomputed data to answer quickly to queries of interest at runtime.

The major drawback of ptl is not being practical in dynamic scenarios, when the network’s timetable can undergo updates (e.g. delays). In fact, even after a single change, precomputed data become outdated and queries can return incorrect results. Recomputing the labeling-based representation from scratch, after a modification, is not a viable option as it yields unsustainable time overheads. Since transit networks are inherently dynamic, the above represents a major limitation of ptl.

In this paper, we overcome such limit by introducing a dynamic algorithm, called \(\textsc {d-ptl}\), able to update the preprocessed data whenever a delay affects the network, without recomputing it from scratch. We demonstrate the effectiveness of \(\textsc {d-ptl}\) through a rigorous experimental evaluation showing that its update times are orders of magnitude smaller than the time for recomputing the preprocessed data from scratch.

Keywords

Journey planning Dynamic graph algorithms 2-Hop-Cover labeling Algorithm engineering Massive datasets Networks 

References

  1. 1.
    Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: Proceedings of 23rd International World Wide Web Conference (WWW 14), pp. 237–248. ACM (2014)Google Scholar
  2. 2.
    Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19–80. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-49487-6_2CrossRefGoogle Scholar
  3. 3.
    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: Proceedings of 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD 2013), pp. 193–204. ACM (2013)Google Scholar
  4. 4.
    Cicerone, S., D’Emidio, M., Frigioni, D.: On mining distances in large-scale dynamic graphs. In: Aldini, A., Bernardo, M., (eds.) Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy. CEUR Workshop Proceedings, vol. 2243, pp. 77–81. CEUR-WS.org, 18–20 September 2018. http://ceur-ws.org/Vol-2243/paper6.pdf
  5. 5.
    Cionini, A., D’Angelo, G., D’Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.D.: Engineering graph-based models for dynamic timetable information systems. In: Proceedings of 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS14) (2014)Google Scholar
  6. 6.
    Cionini, A., D’Angelo, G., D’Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.D.: Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms 46–47, 40–58 (2017)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    D’Angelo, G., D’Emidio, M., Frigioni, D.: Distance queries in large-scale fully dynamic complex networks. In: Mäkinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 109–121. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-44543-4_9CrossRefGoogle Scholar
  9. 9.
    D’Angelo, G., D’Emidio, M., Frigioni, D.: Fully dynamic update of arc-flags. Networks 63(3), 243–259 (2014).  https://doi.org/10.1002/net.21542zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    D’Angelo, G., D’Emidio, M., Frigioni, D.: Fully dynamic 2-hop cover labeling. ACM J. Exp. Algorithmics 24(1), 1.6:1–1.6:36 (2019).  https://doi.org/10.1145/3299901zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Delling, D., Dibbelt, J., Pajor, T., Werneck, R.F.: Public transit labeling. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 273–285. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-20086-6_21CrossRefGoogle Scholar
  12. 12.
    Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566–591 (2017).  https://doi.org/10.1287/trsc.2014.0579CrossRefGoogle Scholar
  13. 13.
    Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transp. Sci. 49(3), 591–604 (2015)CrossRefGoogle Scholar
  14. 14.
    Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Exp. Algorithmics 23, 1.7:1–1.7:56 (2018)zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12(2.4), 1–39 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    Qin, Y., Sheng, Q.Z., Falkner, N.J.G., Yao, L., Parkinson, S.: Efficient computation of distance labeling for decremental updates in large dynamic graphs. World Wide Web 20(5), 915–937 (2017)CrossRefGoogle Scholar
  17. 17.
    Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: Proceedings of 2015 ACM International Conference on Management of Data (SIGMOD 2015), pp. 967–982. ACM (2015)Google Scholar
  18. 18.
    Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. In: Proceedings of 22nd ACM International Conference on Information & Knowledge Management (CIKM 2013), pp. 1601–1606. ACM (2013)Google Scholar
  19. 19.
    Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Proceedings of 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD 2014), pp. 1323–1334. ACM (2014)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Information Engineering, Computer Science and MathematicsUniversity of L’AquilaL’AquilaItaly
  2. 2.Gran Sasso Science Institute (GSSI)L’AquilaItaly

Personalised recommendations