|
|
Dynamic Programming in Graph Algorithms
Biloš, Martin ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
This work is about graph algorithms, their use and the benefit of the optimization method of dynamic programming. This benefit is show to the user via the graphic application. Graph algorithms find use in many sectors of human activity. They are used in packet routing or, for example, navigation. There are three methods of graph algorithms used in this work. This problems are solved with classic and dynamic way and measured data are compared.
|
|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
Application of neural networks in telecommunications
Šulák, Michal ; Koula, Ivan (referee) ; Kacálek, Jan (advisor)
This Master’s Thesis consists of description of current routing protocols and routers, basic principles of neural networks and their interpretation in connection with the use for routing in data networks and telecommunications networks. In the thesis I focused on neural networks, which use energetic functions to find solution stabled states and their use for data routing. I produced the application software to test and find suitable variables for each function. This application counts the shortest path and is able to change variables to reach the best solution of stabled state of neural network. These solutions are compared with other functions that are usually used in nowadays systems for data network routing.
|
|
|
Shortest Paths in a Graph
Krauter, Michal ; Křivka, Zbyněk (referee) ; Masopust, Tomáš (advisor)
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.
|
|
|
Analysis and Prediction from GPS Data
Kováčik, Dušan ; Bartík, Vladimír (referee) ; Burget, Radek (advisor)
This paper deals with the analysis of the collected GPS data and the possibility of the prediction of most advantageous route on its basis, by the application written in the PHP scripting language. The suitability of the route is considered by the distance, driving time, or elevation. The thesis also describes a GPS system, the format of the source data and their storing in an appropriate database. There is also a description of the search of the shortest path in the graph and some famous algorithms for finding it. The paper includes information about implementation of new data integration and path finding within this data in PHP scripting language. In conclusion it is evaluated what are the benefits of this application and design saying how this application can be improved in the future.
|
|
| |
|
|
Route Planning in Air Transport
Sychra, Marek ; Krčmář, Radim (referee) ; Křivka, Zbyněk (advisor)
The problem of route planning in air transport (in public transport in general ) is similar to the shortest path problem. The main differences are the time dependency of the input graph and the multicriterial aspect of the path costs . The aim of this thesis was to create a complex system that would be able to load elementary flights from database and then respond to user requests with combined journeys made from single flights . It was achieved using two state of the art algorithms , CSA and RAPTOR , which were adapted for the flight graph. The experiments which were run on real world data showed massive speedup of the algorithms when using the proposed optimisations . The whole system was also tested against an existing proprietary solution .
|
|
|
Optimization of Warehouse Passing
Holáň, Jan ; Kožár, Tomáš (referee) ; Křivka, Zbyněk (advisor)
The work focuses on finding the shortest path through the warehouse in order to pick a given number of items. It describes the necessary theory related to mathematical problems related to the topic of this work. Most attention is given to a generally not much discussed topic, which is the grouping of indistinguishable groups of items, in order to obtain the resulting shortest path between items. The result is a C++ library capable of dealing with picking optimization under conditions defined by a specific real company.
|
|
|
Dynamic Programming in Graph Algorithms
Biloš, Martin ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
This work is about graph algorithms, their use and the benefit of the optimization method of dynamic programming. This benefit is show to the user via the graphic application. Graph algorithms find use in many sectors of human activity. They are used in packet routing or, for example, navigation. There are three methods of graph algorithms used in this work. This problems are solved with classic and dynamic way and measured data are compared.
|
|
|
Geoinformation system for the visually handicapped
Šupák, Jakub ; Čábelka, Miroslav (advisor) ; Brůha, Lukáš (referee)
Diploma thesis named "Geoinformation system for the visually handicapped" deals with design and creation geoinformation system that should serve to visually handicapped people with planing the most appropriate route and their movement in a city. First part of thesis is a brief summary of who are visually handicapped people, their needs, abilities and principles of movement. Further are described barrier-free adaptations for visually handicapped people and existing solutions. Practical output is the design of an algorithm for automatically locating and evaluating critical locations based on OpenStreetMaps solution. Visually handicapped people choose not shortest route, but the safest route for their movement. Key words: Critical Point, Visual Handicap, Shortest Route, Optimization, Routing
|
guest ::
