Sciweavers

Share
ALENEX
2010

Route Planning with Flexible Objective Functions

9 years 5 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy cost, on large scale road networks. The precomputation receives as input a directed graph, two edge weight functions t(e) and c(e), and a discrete interval [L, U]. The resulting flexible query algorithm finds for a parameter p [L, U] an exact shortest path for the edge weight t(e)+p
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2010
Where ALENEX
Authors Robert Geisberger, Moritz Kobitzsch, Peter Sanders
Comments (0)
books