|
|
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.
|
|
|
Optimalizace distribuční sítě společnosti DAMIRA DRINKS, s.r.o
Schaffer, Marek
Schaffer, M. Distribution network optimization of DAMIRA DRINKS, Ltd. company. Diploma thesis. Brno: Mendel University in Brno, 2015. This diploma thesis deals with distribution network optimization of chosen company with application of operation research methods. Theoretical part is focused on logistics, operational research, linear programming, travelling salesman problem and programming language JavaScript. The aim of this thesis is to project optimal solution of distribution network using Mayer's method and software STORM. In the conclusion is made final costs comparison of the optimal and the existing solution.
|
|
|
Ant Colony Optimization: Implementace a testování biologicky inspirované optimalizační metody
Havlík, Michal
Havlík, M. Ant Colony Optimization: Implementation and testing of bio-inspired optimization method. Diploma thesis. Brno, 2015. This thesis deals with the implementation and testing of algorithm Ant Colony Optimization as a representative of the family of bio-inspired opti-mization methods. A given algorithm is described, analyzed and subsequently put into context with the problems which can be solved. Based on the collec-ted information is designed implementation that solves the Traveling sale-sman problem. Implementation contains graphical user interface to track the algorithm. Implementation is further optimized using parallel programming and other methods. Finally the implementation compared and summarized results.
|
|
|
Optimization of meter reading route
SVAČINA, František
This thesis deals with the creation of software that will calculate and display the optimized route. The aim was to create software running on the Windows operating system. The basic purpose of the application is to find the most suitable route for the movement of workers, to visit all entered places.
|
|
| |
|
| |
|
| |
guest ::
