License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2010.88
URN: urn:nbn:de:0030-drops-27525
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2752/
Go to the corresponding OASIcs Volume Portal

Geisberger, Robert ; Luxen, Dennis ; Neubauer, Sabine ; Sanders, Peter ; Volker, Lars

Fast Detour Computation for Ride Sharing

pdf-format:
8.pdf (0.6 MB)

Abstract

Ride sharing becomes more and more popular not least because internet services help matching offers and request.
However, current systems use a rather simple-minded functionality allowing to search for the origin and destination city, sometimes enriched with radial search around the cities.
We show that theses services can be substantially improved using innovative route planning algorithms.
More concretely, we generalize previous static algorithms for many-to-many routing to a dynamic setting and develop an additional pruning strategy.
With these measures it becomes possible to match each request to $n$ offers using $2n+1$ exact travel time computations in a large road network in a fraction of a microsecond per offer.
For requests spread over Germany according to population density, we are able to reduce the number of failing entries substantially.
We are able to find a reasonable match for more than 60% of the failing entries left by contemporary matching strategies.
Additionally, we halve the average waste of resources in the matches found compared to radial search.

BibTeX - Entry

@InProceedings{geisberger_et_al:OASIcs:2010:2752,
  author =	{Robert Geisberger and Dennis Luxen and Sabine Neubauer and Peter Sanders and Lars Volker},
  title =	{{Fast Detour Computation for Ride Sharing}},
  booktitle =	{10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
  pages =	{88--99},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-20-0},
  ISSN =	{2190-6807},
  year =	{2010},
  volume =	{14},
  editor =	{Thomas Erlebach and Marco L{\"u}bbecke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2752},
  URN =		{urn:nbn:de:0030-drops-27525},
  doi =		{10.4230/OASIcs.ATMOS.2010.88},
  annote =	{Keywords: ride sharing, algorithm engineering, carpool}
}

Keywords: ride sharing, algorithm engineering, carpool
Collection: 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)
Issue Date: 2010
Date of publication: 01.09.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI