Skip to main content
SpringerLink
Log in

Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling

  • Conference paper
  • First Online:
Analysis of Experimental Algorithms (SEA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11544))

Included in the following conference series:

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.

D.-M. Phan—This work was mostly performed while this author was at Irif – Paris University, CNRS, France.

L. Viennot—Supported by Irif laboratory from CNRS and Paris University, and ANR project Multimod (ANR-17-CE22-0016).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://i11www.iti.kit.edu/PublicTransitData/Switzerland/.

  2. 2.

    https://files.inria.fr/gang/graphs/public_transport/.

  3. 3.

    https://github.com/lviennot/hl-csa-raptor.

References

  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_20

    Chapter  Google Scholar 

  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_4

    Chapter  Google Scholar 

  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_25

    Chapter  Google Scholar 

  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_2

    Chapter  Google Scholar 

  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. 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/S0097539702403098

    Article  MathSciNet  MATH  Google Scholar 

  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_24

    Chapter  Google Scholar 

  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_21

    Chapter  Google Scholar 

  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_27

    Chapter  Google Scholar 

  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_580

    Chapter  Google Scholar 

  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.0534

    Article  MATH  Google Scholar 

  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=3274661

    MathSciNet  MATH  Google Scholar 

  13. Dibbelt, J., Pajor, T., Wagner, D.: User-constrained multimodal route planning. ACM J. Exp. Algorithmics 19(1), (2014). https://doi.org/10.1145/2699886

    Article  Google Scholar 

  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.0401

    Article  Google Scholar 

  15. Geofabrik. http://download.geofabrik.de/

  16. Open Data RATP. https://data.ratp.fr/

  17. OpenStreetMap. https://www.openstreetmap.org/

  18. Transport for London Unified API. https://api.tfl.gov.uk/

  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. 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

Download references

Author information

Authors and Affiliations

  1. Got It Vietnam, Hanoi, Vietnam

    Duc-Minh Phan

  2. Inria – Paris University, Paris, France

    Laurent Viennot

Authors
  1. Duc-Minh Phan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Viennot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laurent Viennot .

Editor information

Editors and Affiliations

  1. Wilfrid Laurier University, Waterloo, ON, Canada

    Ilias Kotsireas

  2. University of Florida, Gainesville, FL, USA

    Panos Pardalos

  3. University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos

  4. Delft University of Technology, Delft, The Netherlands

    Dimitris Souravlias

  5. University of Florida, Gainesville, FL, USA

    Arsenis Tsokas

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Phan, DM., Viennot, L. (2019). Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34029-2_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34028-5

  • Online ISBN: 978-3-030-34029-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation