Work

Modernien lyhimmän polun algoritmien arviointi Suomen tieverkoissa

Year: 2024
Type: dissertation
Abstract: The shortest path problem is a fundamental computational challenge with extensive applications in the field of route planning, in which obtaining effective routes relies on performant shortest path algorithms. Due to the importance of various route planning applications, from navigators to delivery route optimizers, shortest path algorithms for road networks have recently experienced rapid advancements. These developments employ diverse indexing techniques to create auxiliary speedup structures, enabling solutions that are orders of magnitude faster than classical, non-indexing-based approaches. This work investigates the performances and other characteristics of these modern shortest path algorithms within the context of Finnish road networks, an area that has not been previously explored in an evaluative study. The evaluations conducted focus on three modern shortest path algorithms, Contraction Hierarchies (CH), Customizable Contraction Hierarchies (CCH), and Transit Node Routing (TNR), applied to increasingly sized Finnish road networks. Based on the results, these algorithms are compared both against one another and against four classical shortest path algorithms also evaluated in this study. Additionally, to this comparative analysis, the suitability of the evaluated algorithms for solving the shortest path problem in Finnish road networks is assessed. Overall, the modern approaches exhibit significantly improved performance over classical algorithms, with the most substantial gains observed in larger evaluation areas. In the evaluations, ranging from the road network of Uusimaa to the entire road network of Finland, the modern algorithms achieve speedups of two to three orders of magnitude compared to classical methods. Coupled with relatively fast preprocessing times and small speedup structure sizes offered by some of the evaluated algorithms, these findings strongly advocate the use of modern shortest path algorithms in the road networks of Finland.
Author: Makkonen, Joona
Language: English
Open Access status: green
OpenAlex ID: W7058479018
Cites: 31
Cited by:
Related to: 9