|
|
Genetic Algorithms
Miček, David ; Pohl, Jan (referee) ; Honzík, Petr (advisor)
This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.
|
|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
| |
|
|
Effectiveness of evolutionary algorithms
Němec, Jan ; Mlýnek, Petr (referee) ; Fujdiak, Radek (advisor)
This master's thesis is focused on evolutionary algorithms. The goal of this thesis is to chooche a proper algorithm which will solve a chosen problem. In this case the chosen algorithm is the genetic algorithm and the chosen problem is the travelling salesman problem. The result of this thesis will be implementation of the algorithm, finding the proper setup and lastly the measurment of the results for various input data.
|
|
|
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
|
|
|
Solving Optimization Tasks by PSO Algorithms
González, Marek ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
In this document we describe the Particle Swarm Optimization (PSO) and discuss its performance in solving optimization tasks. PSO is stochastic population-based computational method mainly focused on continuous optimization. We give an introduction to the field of optimization and provide a theoretical description of the PSO method. We have implemented the method in C/C++ and investigated the best working parameter set. The implementation is evaluated on clustering, travelling salesman problem, and function minimization case studies.
|
|
|
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.
|
|
|
Travelling Salesman Problem
Řezníček, Jan ; Zbořil, František (referee) ; Zbořil, František (advisor)
The work focuses on implementing algorithms that solve the Traveling Salesman Problem. It also includes a user interface with a map for importing locations. The main algorithms that are part of the work are ACO and an algorithm that I have devised and implemented. ACO optimization improves results, such as setting initial pheromone levels using the nearest neighbor algorithm. My algorithm works on the principle of gradually improving the path.
|
|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
|
Methods for solving selected vehicle routing problems and their implementation.
Drobný, Michal ; Grygarová, Libuše (advisor) ; Zimmermann, Karel (referee)
Various types of transportation issues are a common practice. The issue may be approached mainly as the distribution of products from suppliers to consumers while minimising distribution costs. The difference of real transportation issues predominantly relates to the considered restrictions, such as capacities of vehicles and orders, time windows and other special distribution restrictions. Transportation issues were already defined by F.L. Hitchcock in 1941 and since then, a wide range of stochastic and non- determinist methods providing solutions to transportation issues have been developed. Nevertheless, introducing distribution restrictions in resolving real-life problems makes it difficult for such methods to be applied. This thesis provides a compilation of the well-known determinist methods that may be used to resolve transportation issues. The methods that are appropriate for resolving real issues are discussed in more detail. The solution procedure of the selected method is demonstrated using simple examples and the results are compared with the results of other methods. An analysis of the above methods is used to design and implement new methods to resolve real transportation issues, their results being compared with the methods provided by the commercial software product.
|
guest ::
