Implementace a optimalizace algoritmu pro alternativní plánování tras

Abstract

The thesis deals with routing algorithm (Plateau Algorithm) for alternative paths and its optimization. The aim of this algorithm is to get several possible routes from point A to point B, which can be then used to distribute traffic. Several improvements of the Plateau algorithm, which lower time demands of computation and at the same time does not affect its result, are presented in the thesis. A part of the thesis is optimization of selected parts of solution with simple parallelization. Final algorithm implementation is then tested both on notebook and HPC cluster node.