|
| |
|
|
The Comparison of the Algorithms for the Solution of Travel Sales Problem
Kopřiva, Jan ; Všetička, Martin (referee) ; Dostál, Petr (advisor)
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
|
|
|
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
|
|
|
Mathematical models for transportation problems
Votavová, Helena ; Novotný, Jan (referee) ; Popela, Pavel (advisor)
The thesis deals with modelling and solution techniques for the selected transportation problems. Firstly, historical remarks and application-related comments are introduced. Then the selected transportation problems are defined and mathematical programming and graph theory concepts are utilised to model them. The travelling salesman problem and suitable algorithms are under focus. The original implementation in GAMS and Python is discussed. Algorithms have been tested for the instance based on the set of 73 towns in the Czech Republic. Finally, the test results are evaluated and compared.
|
|
|
Vehicle routing problem in practice
Tuan Hoang, Anh ; Dlouhá, Zuzana (advisor) ; Kuncová, Martina (referee)
Nowadays, one of the most widely used optimization problem is a travelling salesman problem. That is only the basic model, which is modified by various restrictions and enlargements. In the first part of this bachelor thesis we will focus on theory of distribution problems and their solutions. On the other hand in the second part we will apply the knowledge from the first part to the real task, which requires modifications. We will use the data of the supply company that delivers their orders in Prague with the limited capacities of the vehicles. We will find out the differences between minimizing the total distance and minimizing the total time for delivery, as the distance and time are not linearly dependent. It will be needed to decide, where will be an optimal location for opening the second branch. To solve this tasks, we will not use only heuristic methods for manual calculation, but also optimization software.
|
|
| |
|
|
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
|
|
|
Optimization of medicaments distribution from Movianto s.r.o. Warehouse
Šimáně, Čestmír ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
Nowadays, when great emphasis is put on cost savings, transport optimization is necessary part of every company life in which transportation costs produce significant part. There are optimization methods and possibilities presented in this thesis. In the first chapter there are explained methods such as the travelling salesman problem, the vehicle routing problem, the multiple vehicle routing problem and the split delivery vehicle routing problem and then the reader gets to know the heuristics methods in the chapter two where description of the nearest neighbour method, Clarke-Wright method and split delivery heuristic is mentioned. In the last but one chapter author applies previous methods on concrete distribution arranged by Movianto Česká republika s.r.o. on 5th September, 2013. Based on gained outputs, analysis and comparison of results (including the original distribution) are provided in the fourth chapter. Obtained results of analysis lead to recommendation on how the company should plan its future distribution.
|
|
|
Optimization in a maintenance service of tram switches
Marková, Petra ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
The goal of this work is to evaluate the effectiveness of the current existing route plan and the schedule of working hours for employees of a maintenance service of tram switches. In addition, the work is aimed at proposing a plan of individual routes for servicemen in the case of a reduction of number of employees in order to save salary costs. The problem is formulated as the travelling salesman problem, the most frequently used scheme for solving circular traffic problems. Specifically, we solve the problem of several salesmen with one common depot and apply methods of linear programming. Several different models were tested in order to achieve the best improvement. Because of NP-hardness of the problem, we applied the heuristic algorithm of the nearest neighbour. We found a solution similar to that of the existing maintenance plan but with more uniform route time durations for individual service workers. The proposed solution eliminates large fluctuations of route times for individual servicemen. We also propose a route plan for a reduced number of servicemen of tram switches with an acceptable change of working hours.
|
|
|
Modern Methods and Tools to Support Managerial Decision
Krčil, Jakub ; Voráček, Jan (advisor) ; Novák, Michal (referee)
This master's thesis is focused on modern methods and tools to support managerial decision-making. The first part of this thesis introduces the basic characteristics related to the management and managerial decision-making that are subsequently extended to the area of modeling, simulation, optimization and multi-criteria decision making. It also outlines the relationship between the managerial decision-making tasks. The second part introduces practical examples which show the connection of these areas. Specifically, they are a colony of ants, traveling salesman problem, a tool AnyLogic, analytic hierarchy process and simulation HealthBound. The thesis is further supplemented by an appropriate software tools to support multi-criteria decision making.
|
guest ::
