Advertisement

Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling

  • Duc-Minh Phan
  • Laurent ViennotEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11544)

Abstract

We propose a novel technique for answering routing queries in public transportation networks that allows unrestricted walking. We consider several types of queries: earliest arrival time, Pareto-optimal journeys regarding arrival time, number of transfers and walking time, and profile, i.e. finding all Pareto-optimal journeys regarding travel time and arrival time in a given time interval. Our techniques uses hub labeling to represent unlimited foot transfers and can be adapted to both classical algorithms RAPTOR and CSA. We obtain significant speedup compared to the state-of-the-art approach based on contraction hierarchies. A research report version is deposited on HAL with number hal-02161283.

Keywords

Route planning Public transportation Hub labeling 

References

  1. 1.
    Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230–241. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-20662-7_20CrossRefGoogle 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).  https://doi.org/10.1007/978-3-642-33090-2_4CrossRefGoogle Scholar
  3. 3.
    Bast, H., et al.: Fast routing in very large public transportation networks using transfer patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 290–301. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-15775-2_25CrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    Bast, H., Hertel, M., Storandt, S.: Scalable transfer patterns. In: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, pp. 15–29. SIAM (2016).  https://doi.org/10.1137/1.9781611974317.2
  6. 6.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003).  https://doi.org/10.1137/S0097539702403098MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Delling, D., Dibbelt, J., Pajor, T., Wagner, D., Werneck, R.F.: Computing multimodal journeys in practice. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 260–271. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-38527-8_24CrossRefGoogle Scholar
  8. 8.
    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
  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).  https://doi.org/10.1007/978-3-662-44777-2_27CrossRefGoogle Scholar
  10. 10.
    Delling, D., Goldberg, A.V., Werneck, R.F.: Hub labeling (2-hop labeling). In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 932–938. Springer, Heidelberg (2016).  https://doi.org/10.1007/978-1-4939-2864-4_580CrossRefGoogle Scholar
  11. 11.
    Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transp. Sci. 49(3), 591–604 (2015).  https://doi.org/10.1287/trsc.2014.0534CrossRefzbMATHGoogle Scholar
  12. 12.
    Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Exp. Algorithmics 23, 17 (2018). https://dl.acm.org/citation.cfm?id=3274661MathSciNetzbMATHGoogle Scholar
  13. 13.
    Dibbelt, J., Pajor, T., Wagner, D.: User-constrained multimodal route planning. ACM J. Exp. Algorithmics 19(1), (2014).  https://doi.org/10.1145/2699886CrossRefGoogle Scholar
  14. 14.
    Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388–404 (2012).  https://doi.org/10.1287/trsc.1110.0401CrossRefGoogle Scholar
  15. 15.
  16. 16.
    Open Data RATP. https://data.ratp.fr/
  17. 17.
  18. 18.
    Transport for London Unified API. https://api.tfl.gov.uk/
  19. 19.
    Wagner, D., Zündorf, T.: Public transit routing with unrestricted walking. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS OASICS, vol. 59, pp. 7:1–7:14 (2017).  https://doi.org/10.4230/OASIcs.ATMOS.2017.7
  20. 20.
    Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: A labelling approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD 2015, pp. 967–982. ACM, New York (2015).  https://doi.org/10.1145/2723372.2749456

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Got It VietnamHanoiVietnam
  2. 2.Inria – Paris UniversityParisFrance

Personalised recommendations