|
|
Vehicle Routing Problem
Kafka, Ondřej ; Branda, Martin (advisor) ; Hanzák, Tomáš (referee)
The thesis deals with optimization problems which arise at distribution planning. These problems can often be easily formulated as integer programming problems, but rarely can be solved using mixed integer programming techniques. Therefore, it is necessary to study the efficiency of heuristic algorithms. The main focus of the thesis is on the vehicle routing problem with time windows. A tabu search algorithm for this problem was developed and implemented. It uses integer programming to solve the set partitioning problem in order to find optimal distribution of all customers into feasible routes found during the search. The results of the classical integer programming approach, basic insertion heuristic and presented tabu search algorithm are compared in a numerical study.
|
|
|
Route optimization for the parcels distribution
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Čížek, Ondřej (referee)
This thesis deals with optimization problems of the parcels distribution. This issue can be solved on the ground of traveling salesman problem whose mathematical and economic model, including their modifications, are presented in the theoretical part of the thesis. We can solve these problems by using exact methods, heuristic and metaheuristic algorithms. In the theoretical part are described traveling salesman problem, traveling salesman problem with time windows, traveling salesman problem with multiple time windows and dynamic traveling salesman problem including possible ways of solution. In the practical part we can find application of problems on the real example, when we are finding the shortest possible route for the PPL's employee under different assumptions. The solution is obtained by using solver Gurobi within the modelling system MPL for Windows. In conclusion of the thesis the results are summarized and models are compared with each other.
|
|
|
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.
|
|
|
Řešení optimální cesty svozu odpadů pomocí rojové inteligence
VÁCHA, Ladislav
This work is focused on problem-solving nondeterministically polynomial (NP) complexity using ant colony optimization. The work is divided into three blocks. The first is approximated aforementioned optimization along with some modifications. The second part focuses on the problems themselves, in this case, the traveling salesman problem (TSP), from which the vehicle routing problem (VRP). The final part of this thesis describes the use of these tools for the collection of separated waste for district of the České Budějovice.
|
|
|
Risk modelling for production processes
Ftáčnik, Peter ; Bednář, Josef (referee) ; Popela, Pavel (advisor)
The processes and procedures covered the main core of the professional operations in the manufacturing plant. The enterprise should focus on the efficient running of the main processes and risks associated with these procedures. My thesis deals with the risk analysis of selected manufacturing processes particular company from qualitative and quantitative point of view. First, the results are presented from qualitative risk analysis, especially in scope of failures of the machines or in the sequences of production. Second part focus on the problems of optimization sequence batches that the total time required for pre-setting of machines between doses should be minimal. The thesis also takes random waiting period into the consideration and applies wait-and-see approach of stochaistic programming applied in task traveling salesman. Calculations are processed by the GAMS. The results from the GAMS are refered in MS Excel, they are further discussed and interpreted by using descriptive statistics.
|
|
| |
|
|
Solving Optimization Tasks by ACO Algorithms
Habrnál, Matěj ; Samek, Jan (referee) ; Zbořil, František (advisor)
The presented thesis puts its main focus on the basic optimization algorithms ACO (Ant Colony Optimization) and their development and seeks the inspiration in the ants live. The aim is to demonstrate the activity of these algorithms on optimization problems - the traveling salesman problem and the finding food sources problem and optimal routes between an anthill and food. The thesis also describes experiments that try to determine the influence of adjustable parameters of ant algorithms. First, ACO algorithms theory is described followed then by the application of these algorithms on both selected optimization problems. The conclusion sums up experiments analysis with established applications and evaluating prospective results.
|
|
| |
|
|
Comparison of Methods for Travelling Salesman Problem
Šušová, Lucia ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
This work is about comparison of methods for solving the traveling salesman problem. There are many algorithms for finding solution of this NP complete problem but it is not easy to choose the right one. Main goal of this thesis is experimental methods comparison between each other. Reader is going to learn what result she can expect if she chooses certain algorithm for finding the path. First part is focused on theoretical basics where is described all needed information for understanding the problem. Second part describes single heuristics and methods for solving these problems. The methods are divided into groups by principle of working. Next part contains experimental comparison of methods. This comparison was done based on own implementation of single heuristics. The following part of this work contains information about this implementation and also describes comparison application. Next possible steps of this project are described in conclusion.
|
|
|
Solving of Optimisation Tasks Inspired by Living Organisms
Popek, Miloš ; Peringer, Petr (referee) ; Martinek, David (advisor)
We meet with solving of optimization problems every day, when we try to do our tasks in the best way. An Ant Colony Optimization is an algorithm inspired by behavior of ants seeking a source of food. The Ant Colony Optimization is successfuly using on optimization tasks, on which is not possible to use a classical optimization methods. A Genetic Algorithm is inspired by transmision of a genetic information during crossover. The Genetic Algorithm is used for solving optimization tasks like the ACO algorithm. The result of my master's thesis is created simulator for solving choosen optimization tasks by the ACO algorithm and the Genetic Algorithm and a comparison of gained results on implemented tasks.
|
guest ::
