|
| |
|
|
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.
|
|
|
Integer Optimization for Transportation Problems
Cabalka, Matouš ; Žák, Libor (referee) ; Popela, Pavel (advisor)
The thesis deals with optimization models in transportation problems with emphasis on traveling salesman problem. Brief introduction to the history is followed by theoretical part describing linear programming, integer programming and formulation of traveling salesman problem. Description of data preprocessing is included. Finally computational results are discussed and evaluated.
|
|
| |
|
|
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.
|
|
|
The determination of the route for running footraces by a modification Travelling Salesman Problem
Havel, Filip ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with finding the optimal route for running footraces. This work seeks to find a link that determines a lap with a predetermined beginning and a goal at the same time, given the possibility of 251 intersections. This model is derived from the travelling salesman problem, whose primary task is to pass the specified set of places according to the shortest route or in the shortest possible time and to return back to the starting point while visiting each place only once. Of course, the routes searched for in this work may be differentiated in several aspects. First of all, it is not necessary to include all of the places you can visit multiple times. The resulting route does not have to be the shortest, but it should have a certain span of distance, as the height metrics obtained are the key factor for optimization. A solution with the exact methods will be demonstrated by the LINGO optimization software, but only for a higher computational difficulty with a limited range of tasks, 21 junctions in the city center. Determining a longer route on a larger set of intersections will allow for derived heuristics with working names: the furthest neighbor with the smallest ascent and a minimal profile change. Part of the thesis is a detailed description of the mathematical model used, the general procedure, along with both a demonstration and an analysis of the applied heuristics.
|
|
|
Optimalization of distribution of immobile clients
Maříková, Eliška ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
Distribution problems today belong to one of the most used mathematical models in our everyday life. You can come across them when delivering items or transporting people. In my work I deal with the application of the distribution problems and their modification to transporting of handicapped people, specially for finding a route for the transfer of customers from the starting point to its destination while maintaining the capacities of the vehicles with the subsequent extension of the time windows and a further modification in the form of finding the routes where the customer is transported from the final destination point back to its starting point. To find the optimal solution, the combination of traveling salesman problem and the vehicle routing problem is used in my Bachelor thesis. The model is applied to real-time data from the company Societa o. p. s., which is one of the major companies in providing services to immobile people. The software MPL was used to calculate the optimal solution
|
|
|
Optimization of a a route for collecting waste with Traveling Salesman Problem
Trnka, Zdeněk ; Borovička, Adam (advisor) ; Pelikán, Jan (referee)
The Bachelor's dissertation deals with optimization of route designed for collecting communal waste of a company FCC Czech Republic, Ltd. Dissertation search for the most suitable method to solve the real-life example. So formed economic model is to be solved via Traveling Salesman Problem method, whose mathematical model, modifications and solutions options are described in detail in theoretical sections of the dissertation. Exact methods, which are suitable for smaller problem, and heuristic methods, which did not have to give optimal solution, can be used for solving the Traveling Salesman Problem. The Traveling Salesman Problem will be solved here with help of modeling software MPL for Windows. There will be also used two heuristic approaches - Nearest Neighbor algorithm and Savings method. Due to increasing efficiency, a modified Traveling Salesman Problem with Time Windows will be used and solved also through MPL for Windows. To close the dissertation, the result will be summarized and compare firstly among each other and secondly against current company route.
|
|
|
Application of Vehicle Routing Problem in Geocaching
Frolík, Tomáš ; Skočdopolová, Veronika (advisor) ; Sekničková, Jana (referee)
Geocaching is a worldwide game that uses Global Positioning System (GPS). Most play-ers try to create a route to search for caches to make it as short as possible. The aim of the bachelor thesis is to design a model to be able to create the shortest route between individual caches under certain restrictive conditions within five independent circuits. The first part of the thesis presents the basic theoretical knowledge necessary for un-derstanding practical part. The second part is devoted to the basic terms of geocaching. Furthermore in the second chapter, the basic model, its individual variables, equations and evaluation are presented within the Vehicle Routing Problem. As a result, the mod-el is not entirely correct and needs to be expanded by a third index, which sets the conditions for each created circuit separately.
|
|
|
Management of logistics processes municipal waste processing
Anděrová, Veronika ; Černá, Anna (advisor) ; Váchová, Lucie (referee)
The aim of this diploma thesis is to describe the logistic processes in the processing of municipal waste in the company Local Enterprise in Hluboká nad Vltavou. Describe the business and analyze its decision-making issues. Then analyze the current situation and propose changes to apply optimization methods through a special computer program. The conclusion of the thesis is a concrete proposal of route optimization to improve the current situation of the company, which will lead to a positive economic effect on logistics of waste processing.
|
guest ::
