|
|
Vehicle Routing Problem with Private and Common Carriers
Zikmund, Adam ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with a problem from the field of combinatorial optimization called Vehicle Routing Problem with Private and Common Carriers (VRPPC). A complete undirected symmetric graph is given. The task is to satisfy demands in all nodes with minimal total costs. There are two possibilities of doing so. Either private fleet or common carrier can be used for the transport of the demanded goods. The private costs depend on the covered distance whereas the common costs are conditional only on the weight of demand. Several heuristic methods for solving this problem are proposed and tested on three experimental instances of different sizes (in terms of number of nodes). Emphasis is primarily put on comparison between the presented heuristic and the classical optimization approach, which can often lead to inferior results (especially in case of larger instances) because of the computational complexity of the given problem.
|
|
|
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 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.
|
|
|
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.
|
|
|
Vehicle Routing Problem and its modifications
Pajonk, Tomáš ; Pelikán, Jan (advisor)
Cílem této práce je zpřehlednit vstup k rozvozním problémů, jak z pohledu teoretického, tak pohledu praktického. Zpočátku jsou rozepsány aplikace těchto modelů, jejich klasifikace. V další části jsou podrobněji formulovány nejčastější modifikace objevující se v literatuře. V poslední části jsou shrnuty zkušenosti s programováním a implementací konkrétní metaheuristiky, která je schopna řešit velkou část výše popsaných modelů.
|
|
|
Optimization of distribution of bakery goods
Gebauerová, Monika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with the optimization of distribution of bakery products. Firstly there are the fundamental types of vehicle routing problems and their optimization models introduced. Next part is dedicated to heuristic algorithms. The heuristic methods are introduced in general, then there are the chosen methods described. Later there are two chosen algorithms formulated. First one based on the nearest neighbour method and another one based on the savings algorithm. Both of algorithms were programmed in the Visual Basic of Applications MS Excel 2010. These algorithms were applied for the solution of the real problem dealing with the distribution of goods. The bakery company has provided the data about its customers for this purpose. The last part of this thesis is dedicated to the summary and comparison of the solution of the assigned problem that was gained by the proposed algorithms with the solution that the bakery company has put into practice.
|
|
|
Heineken Beer Distribution Optimalisation
Vršecká, Renáta ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with real logistic problem of the Heineken CZ Company. The company sets down an itinerary for each vehicle to distribute its goods to particular customers on daily basis. These itineraries are created manually, only with the skill of experienced driver. The goal of this thesis is to find a solution with an algorithm, which will be able to set optimal itineraries of all vehicles, so the total distance and therefore operating costs are minimized, with only the knowledge of distances between each two nodes.
|
|
|
Optimalization of distribution process in trading company
Scigel, Pavel ; Jablonský, Josef (advisor) ; Kořenář, Václav (referee)
The thesis deals with distribution problems and their methods for their solution. They belong to one of the most often used optimization models in practice. The thesis describes background for using modelling support systems LINGO and MPL for Windows. The modelling languages allow solving all problems described in the theoretical part including the travelling salesman problem and the vehicle routing problem. There are described basic heuristic methods for problems with higher number of variables in this work as well. The thesis includes the description of a real situation for which it is possible to apply travelling salesman problem or vehicle routing problem models. It is a complex problem which cannot be solved by exact methods but heuristic methods must be used. The problem is going to be solved by means of MS Excel together with Visual Basic for Applications using the heuristic method of nearest neighbour.
|
|
|
Optimization of Business Trips Schedule -Vehicle Routing Problem Application
Dvořáčková, Tereza ; Šindelářová, Irena (advisor) ; Skočdopolová, Veronika (referee)
My bachelor thesis deals with the special linear programming problems, so called distribution problems. Special attention is paid to the travelling salesman problem (TSP) and the vehicle routing problem (VRP). The introductory theoretical chapters explain mathematical models of selected distribution problems, as well the description of some heuristic methods for solving the TSP problem. The modifications of these heuristics are then applied to the real vehicle routing problem. In that real task (included in the last part of this thesis) the daily schedule for a sales representative of one unnamed Czech company is optimized. That sales representative regularly attends customers in his assigned territory and my optimization is focused on saving his time. The results obtained by means of heuristics as well by LINGO software are compared in the thesis conclusion. In chapter 3.5 the real task was modified by means of introducing new limitations, so-called time windows. The results of my thesis will be present to the company.
|
guest ::
