Optimalizace směrování dopravních vozidel

Abstract

This thesis deals with finding paths in the road network. We know where we want to, but picking the best way is not easy. Various GPS find different results, because it depends on used algorithms and maps. Assuming that maps are about the same, we focus on the possibility of influencing the quality of search algorithmic. Considering the size of the road network, we focus on the search speed. We improve classic Dijkstra’s algorithm, optimize it and introduce the newer variants. We focus on bidirectional hierarchical search and creation of a highway hierarchy from available data. Finally, we compare the quality of found paths and computation speed for described optimizations.