|
|
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.
|
|
|
Travelling salesman problem and method GENIUS
Škopek, Michal ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
The target of this thesis is to explain the Travelling Salesman Problem and also create a special program, which will be able to make calculations using the heuristics GENIUS. The Travelling Salesman Problem will be described from two different points of view. The first one is the historical description of the idea of the Travelling Salesman Problem and later will be the problem will be described with some of the very wide number of the calculation methods. For the explanation of the methods, in the thesis there has been chosen some of the algorithms which belong to that methods. The heuristics and also the exact algorithms will be explained. The focus of this thesis is on the heuristics called GENIUS and also in the creation of the program which can calculate it. The program works first with the GENI algorithm and after that it works with US post-optimization algorithm. The program will be described from the point of view of the user and the manual will be written as well. The program will be tested on two different examples and will be compared with the exact algorithm.
|
|
|
Split delivery vehicle routing problem and its application in a company Ltd. Peter Cremer Central Europe
Richter, Miroslav ; Pelikán, Jan (advisor) ; Černohous, Roman (referee)
Split delivery vehicle rating problem is one of the most studied combinatorial optimization problems in operations research. According to the mathematical difficultness, there should be many problems to find the optimal solution. Therefore, there are many exact algorithms and heuristics, which tries to find the best solution in the short period of time. The theoretical part of this thesis describes the basic facts of the split delivery vehicle routing problem and its heuristics. The practical part focuses on the practical usage of the split delivery vehicle routing problem. The main goals of this thesis are the practical usage of this vehicle routing problem and assistance in strategic decision establishing of the secondary store.
|
|
|
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.
|
|
|
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.
|
|
|
Smart heuristics and what further?
Heller, Daniel
The author presents the work of Gerd Gigerenzer, Peter M. Todd and members of ABC research group who published the book Simple heuristics that make us smart where they explore fast and frugal heuristics, simple rules for making decisions with realistic mental resources. They enable smart choices to be made quickly and with a minimum of information.
|
|
|
Cognitive biases in decision making process
Trejbal, Pavel ; Pstružina, Karel (advisor) ; Jirků, Petr (referee)
The focus of this thesis is mainly on the area of human decision making. During the decision process we are subjected to several influences, which bias our judgement. Therefore, we may be misguided towards wrong decisions. In addition, it is important that the display of distorted influence is regularly repeated with the same persons. Thus, we may assume that we are talking about a universal apparatus of the human mind. The aim of this thesis is also to identify the above-mentioned influences, and mainly to understand the nature of their origin. The knowledge resulting from the research could become important and useful tool for the reader, since the knowledge may be used for the improvement of our own decisions in both private and professional life. The research is based on interdisciplinary approaches to cognitive science. On one hand we use the functional model of mind, on the other hand we utilize a wide range of empirical data from several fields, such as psychology, behavioral economics and the sciences concerned with the brain. Using these tools, we analyze specific influences, which are considered to be important from the point of view of decision making. They are for example feelings, emotions, social influences, language, self, experience, expectations and prior forms of judgement. Based on the analysis of the influences, hypotheses about their interconnectedness are deduced. Finally, we suggest several practical methods, which should help us to improve our own decision making and help us to avoid wrong conclusions.
|
|
| |
|
|
Heuristic Methods for General Routing Problems
Muchna, Jan ; Fábry, Jan (advisor) ; Šindelářová, Irena (referee)
The purpose of this work is an analysis of the current state of heuristic methods and their evaluation based on following attributes: accuracy, speed and quality of coding. The work is divided into 3 sections: an introduction to the general routing problem, methods of evaluations and describtion of tangible heuristics and metaheuristics methods. Following algorithms are depicted - from classical heuristics: Clarke and Wright algorithm, Sweep algorithm, Fisher-Jaikumar algorithm, Repeated matching algorithm, Location based heuristics and Petal heuristics - from metaheuristcs: General methods based on Tabu search, Taburoute algorithm, Adaptive memory method. Particular focus of the work is given to Repeated matching algorithm.
|
guest ::
