|
|
Optimalization of mixed goods pickup and delivery
Šorf, Michal ; Skočdopolová, Veronika (advisor) ; Dvořák, Marek (referee)
This thesis is focused on the use of linear models in the real world. Its main aim is to devise a mathematical model for a specific problem which is repeatedly encountered by the company Pospíchal s.r.o. and also to find an optimal solution with the help of this model. The thesis is based on basic distribution problems, such as the travelling salesman problem or the vehicle routing problem, which I subsequently modify into the required form. The thesis is divided into three main parts. The first one focuses on the description of basic models that will be modified in the last part. The following part deals with a brief description of the company already mentioned above that provided data without which this task could not be demonstrated in practice. The final part includes a detailed analysis of the given task, formulation and description of the mathematical model, which was created on the basis of specific requirements of the company. There is also a comparison of actual results from practice with optimal results.
|
|
|
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.
|
|
|
Application of optimizing models in milk products distribution
Hanko, Filip ; Fábry, Jan (advisor) ; Skočdopolová, Veronika (referee)
This bachelor thesis focuses on the distribution of SABI milk products into MILK AGRO, spol s.r.o. retail stores, which are located in Prešov. The main objective is to optimize goods distribution and minimize costs. At the same time, the customer's demands have to be fulfilled and vehicle capacity cannot be exceeded. The problem of goods distribution from depot to stores is solved by the Vehicle routing problem model in MPL. It is necessary to consider specifications of a Heterogenous fleet, because the company holds vehicles with different capacities. The practical part includes comparison of costs, which are spent on goods distribution with vehicles of particular capacities. It also includes an application of the Heterogenous fleet vehicle routing problem with time windows to this specific problem. Following interpretation, results from the task are compared with real distribution system used by the company.
|
|
|
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.
|
|
|
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.
|
|
|
Ř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.
|
|
|
Models and methods for routing problems
Nevrlý, Vlastimír ; Žák, Libor (referee) ; Popela, Pavel (advisor)
This master's thesis deals with mathematical model building for routing problems and ways to solve them. There are discussed and implemented deterministic and heuristic approaches that are suitable to be utilized. A big effort is put into building of the mathematical model describing a real world problem from the field of waste management. Appropriate algorithms are developed and modified to solve a particular problem effectively. An original graphical environment is created to illustrate acquired results and perform testing computations.
|
|
|
Travelling Salesman Problem Application in Particular Logistics Enterprise
Ružička, Vladimír ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
This paper deals with optimal distribution issues. One may find listed problems of real life linked to distribution. Moreover, there are explained travelling salesman problem, vehicle routing problem and its variants. This work brings an overview of different ways how to solve vehicle routing problem. In practical part, there is an analysis of distribution of real company. The concept of application is presented in the second part of this paper. This concept could reduce costs of distribution in analyzed company. Testing is aimed mainly on the variant VRPCL (Vehicle Routing Problem with Continuos Loading).
|
|
|
Algorithms for Computerized Optimization of Logistic Combinatorial Problems
Bokiš, Daniel ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
This thesis deals with optimization problems with main focus on logistic Vehicle Routing Problem (VRP). In the first part term optimization is established and most important optimization problems are presented. Next section deals with methods, which are capable of solving those problems. Furthermore it is explored how to apply those methods to specific VRP, along with presenting some enhancement of those algorithms. This thesis also introduces learning method capable of using knowledge of previous solutions. At the end of the paper, experiments are performed to tune the parameters of used algorithms and to discuss benefit of suggested improvements.
|
|
|
Port of OptaPlanner on Android
David, Tomáš ; Rogalewicz, Adam (referee) ; Letko, Zdeněk (advisor)
This thesis deals with portation of the OptaPlanner tool to the Android operating system. The OptaPlanner is used for solving planning problems and it is completely written in the Java programming language which is also used for application development of the Android operating system. However, Android does not contain all of the Java Standard Edition Application Programming Interface libraries and porting of OptaPlanner to Android thus causes dependency problems. The result of the thesis is solution design and implementation of the problems mentioned above and model Android Vehicle Routing Problem application which uses ported OptaPlanner tool.
|
guest ::
