|
|
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.
|
|
|
Heuristic Methods for Solving Generalized Vehicle Routing Problems
Kalendovský, Jan ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The goal of the diploma thesis is to introduce and describe a heuristic method for finding a sub-optimal system of circuits in a generalized vehicle routing problem with time windows and time-dependent unit costs. Proposed method was built up on Clarke and Wright's savings method for the standard vehicle routing problem. Additionally, there has been described an algorithm for improving current solution via finding an optimal time harmonogram for a journey on each circuit within the found sub-optimal system of circuits.
|
|
|
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.
|
|
|
Planning cash delivery to exchange offices using Vehicle Routing Problem with Time Series
Mouchová, Denisa ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
The purpose of this bachelor thesis is to apply vehicle routing problem with time series to a real case study. At first vehicle routing problem is classified into Operations Research and Travelling Salesman Problem. Then a simple vehicle routing problem and a multiple vehicle routing problem are described as well as their modifications with time series. Some heuristic algorithms and steps of nearest neighbour algorithm are described. The next part is focused on the application. It starts with introducing the company that is specialized in an exchange business and description of the situation that presents its assignments. There are three assignments in total. The first and second assignments are related to the optimization of cash delivery to company's branches. The second one also allows the company send a parcel with cash instead of its own delivery. The third assignment is to calculate whether a conversion cars into propellant gas is budget-wise or not. These assignments are solved and the results are commented.
|
|
|
Optimal routes for Euro pallet transporting
Juříčková, Ivana ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
This diploma thesis describes a logistic problem of the company JACER-CZ Ltd. The main focus is on identifying optimal routes about the Euro pallets distribution. The Euro pallets are standardized at length replaceable transport pallets which are in Europe. The aim of this thesis is to find a solution which will meet requirements of all thirteen customers and simultaneously a total route length of all vans will be minimalized. At first there is the mathematical model about the delivery assignment with the split delivery vehicle calculated by solvers CPLEX and Gurobi. Then the original and the modified example is solved manually by heuristic algorithms. It is concerned the nearest neighbour algorithm, savings algorithm, the insertion algorithm and the heuristic method for the split delivery vehicle routing problem.
|
|
|
Design and implementation of vehicle routing problem software library
Drobný, Michal ; Gála, Libor (advisor) ; Melechovský, Jan (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. There are some specialized commercial products for optimizing distribution costs presented on the market. These are often part of larger frameworks, which also provides other services such as vehicle tracking, warehouse location, ride statements etc. These products provide cloud services fully customized according to the customer. This work aims to design and construct an open source software library for solving vehicle routing problem, which will be able to reflect requirements of simplicity, scalability and portability. The constructed library can serve not only as an open source solution for vehicle routing problems, but also as a tool for testing new methods studied on university premises. The work is divided into several parts. In the first part we define the goals of this work, we define the vehicle routing problem and we describe the principles of the solution. In the next section, we propose the structure of the software, we discuss the choice of aids and document a design phase. The last part deals with the implementation phase, validation phase and real use of the software.
|
|
|
Milkrun optimization in automotive industry
Václavů, Tomáš ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
At the basic there is a connection between operation research and automotive logistics. The supply chain in this type of industry is hard to coordinate and flexibility is considered as a main key indicator. Companies increase their competitiveness through the optimization of supply chain and try to take control of every flow or a process. This idea goes throughout the departments. The main concept, which is about a connection of whole supply chain with information flow means, that there isn't need of stock and every input is highly available on time and in requested quantity and quality. This thesis describes inbound logistics and introduces some of the methods used for planning vehicle routes. In our situation which is based on car maker data set was chosen a group of a suppliers for the analysis. We used vehicle routing problem with some modifications, heuristics based on the covering problem. Founded solution was compared with the present state.
|
|
|
Use of savings algorithm in messenger problem
Gőtz, Ondřej ; Fábry, Jan (advisor) ; Kobzareva, Maria (referee)
The diploma thesis deals with the use of heuristic methods for solving messenger problems. The first part focuses on the proposed vehicle routing problems, especially on travelling salesman problems and the messenger problems. For individual problems are theoretically discussed mathematical models for variants with one or more vehicles and the expansion of the use of time windows and capacity constraints. The second part introduces heuristic algorithms for the method of nearest neighbour, savings method, insertion method and the exchange method on the travelling salesman problems. Then all of the mentioned algorithms are modified for use in three variants of messenger problem. First, the disposition of one vehicle, the second allows more messengers in the same starting point and the last option is more messengers at different starting points. The last part describes computational experiments and comparison of results provided by different methods. The diploma thesis includes application for solving messenger problems using savings methods programmed in Visual Basic for Application in MS Excel.
|
|
|
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.
|
|
|
Optimalization of the beer distribution in Jesenicko
Krčmář, Pavel ; Fábry, Jan (advisor) ; Suchánková, Tereza (referee)
The thesis deals with application of models of routing problems on a real problem, beer distribution in Jesenicko region provided by Viden plus, a.s. The goal of the thesis is to optimize daily distributional routes for two vehicles with different capacities. Total distance has to be minimized respecting time and capacity limits. In case the optimal solution is not found, sub-optimal solution will be accepted. Solutions are calculated with use of the optimization software LINGO and some heuristic methods. Models of travelling salesman problem and vehicle routing problem are used to find the solutions. Results are compared to the current state of distributional routes in conclusion of the thesis.
|
guest ::
