- Tytuł:
- Multithreaded enhancements of the Dijkstra algorithm for route optimization in urban networks
- Autorzy:
-
Bazan, M.
Ciskowski, P.
Dudek, R.
Halawa, K.
Janiczek, T.
Kozaczewski, P.
Rusiecki, A. - Powiązania:
- https://bibliotekanauki.pl/articles/393379.pdf
- Data publikacji:
- 2016
- Wydawca:
- Polskie Stowarzyszenie Telematyki Transportu
- Tematy:
-
Dijkstra algorithm
shortest paths
fastest routes
urban networks
route optimization
algorytm Dijkstry
najkrótsza ścieżka
najszybsza trasa
sieć miejska
optymalizacja trasy - Opis:
- In this paper, we present a case study, showing step by step, how to speed up Dijkstra’s method by parallelizing its computation and using different data structures. We compare basic algorithm with its bidirectional version and investigate two-and-multi-thread implementations based on Fibonacci heaps and regular priority queues. Experimental results obtained for artificially generated graphs as well as real-world road network data are presented and described.
- Źródło:
-
Archives of Transport System Telematics; 2016, 9, 2; 3-7
1899-8208 - Pojawia się w:
- Archives of Transport System Telematics
- Dostawca treści:
- Biblioteka Nauki
Artykuł