|
|
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.
|
|
|
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.
|
|
|
iOS application for sales representative
Nejezchleb, Daniel ; Pavlíčková, Jarmila (advisor) ; Černá, Magda (referee)
This bachelor`s thesis demonstrates design and development of an iOS application. The development was approached according to Metodika pro male softwarové projekty methodology and that is the reason why most parts of the thesis are processed accordingly to templates offered by the methodology. The thesis transcribes the development from its very first requirements made by professionals over the analysis and concrete specification of those requirements, furthermore it defines application architecture and finally implements it. Thesis also includes a user guide for the application. From author`s point of view the application itself is unique on the market and it innovates the industrial area of deployment. The application is targeted for sales representatives, who perform countless business visits in a year. The application optimizes and fasten a business trips planning, it centralizes data management of customers and visits. And mainly it is mobile and that is why it is able automate the process of visits recording.
|
|
| |
|
|
Solving vehicle routing problems and algorithm implementation on GPU
Hájek, Jan ; Fábry, Jan (advisor) ; Černý, Michal (referee)
A very wide-ranging subgroup of vehicle routing problems from the graph theory is a common and frequent problem handled daily by transport companies, airline businesses, hi-tech companies with planning drilling of printed circuits boards or other companies from different industries. During numerous previous researches of these problems a lot of analyses were made and many solutions proposed -- of which an outline is in this paper. Some of them giving better or worse results in longer or shorter computing time. In spite of the fact that the processors and new technologies performance is increasing, with some algorithms we cannon compute the result in a reasonable time. That is why this paper is asking a question, if there can be found a fitting algorithm which could be applied on different and faster processing unit structures so it could be ensured a multiple computing speed increase so far. The analysis was carried out using computer experiments on a new build and implemented branch and bound algorithm with a matrix rate reduction.
|
|
|
Heuristics testing for travelling salesman problem
Dítětová, Tereza ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
The travelling salesman problem is one of the most popular kind of route trip transportation problem. This work empirically compares two chosen heuristics, giving only approximate solution in the TSP, with an optimal solution. Travelling salesman problem is easy to formulate but difficult to solve that is what makes this problem so attractive. The first chapter is focused on the theoretical definition including a historical overview, the second chapter describes selected heuristics methods for solving the TSP. The third chapter contains the results of my computing experiments that were made through an application programmed by me. The results show the nearest neighbour heuristic as more effective than the savings heuristic, both in the computation speed and the closeness to the optimum.
|
|
|
Speciální algoritmy některých úloh operačního výzkumu
Klaschková, Alena ; Šindelářová, Irena (advisor) ; Zouhar, Jan (referee)
Práce sumarizuje a dává do souvislostí vybrané úlohy operačního výzkumu, pro něž byly vyvinuty speciální optimalizační algoritmy či heuristiky kromě obecných algoritmů řešících problémy lineárního programování nebo diskrétního programování, s důrazem na praktické možnosti řešení těchto problémů danými algoritmy. Zabývá se běžnými úlohami lineárního programování s omezenými proměnnými, úlohami teorie grafů (toky, cesta grafem, kostra grafu), úlohou batohu, dopravním problémem, přiřazovacím problémem a úlohou obchodního cestujícího a srovnává speciální algoritmy s obecnými.
|
guest ::
