|
|
Traveling Salesman Problem: Parallel Methods Using SMP (Threads)
Weigner, Martin ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
This thesis is focused on solving the problem of traveling salesman. At first, the problem is solved by serial access at four algorithms. There are two of them chosen and transferred to parallel access. In the end there are summarized observations about different parameters of both access. This thesis also introduces questions of programming parallel applications with threads to the reader.
|
|
|
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
|
|
|
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
|
|
|
Traveling Salesman Problem: Parallel Methods Using SMP (Threads)
Weigner, Martin ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
This thesis is focused on solving the problem of traveling salesman. At first, the problem is solved by serial access at four algorithms. There are two of them chosen and transferred to parallel access. In the end there are summarized observations about different parameters of both access. This thesis also introduces questions of programming parallel applications with threads to the reader.
|
|
|
Metaheuristic optimalization for routing problems
Novák, Vít ; Fábry, Jan (advisor) ; Melechovský, Jan (referee)
Routing problems are ones of the most famous members of the group of the classical optimalization combinatorial problems. Travelling salesman problem and problems derived from it have been attracting mathematics and analysts, since they were firstly formulated, and accelerating a development of new methods and approaches that can be used for a wide range of another real-life problems. This thesis aims to demonstrate an usefulness and a flexibility of shown metaheristic methods. Results are compared with outputs of alternative algorithms or known optimal solutions where it is possible. To fulfill this goal the VBA application has been developed. The results of experiments are presented and the application is decribed in a second part of this thesis. A reader should be sufficiently instructed which way he could choose to solve similar types of problems
|
guest ::
