Route planning in dynamic graphs with linear changing and preprocessing for speed-up
The goal of this paper is to work out a concept for route planning in a road network, where the costs of roads are not constant, but changing in a linear way. The solution developed is based on the classical Dijkstra's algorithm, which helps to find the route with minimal cost. The new algorith...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Silesian University of Technology
2010-01-01
|
| Series: | Transport Problems |
| Subjects: | |
| Online Access: | http://transportproblems.polsl.pl/pl/Archiwum/2010/zeszyt2/2010t5z2_06.pdf |