DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2010 · 48 citations · 5 references
ManagementTransportation PlanningAlgorithmsTransportTransportationRoute PlanningRoutingShortest Path AlgorithmsTransportation ProblemsMany-to-many MatchingMatchingPopulation Density DependencePruningRoad Network AnalysisTravel Time Information
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.
5
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
On Finding the Maxima of a Set of Vectors
H. T. Kung, Fabrizio Luccio, F. P. Preparata · Journal of the ACM · 1975 · 913 citations · Full text
Fast Routing in Road Networks with Transit Nodes
Holger Bast, Stefan Funke, Peter Sanders et al. · Science · 2007 · 230 citations
The Intelligent Travel Assistant
John Dillenburg, Ouri Wolfson, Peter Nelson · 2003 · 27 citations