|
|
Vehicle Routing Problem with Private and Common Carriers
Zikmund, Adam ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
This diploma thesis deals with a problem from the field of combinatorial optimization called Vehicle Routing Problem with Private and Common Carriers (VRPPC). A complete undirected symmetric graph is given. The task is to satisfy demands in all nodes with minimal total costs. There are two possibilities of doing so. Either private fleet or common carrier can be used for the transport of the demanded goods. The private costs depend on the covered distance whereas the common costs are conditional only on the weight of demand. Several heuristic methods for solving this problem are proposed and tested on three experimental instances of different sizes (in terms of number of nodes). Emphasis is primarily put on comparison between the presented heuristic and the classical optimization approach, which can often lead to inferior results (especially in case of larger instances) because of the computational complexity of the given problem.
|
|
|
Optimization of a a route for collecting waste with Traveling Salesman Problem
Trnka, Zdeněk ; Borovička, Adam (advisor) ; Pelikán, Jan (referee)
The Bachelor's dissertation deals with optimization of route designed for collecting communal waste of a company FCC Czech Republic, Ltd. Dissertation search for the most suitable method to solve the real-life example. So formed economic model is to be solved via Traveling Salesman Problem method, whose mathematical model, modifications and solutions options are described in detail in theoretical sections of the dissertation. Exact methods, which are suitable for smaller problem, and heuristic methods, which did not have to give optimal solution, can be used for solving the Traveling Salesman Problem. The Traveling Salesman Problem will be solved here with help of modeling software MPL for Windows. There will be also used two heuristic approaches - Nearest Neighbor algorithm and Savings method. Due to increasing efficiency, a modified Traveling Salesman Problem with Time Windows will be used and solved also through MPL for Windows. To close the dissertation, the result will be summarized and compare firstly among each other and secondly against current company route.
|
|
|
Route optimization for the parcels distribution
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Čížek, Ondřej (referee)
This thesis deals with optimization problems of the parcels distribution. This issue can be solved on the ground of traveling salesman problem whose mathematical and economic model, including their modifications, are presented in the theoretical part of the thesis. We can solve these problems by using exact methods, heuristic and metaheuristic algorithms. In the theoretical part are described traveling salesman problem, traveling salesman problem with time windows, traveling salesman problem with multiple time windows and dynamic traveling salesman problem including possible ways of solution. In the practical part we can find application of problems on the real example, when we are finding the shortest possible route for the PPL's employee under different assumptions. The solution is obtained by using solver Gurobi within the modelling system MPL for Windows. In conclusion of the thesis the results are summarized and models are compared with each other.
|
|
|
The spatial final cut optimisation
Kašpar, Jan ; Marušák, Róbert (advisor) ; Lstibůrek, Milan (referee)
For more than 150 years, timber indicators have been used for forest harvest scheduling in the region of current Czech Republic. With social changes and increased importance of forest yields and functions, there has been significant changes in forest management during this time. The changes in ownership structure after 1989 are most problematic from a sustainability standpoint. Also, the timber indicators cannot consider forest age structure, which is not ideal because even small changes related to abiotic and biotic disturbances may inhibit forest planning efforts. These changes to forest ownership and structure combined with current timber indicators make it difficult to ensure sustainable harvest levels over long time horizons. Methods of operations research, such as mathematical programming and heuristic methods, provide alternatives to historical harvest scheduling methods because they can account for forest age structure and spatial relationships over long scheduling horizons.
|
|
|
Evolutionary algorithms for global optimization problem solving
Dragon, Ondřej ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This work is devoded to evolutionary algorithms and solution of global optimization problems, mainly the traveling salesman problem. The traveling salesman problem is analyzed in detail as well as its methods of solution, such as: graph theory, heuristics and evolutionary algorithms. The main optimization method of this work is a Inver - over operator. In conclusion are implemented selected methods and performed testing and evaluation of the individual data sets.
|
|
|
Application for Generating of School Schedules
Fiala, Jan ; Horáček, Jan (referee) ; Rozman, Jaroslav (advisor)
This work deals with problem of generating school schedules. The solution is based on three heuristic algorithms (hill-climbing, simulated annealing, genetic algorithm) and is fully implemented in JAVA. It provides a comparison of implemented heuristic algorithms including description of their pros and cons.
|
|
|
OPTIMALIZATION OF LOGISTIC FLOWS IN THE ENTERPRISE
Dvořáček, Radim ; Linda, Bohdan (advisor)
The dissertation is concerned about, according to author still “live” problem of optimization of logistic flow, with scope to company environment. The aim is to find correct methodology for defined problem and to apply it to particular case study. Theoretical part begins with description and analysis of actual state of problematic of logistic flow optimization and listing the methods which are able to be applied to these problems. The three main groups – exact methods, heuristic methods and combined methods take part in. The analysis continues further with searching the methods, useful for application in production company environment. Vast focus is on layout design task, because once layout is created, except some minor changes, it lasts usually for some years and therefore it is necessary to consider it properly. Moreover, there is also difference between other characteristics of production, as production planning and machines / technologies upgrade and layout; the former are in a certain manner changeable and not stable, but the layout cannot be changed on for ex. weekly basis. Contribution to research is located at the end of theoretical part, which is newly modified methodology to be more suitable for practical application. Practical part begins with the description of particular case study, e.g. actual status of logistic system in enterprise. The processes described include purchasing management, production management and mainly layout design of production space. The application of suitable methods consists of group technology methods – already known method, plus newly modified method and their mutual comparison. In addition is included already known value stream mapping method. The result is recommendation for change in layout design, developed by integration of results, brought by group technology methods and value stream mapping method.
|
|
|
Genetic Algorithms and Scheduling
Škrabal, Ondřej ; Popela, Pavel (referee) ; Roupec, Jan (advisor)
This work deals with scheduling problem in particular plastic production service. The solution is based on heuristic algorithms, programming languages C + +, C # and is built on the .NET framework and LINQ to XML. It provides the users with comparisons of the heuristic approach with genetic algorithms applied to production problem. All methods results are compared in relation to hand-arranged plans.
|
|
|
Optimization of packages transport
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
This bachelor thesis deals mainly with traveling salesman problem which belongs to the distribution problems and looking for its the best solution. The principle of the solutions of this problem is finding the shortest possible route that includes all of the prescribed addresses and returns to the initial location. Every location must be visited exactly once. There are numbers of modifications such as traveling salesman problem with time windows, courier service problem, dynamic traveling salesman problem and many others. We can solve these problems by using the systems to support modelling or using heuristic or metaheuristic methods. The thesis is divided into two parts, theoretical and practical. In the theoretical part the distribution problems are described, the traveling salesman problem in detail and selected algorithms of heuristic methods. The practical part is focused on the application of these methods which helps us to find the shortest possible route, which the PPL's employee would be able to manage during one day when he distributes packages. The solution is obtained by using an optimization system MPL for Windows, by application the nearest neighbour algorithm, the savings algorithm and the insert algorithm. In conclusion of the thesis all results are summarized and a mutual comparison of the calculation methods is performed.
|
|
|
Optimization of medicaments distribution from Movianto s.r.o. Warehouse
Šimáně, Čestmír ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
Nowadays, when great emphasis is put on cost savings, transport optimization is necessary part of every company life in which transportation costs produce significant part. There are optimization methods and possibilities presented in this thesis. In the first chapter there are explained methods such as the travelling salesman problem, the vehicle routing problem, the multiple vehicle routing problem and the split delivery vehicle routing problem and then the reader gets to know the heuristics methods in the chapter two where description of the nearest neighbour method, Clarke-Wright method and split delivery heuristic is mentioned. In the last but one chapter author applies previous methods on concrete distribution arranged by Movianto Česká republika s.r.o. on 5th September, 2013. Based on gained outputs, analysis and comparison of results (including the original distribution) are provided in the fourth chapter. Obtained results of analysis lead to recommendation on how the company should plan its future distribution.
|
guest ::
