|
|
Support of management decision-making on transport networks
Přibyl, Vladimír ; Černý, Jan (advisor) ; Kavička, Antonín (referee) ; Peško, Štefan (referee)
The presented thesis is focused on a set of problems related to managerial decision-making concerning networks (particularly transportation networks), respectively - if we put it more precisely - the thesis focuses on the support of this decision-making by means of quantitative methods. A set of problems related to nets and decision-making concerning their individual parts or elements represents a very complex sphere which has been a subject of research for a number of decades. Out of this sphere, the thesis formulates and elaborates in great detail two problems, which - from the point of view of their practical significance - are important for the decision-making of managers of carriers, or the public sphere, and which have not been published in this form yet. The main point is the problem of how to find a subnet with a limited prolongation of routes between important pairs of vertices. Another problem is a design of a bus route in an area with a low demand. For each of these problems, the thesis offers an exact combinatorial solution method, furthermore a method based on integer linear programming, and - last but not least - also, of course, heuristic methods of solution. All these methods have been tested on a set of networks, which has been created for this purpose in a pseudo-random way in the frame of this thesis. The testing has been focused primarily on the comparison of the results provided by heuristic methods, which are of great importance - with regard to a great computational difficulty of exact methods - for feasible tasks on a larger scale. The tests have proved that the proposed heuristic methods are practically applicable and show results whicheven represent the optimal solution in a number of cases, or are only slightly distant from the optimal solution.
|
|
|
Heuristic for dynamic traveling salesman problem
Belfín, Martin ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis consists of two parts: text and programming part. It is divided into seven chapters. Its main goal is to compare heuristics for dynamic traveling salesman problem in a few perspectives. The text part of this thesis theoretically describes heuristic methods and in the programming part are wake up to life via VBA in MS Excel. The results of computational experiments on these heuristic methods are presented in the last chapter. In the first part, the traveling salesman problem and its solution are being described. Characteristic of the modification in a form of dynamic traveling salesman problem follow. Next chapter presents the programming solution chosen heuristics. The final chapter presents experimental results obtain with programmed heuristics.
|
|
|
Heuristics testing for travelling salesman problem
Dítětová, Tereza ; Jablonský, Josef (advisor) ; Fábry, Jan (referee)
The travelling salesman problem is one of the most popular kind of route trip transportation problem. This work empirically compares two chosen heuristics, giving only approximate solution in the TSP, with an optimal solution. Travelling salesman problem is easy to formulate but difficult to solve that is what makes this problem so attractive. The first chapter is focused on the theoretical definition including a historical overview, the second chapter describes selected heuristics methods for solving the TSP. The third chapter contains the results of my computing experiments that were made through an application programmed by me. The results show the nearest neighbour heuristic as more effective than the savings heuristic, both in the computation speed and the closeness to the optimum.
|
|
|
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.
|
|
|
Watering garden problem
Janovský, Martin ; Kalčevová, Jana (advisor) ; Mynařík, Petr (referee)
Watering garden problem is focused on using a special methods of linear programming on real garden. Especially using of travelling salesman problem and vehicle routing problem. Practices of these methods are demonstrated on real garden. The problem comes when it's necessary to find an optimal path between source of water and plants needing some water. Both problems (travelling salesman problem and vehicle routing problem) are solved through optimization software and heuristic methods (method of the nearest neighbour, savings method and method of the cheapest input). Main goal is to find the best solution which is usable.
|
|
|
An Application of Travelling Salesman Problem for a Delivery Transportation
Havlová, Irena ; Skočdopolová, Veronika (advisor) ; Kuncová, Martina (referee)
Optimal route or the most suitable configuration finding occurs in different areas of human activities as science, engineering or business. In mathematics these problems are usually assigned to Travelling Salesman Problem (TSP) and its modifications. This thesis is devoted to finding a solution of TSP using a linear model and some simpler heuristics such as Method of the Closest Neighbour. The practical part of the thesis shows usage of TSP for delivery transportation of warranty orders in a part of a wholesale network, including a solution of route divided into more than one cycle. Upon obtained results some financial comparison of the present and potential situation is given.
|
|
|
Optimization of electronic goods distribution
Svobodová, Šárka ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis is aimed on time frame distribution task. In the theoretical part is described the mathematical model of this task and introduced in detail two concrete heuristics: greedy look-ahead and AKRed. In the practical part of the thesis has been a real situation solved with using of sophisticated optimalization software and through own implemented heuristic. These two solution are then compared each other and applicability of each heuristics for the given real problem is evaluated.
|
|
|
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.
|
|
|
Strategical decision of Baťa a.s.
Plášková, Pavlína ; Fábry, Jan (advisor) ; Tichý, Filip (referee)
In this thesis we report several of delivery problems. Here it is mostly describe Vehicle Routing Problem and Split Delivery Problem as suitable methods for the case study of the company Baťa a.s.In this thesis we used one of the most sofisticated software Roadnet Transportation Suite as effective program for distribution and planning routes.Finally we construct analysis as a support to find the optimal solution for the final strategical decision of the company Baťa a.s.
|
guest ::
