https://arxiv.org/abs/1504.05140

Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member
institutions, and all contributors. Donate
 
arxiv logo > cs > arXiv:1504.05140
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv logo
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Data Structures and Algorithms

arXiv:1504.05140 (cs)
[Submitted on 20 Apr 2015]

Title:Route Planning in Transportation Networks

Authors:Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias
Muller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner,
Renato F. Werneck
View a PDF of the paper titled Route Planning in Transportation
Networks, by Hannah Bast and 7 other authors
View PDF

    Abstract:We survey recent advances in algorithms for route
    planning in transportation networks. For road networks, we show
    that one can compute driving directions in milliseconds or less
    even at continental scale. A variety of techniques provide
    different trade-offs between preprocessing effort, space
    requirements, and query time. Some algorithms can answer queries
    in a fraction of a microsecond, while others can deal efficiently
    with real-time traffic. Journey planning on public transportation
    systems, although conceptually similar, is a significantly harder
    problem due to its inherent time-dependent and multicriteria
    nature. Although exact algorithms are fast enough for interactive
    queries on metropolitan transit systems, dealing with
    continent-sized instances requires simplifications or heavy
    preprocessing. The multimodal route planning problem, which seeks
    journeys combining schedule-based transportation (buses, trains)
    with unrestricted modes (walking, driving), is even harder,
    relying on approximate solutions even for metropolitan inputs.

             This is an updated version of the technical report
             MSR-TR-2014-4, previously published by Microsoft
Comments:    Research. This work was mostly done while the authors
             Daniel Delling, Andrew Goldberg, and Renato F. Werneck
             were at Microsoft Research Silicon Valley
Subjects:    Data Structures and Algorithms (cs.DS)
ACM classes: G.2.1; G.2.2; G.2.3; H.2.8; H.3.5; H.4.2
Cite as:     arXiv:1504.05140 [cs.DS]
             (or arXiv:1504.05140v1 [cs.DS] for this version)
             https://doi.org/10.48550/arXiv.1504.05140
             Focus to learn more
             arXiv-issued DOI via DataCite

Submission history

From: Thomas Pajor [view email]
[v1] Mon, 20 Apr 2015 18:04:20 UTC (424 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Route Planning in Transportation
    Networks, by Hannah Bast and 7 other authors
  * View PDF
  * TeX Source
  * Other Formats

view license
Current browse context:
cs.DS
< prev   |   next >
new | recent | 2015-04
Change to browse by:
cs

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Hannah Bast
Daniel Delling
Andrew V. Goldberg
Matthias Muller-Hannemann
Thomas Pajor
...
a export BibTeX citation Loading...

BibTeX formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Reddit logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
[ ] Litmaps Toggle
Litmaps (What is Litmaps?)
[ ] scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
( ) Code, Data, Media

Code, Data and Media Associated with this Article

[ ] Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
[ ] DagsHub Toggle
DagsHub (What is DagsHub?)
[ ] GotitPub Toggle
Gotit.pub (What is GotitPub?)
[ ] Links to Code Toggle
Papers with Code (What is Papers with Code?)
[ ] ScienceCast Toggle
ScienceCast (What is ScienceCast?)
( ) Demos

Demos

[ ] Replicate Toggle
Replicate (What is Replicate?)
[ ] Spaces Toggle
Hugging Face Spaces (What is Spaces?)
[ ] Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
( ) Related Papers

Recommenders and Search Tools

[ ] Link to Influence Flower
Influence Flower (What are Influence Flowers?)
[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)

  * Author
  * Venue
  * Institution
  * Topic

( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack