|
| |
|
|
The Optimization of Maintenance of Bus Stops
Svobodová, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
The aim of my thesis is to find the shortest total route to export trash at the bus stops for several variants and also determine the suitability of approximate algorithms. The tasks are solved by insertion heuristic, closest neighbor heuristic and optimization. The optimal solution is gained by using the system LINGO and by using optimization solver CPLEX. In my thesis I first describe the problem of maintenance of bus stops. Following chapter is devoted to the role of routing problems, its classifications, problems to solve, possibilities of solution. The used methods are Traveling Salesman Problem with one or multiple vehicles available in a unique depot and Vehicle Routing Problem with one or multiple vehicles available in a unique depot or multiple depots. The last chapter describes and compare the results of the solution of insertion heuristic, closest neighbor heuristic and optimization for problem of replacement of bus schedules and of maintenance of bus stops.
|
|
|
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.
|
|
|
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.
|
|
|
Application of the Vehicle Routing Problem in Geodesy Jobs
Richtr, Vít ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
The Vehicle Routing Problem -- part of distribution problems in linear programming -- has a lot of real forms and applications. This work dealing with optimization real data afforded by geodetic company. The target is complete effective workweek design of the orders so as to working hours will be efficient and long ways between destinations will be minimized. In the first part of application the work is solve without any limitations. In the second part the condition is add that declare utmost day of orders serve. The setting is solving by two heuristic methods -- the nearest neighbour search and the Clark-Wright algorithm -- and with the aid of optimization systems LINGO and Gurobi. The results of several methods are analyzed and confronted with each other.
|
|
| |
|
|
Route optimalisation for gas-meter reading
Šik, Petr ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis aims to find an optimal route taken by workers reading gas-meters. The text consists of three parts: the collection of necessary data, the selection and subsequent modification of the heuristic method and the calculation itself. Two techniques of data collection are applied: purchase from a specialised company and calculation based on geographical coordinates. These techniques are compared in the end. The method of the nearest neighbour is used for calculation, after being modified for this particular case. The calculation itself is done by the program named Gas-meters, which was created for the purpose of this thesis. The route potentially used by the gas company workers is then the result of the thesis. Furthermore, the thesis presents specific corporate savings possibly brought by using the presented program.
|
|
|
Application of Heuristic Methods for Vehicle Routing Problem with Time Windows
Chytrá, Alena ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis demonstrates practical using of vehicle routing problem with time windows (VRPTW) and its solution by heuristic method. There are described teoretical principles of integer models, mathematical definitions of VRP with one or more vehicles, VRPTW and some heuristics for VRP. The practical part is solution of VRP by heuristic nearest neighbor. Product distribution is planed according to the firm settings in Prague. I compare existing situation and computed solution that show benefits of using described methods in conclusion.
|
guest ::
