Application of Dynamic Graphs for the Fastest Route Search in a Transport Network
Loading...
Files
Downloads
10
Date issued
Authors
Rapant, Lukáš
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
This work deals with finding the fastest route in a dynamic graph representing road
network. Its goal is to develop algorithms capable of finding such route. There will be
three algorithms presented in this work: the first based on Dijkstra algorithm, the second
based on A* algorithm and the third based on Ant colony optimization algorithm.
Description
Import 04/07/2011
Subject(s)
road navigation, Dijkstra algorithm, ant colony optimization, A* algorithm, dynamic graph, fastest route