|
|
Optimization of Routes for Travel Agencies
Hal, Marek ; Kučera, Petr (advisor) ; Klára, Klára (referee)
This diploma thesis deals with an issue of tour-routes and an optimization of routes for travel agencies, namely the Rialto travel agency from the city Přerov. Two tours, offered by this travel agency, are optimized and three optimization methods are used - the nearest neighbour metho, the Vogel approximation Method and the savings method.
The first part of this thesis describes the theoretical issue of topic - the legislation concerning the travel agencies, transportation logistics, the usage of operations research in transport logistics and travelling salesman problem issue and methods used to solve the travelling salesman problem. In the second part the Rialto travel agency is briefly described, then the tours are described and these tours are optimized.
The last part contents the analysis of obtained results, the results are evaluated and suggestions considering the economic, temporal and legislative (rest and working hours of drivers) aspects are made.
|
|
|
Optimization of Transportation Routes between a Chosen Company and Its Clients
Mazánek, Tomáš ; Kučera, Petr (advisor) ; Petr, Petr (referee)
The subject of this diploma thesis titled "Optimization of Transportation Routes between a Chosen Company and Its Clients" is the logistic routes optimization of the selected company, which is in thesis case company MITRANS - HK s.r.o. From company routes portfolio all circle routes are selected, which are lately solved by different methods, which are used for traveling salesman problem. Then the provided results are evaluated and compared between themselves and between real used routes variants. The thesis also handle the economic efficiency of optimization, which is presented on solved routes.
|
|
|
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.
|
|
|
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.
|
|
|
Parcel pick-up optimization
Kozárová, Barbora ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
Vehicle routing problems solve problems of optimizing the transport routes. The principle of solutions of problems of the first type is finding the shortest circuit that begins and ends in the same place and includes places that can be visited in any order, each of them has to be visited exactly once. In the second type of problems there is also considered the size of the requirements and the capacity of the vehicle, which has to return back to the store. Both tasks can be extended to the so-called time windows, which indicate the interval between the earliest possible and latest allowable start of the customer service. This work aims to calculate the optimal route for the drivers of unnamed wholesale company. The objective is to minimize the distance travelled per day in order to reduce fuel costs. The solution is implemented using the models of Travelling Salesman problem, Vehicle Routing problem and their modifications with time windows through systems LINGO, eventually GUROBI, and MPL for Windows. To illustrate the application of heuristic methods the calculation is carried out by savings method.
|
|
|
Application of Heuristics on Vehicle Routing Problem
Gerlich, Michal ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with solving a real case from one specific part of Operations Research -- Discrete Models. The case can be classified as Vehicle Routing Problem (VRP) which is a subset of classical Travelling Salesman Problem (TSP). The VRP is modified TSP when requirements of customers and capacities of trucks play role. The data needed for calculations were taken from the real situation of Pivovar Svijany a.s. The problem can be defined as VRP with cars with different capacities and split delivery. Even though the mathematic model of the problem is known and described in the thesis, the size of the problem is too big to be optimized. Therefore heuristic was used to solve it. Because of the good computational results in the past the savings algorithm was chosen. Its model was set using Visual Basic for Applications (VBA). The thesis (among others) analyses the sensitivity of the output on the values of the factors that can be chosen by the analyst. At the end of the thesis the best found solution is presented and the initial and the new scheme of the circles are compared.
|
|
|
Design and application of heuristics in distribution of ordered products to the consumers of NIKOL NÁPOJE a. s. company
Solnická, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with the optimization of distribution of products to consumers based on a real case study of a particular company from Opava. For this purpose, a mathematical optimization model is used to illustrate the vehicle routing problem. The study will also offer an explanation on the relevancy of heuristic methods, mainly with respect to their application in solving real life situations analogous to the one surveyed. On the basis of chosen heuristic methods (i.e. the nearest neighbour algorithm and the savings algorithm) and having taken into account the restricting conditions of the company, four algorithms were designed. These four algorithms are programmed in Visual Basic for Applications MS Excel 2007. They are aimed at solving the real problems with the distribution of ordered products that the particular company must deal with. The thesis compares the results provided by an employee of this company, and the results presented by the designed algorithms.
|
|
|
Optimization distribution and collection of infusion solutions
Kravciv, Zbyněk ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
There are many distribution tasks, that vary in a number of vehicles, time windows, dividend or undivided delivery or if it is static problems or dynamic problems. In this essay I focus just on few of them. At first I put my mind to simple statistic distribution task with one vehicle. Later I extend it with time windows, when the point can be served by one car and by many cars. In the essay it will be solved the real task of distribution and delivery transportation of infusion in the hospitals. Because of the difficulty of solution I have to use the heuristic methods - Method of nearest neighbour, Savings method and Insert method. All these methods are modified by capacity requirements, time windows and also observence of the rules, which the drivers have to keep during a distribution. The aim is to minimize the distance travelled by the vehicles. And at least the company could be recommended the best solution.
|
|
| |
guest ::
