Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Delling, Daniel; Goldberg, Andrew V.; Werneck, Renato F. http://www.dagstuhl.de/oasics License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-32663
URL:

; ;

Faster Batched Shortest Paths in Road Networks

pdf-format:


Abstract

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.

BibTeX - Entry

@InProceedings{delling_et_al:OASIcs:2011:3266,
  author =	{Daniel Delling and Andrew V. Goldberg and Renato F. Werneck},
  title =	{{Faster Batched Shortest Paths in Road Networks}},
  booktitle =	{11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{52--63},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-33-0},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{20},
  editor =	{Alberto Caprara and Spyros Kontogiannis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3266},
  URN =		{urn:nbn:de:0030-drops-32663},
  doi =		{http://dx.doi.org/10.4230/OASIcs.ATMOS.2011.52},
  annote =	{Keywords: shortest paths, contraction hierarchies, many-to-many, one-to-many}
}

Keywords: shortest paths, contraction hierarchies, many-to-many, one-to-many
Seminar: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Issue date: 2011
Date of publication: 2011


DROPS-Home | Fulltext Search | Imprint Published by LZI