|
|
Optimization of packages transport
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This bachelor thesis deals mainly with traveling salesman problem which belongs to the distribution problems and looking for its the best solution. The principle of the solutions of this problem is finding the shortest possible route that includes all of the prescribed addresses and returns to the initial location. Every location must be visited exactly once. There are numbers of modifications such as traveling salesman problem with time windows, courier service problem, dynamic traveling salesman problem and many others. We can solve these problems by using the systems to support modelling or using heuristic or metaheuristic methods. The thesis is divided into two parts, theoretical and practical. In the theoretical part the distribution problems are described, the traveling salesman problem in detail and selected algorithms of heuristic methods. The practical part is focused on the application of these methods which helps us to find the shortest possible route, which the PPL's employee would be able to manage during one day when he distributes packages. The solution is obtained by using an optimization system MPL for Windows, by application the nearest neighbour algorithm, the savings algorithm and the insert algorithm. In conclusion of the thesis all results are summarized and a mutual comparison of the calculation methods is performed.
|
|
|
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
|
|
|
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.
|
|
|
System for solving distribution problems of LP – LINGO/Excel interface
Krčál, Adam ; Jablonský, Josef (advisor) ; Zouharová, Martina (referee)
Discrete problems of linear programming, i. e. problems with integer or binary variables, have a great amount of real-life applications. Among distribution problems, belong many different kinds of problems with discrete character -- transportation problem, container transportation problem, allocation problem, assignment problem, plant location problem, traveling salesman problem etc. In this work the theoretical aspects of chosen types of problems are explained and then an application in Microsoft Excel 2010 environment is created. For that purpose programming language VBA is the key instrument. The application cooperates with two different optimization systems -- the Solver add-in in Excel and professional optimization system Lingo. Functionality of the application is thereafter tested on some examples.
|
|
|
Heuristic methods for messenger problem
Kobzareva, Maria ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This work describes static and dynamic problems with one messenger or multiple number of messengers and suggests a possibility of solving such problems with modified heuristic methods. To solve messenger problem, modified nearest neighbor heuristic, modified insertion heuristic and modified exchange heuristic are used. The main contribution of this work are applications, developed in MS Excel, programmed with Visual Basic for Application, that can solve static and dynamic problems with one messenger or multiple number of messengers and that could be beneficial for companies that do business in messenger services.
|
|
|
An optimization of messenger services
Karbusická, Martina ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
Logistics industry has experienced a great development in recent years and messenger companies are becoming increasingly huge competitor to mail order companies specializing in express shipping. This work defines such terms as traveling salesman or messenger, compares the leading messenger companies in Prague and it is mainly dedicated to Messenger a.s. The main goal of this work is the answer the question whether it is possible to optimize the route of messenger via software and what methods to use for the solving. The VBA application in MS Excel was developed for these purposes. It uses the optimization software Lingo for solving.
|
|
|
Optimization of Distribution of Advertising Brochures
Svobodová, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The goal of my thesis is to optimize the route for replacement of bus schedules in Prague. This task deals with the role of the Traveling Salesman Problem, which belongs to the class NP-hard problems. The solution is numerically very difficult and is gained by using the system LINGO and by using optimization solver Gurobi. The task is modified so that the total time traveled by vehicles does not exceed the specified value. In my thesis I first characterize the problem of replacement of bus schedules. Following chapter is devoted to the role of Traveling Salesman Problem, its history, definitions, problems to solve, possibilities of solution and modification of the tasks on Traveling Salesman Problem with more vehicles. The last chapter deals with the procedure for resolving and results of the problem.
|
|
| |
|
| |
|
|
Route optimalisation for gas-meter reading
Šik, Petr ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis aims to find an optimal route taken by workers reading gas-meters. The text consists of three parts: the collection of necessary data, the selection and subsequent modification of the heuristic method and the calculation itself. Two techniques of data collection are applied: purchase from a specialised company and calculation based on geographical coordinates. These techniques are compared in the end. The method of the nearest neighbour is used for calculation, after being modified for this particular case. The calculation itself is done by the program named Gas-meters, which was created for the purpose of this thesis. The route potentially used by the gas company workers is then the result of the thesis. Furthermore, the thesis presents specific corporate savings possibly brought by using the presented program.
|
guest ::
