Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

ALENEX
2010

favoriteEmaildiscussreport

161views Algorithms» more ALENEX 2010»

Route Planning with Flexible Objective Functions

13 years 10 months ago

Route Planning with Flexible Objective Functions

Download algo2.iti.kit.edu

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

Real-time Traffic

ALENEX 2010 | Algorithms | Edge Weight | Edge Weight Functions | Shortest Path |

claim paper

Related Content

» Engineering Route Planning Algorithms

» Engineering Fast Route Planning Algorithms

» Flexible GPUBased MultiVolume RayCasting

» Simultaneous Network Line Planning and Traffic Assignment

» Processing ObjectOriented Queries with Invertible Late Bound Functions

» Mission planning for joint suppression of enemy air defenses using a genetic algorithm

» Alternative Route Graphs in Road Networks

» Improving service differentiation in IP networks through dual topology routing

» Management and optimization of multiple supply chains

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	ALENEX
Authors	Robert Geisberger, Moritz Kobitzsch, Peter Sanders

Comments (0)