|
|
Inventory routing problem
Špolc, Miroslav ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
Inventory routing problem is a mathematical method of operations research, consisting of two basic models (vehicle routing problem and inventory allocation). The goal of this master thesis is to introduce the reader to what exactly inventory routing is, why and how it was created and how it evolved over the course of years. Also, some examples of actual real-life applications of the problem will be shown together with the results of their implementation. Researches and papers of the last almost 40 years, written by experts on the subject are used as the source for this master thesis. From these works, the summarizing thesis was written, putting together the most important knowledge on how to solve the problem. Its contribution is not just the explanation of the theory and its development, but also introduction of some real applications of Inventory routing. Applicability of the model and its positive results in the form of cost savings is shown on real examples.
|
|
|
Optimalization of distribution of immobile clients
Maříková, Eliška ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
Distribution problems today belong to one of the most used mathematical models in our everyday life. You can come across them when delivering items or transporting people. In my work I deal with the application of the distribution problems and their modification to transporting of handicapped people, specially for finding a route for the transfer of customers from the starting point to its destination while maintaining the capacities of the vehicles with the subsequent extension of the time windows and a further modification in the form of finding the routes where the customer is transported from the final destination point back to its starting point. To find the optimal solution, the combination of traveling salesman problem and the vehicle routing problem is used in my Bachelor thesis. The model is applied to real-time data from the company Societa o. p. s., which is one of the major companies in providing services to immobile people. The software MPL was used to calculate the optimal solution
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
An optimization of lunch distribution
Václavů, Tomáš ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
The purpose of this bachelor thesis is optimization of lunch distribution. At first the company and the task for optimization will be introduced. Then real are modified to be used for optimization. A distance matrix is created with suitable reduction of requests to easier the problem. In the theoretical part the suitable models of vehicle routing problem will be introduced with an extension to vehicle routing problem with time windows. Chosen model is fitted to our problem to count the solution. There is a real data software optimization. To find the best feasible solution we use different software products. Usable solution will be tested in probationary distribution after check. Finally there is a request of feedback.
|
|
|
Optimization of production and distribution in bakery
Bilá, Tereza ; Kalčevová, Jana (advisor) ; Flusserová, Lenka (referee)
The subject of this bachelor thesis is optimization of production and distribution. The thesis aims to introduce the production problem in the case that the production limits are known and present its solution using a modified simplex method with lower or upper limits. The vehicle routing problem with one distribution centre and one vehicle will then be introduced. In the practical part of the thesis, these methods are applied in real-life data from the Martínek bakery business. The optimal production, which is targeting to maximize the profit under the given terms, and the optimal distribution from the bakery to shops, will be determined. At the end of the thesis, there is an evaluation of the given targets.
|
guest ::
