Document Open Access Logo

Faster Batched Shortest Paths in Road Networks

Authors Daniel Delling, Andrew V. Goldberg, Renato F. Werneck

Thumbnail PDF


  • Filesize: 435 kB
  • 12 pages

Document Identifiers

Author Details

Daniel Delling
Andrew V. Goldberg
Renato F. Werneck

Cite AsGet BibTex

Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. Faster Batched Shortest Paths in Road Networks. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 20, pp. 52-63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)


We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (one-to-many queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in most cases, often by orders of magnitude. When used to compute distance tables (many-to-many queries), RPHAST often outperforms all previous approaches.
  • shortest paths
  • contraction hierarchies
  • many-to-many
  • one-to-many


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail