Optimalizace algoritmů pro směrování vozidel

Abstract

Searching for the best path is a common problem of all of us. Ubiquitous navigation devices are making this searching easier. Best path can be found by simply typing the start and goal of our journey. This work is about routing in the road network and routing algorithms that search paths according to our requirements. We will show different variations of Dijkstra's algorithm and their possible optimizations, we will describe advanced routing algorithm based on the separators and perform experiments with these algorithms. Emphasis is put on the speed and accuracy of routing algorithms. Processing of spatial information into our data structures is a significant portion of this work. There is a mobile application based on this work, which is computing travel accessibility. The application is practically used by firefighters, for which it was originally designed as well.