Sciweavers

55 search results - page 2 / 11
» Engineering Fast Route Planning Algorithms
Sort
View
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 6 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...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
13 years 11 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner
EDOC
2006
IEEE
13 years 8 months ago
A Fast and Efficient Route Finding Method for Car Navigation Systems with Neural Networks
In this paper we have proposed a new route finding method for car navigation systems meanwhile, have utilized learning power and high speed of neural networks in our proposed meth...
Mehdi Hashemzadeh
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
13 years 11 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
13 years 6 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling