|
|
Vehicle Routing Problem
Kafka, Ondřej ; Branda, Martin (advisor) ; Hanzák, Tomáš (referee)
The thesis deals with optimization problems which arise at distribution planning. These problems can often be easily formulated as integer programming problems, but rarely can be solved using mixed integer programming techniques. Therefore, it is necessary to study the efficiency of heuristic algorithms. The main focus of the thesis is on the vehicle routing problem with time windows. A tabu search algorithm for this problem was developed and implemented. It uses integer programming to solve the set partitioning problem in order to find optimal distribution of all customers into feasible routes found during the search. The results of the classical integer programming approach, basic insertion heuristic and presented tabu search algorithm are compared in a numerical study.
|
|
|
Integer Optimization for Transportation Problems
Cabalka, Matouš ; Žák, Libor (referee) ; Popela, Pavel (advisor)
The thesis deals with optimization models in transportation problems with emphasis on traveling salesman problem. Brief introduction to the history is followed by theoretical part describing linear programming, integer programming and formulation of traveling salesman problem. Description of data preprocessing is included. Finally computational results are discussed and evaluated.
|
|
|
Transformations of optimization models with aplications
Rychtář, Adam ; Bednář, Josef (referee) ; Popela, Pavel (advisor)
The thesis deals with recent problems of waste management in the Czech Republic. In connection with the existing software implementation, the author focuses on the gradual development of advanced mathematical programming models, which generalize existing approaches. The author applies acquired knowledge in the areas of network flows, linear, integer, and stochastic programming. The important role is played by modifications and transformations of the discussed models. They are further used to obtain the experimental results for real-world input data by implementation in GAMS.
|
|
|
Models and methods for routing problems
Nevrlý, Vlastimír ; Žák, Libor (referee) ; Popela, Pavel (advisor)
This master's thesis deals with mathematical model building for routing problems and ways to solve them. There are discussed and implemented deterministic and heuristic approaches that are suitable to be utilized. A big effort is put into building of the mathematical model describing a real world problem from the field of waste management. Appropriate algorithms are developed and modified to solve a particular problem effectively. An original graphical environment is created to illustrate acquired results and perform testing computations.
|
|
|
Planning cash delivery to exchange offices using Vehicle Routing Problem with Time Series
Mouchová, Denisa ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
The purpose of this bachelor thesis is to apply vehicle routing problem with time series to a real case study. At first vehicle routing problem is classified into Operations Research and Travelling Salesman Problem. Then a simple vehicle routing problem and a multiple vehicle routing problem are described as well as their modifications with time series. Some heuristic algorithms and steps of nearest neighbour algorithm are described. The next part is focused on the application. It starts with introducing the company that is specialized in an exchange business and description of the situation that presents its assignments. There are three assignments in total. The first and second assignments are related to the optimization of cash delivery to company's branches. The second one also allows the company send a parcel with cash instead of its own delivery. The third assignment is to calculate whether a conversion cars into propellant gas is budget-wise or not. These assignments are solved and the results are commented.
|
|
|
Optimization of logistics and business processes in Bookretail s.r.o.
Hollayová, Nela ; Zouhar, Jan (advisor) ; Kuncová, Martina (referee)
The subject of the thesis is the optimization of one the key processes in a book company, namely warehouse logistics. This problem consist of two parts; first part focuses on route optimization of completion of customers' orders on daily basis, second part focuses on assigning of storage subsystems and their interconnection. The proposed solution uses a traveller salesman problem implemented into intranet application. Second problem was designed as quadratic assignment problem with use of ex post data analysis. On the basis of achieved results, we presented effective procedures for solving both of aforementioned problems and suggested their implementation into the company's enterprise resource planning system. Keywords:
|
|
|
Optimal solution for employees dislocation at MFCR
Dubový, Vojtěch ; Jablonský, Josef (advisor) ; Pelikán, Jan (referee)
Almost every medium and large company has to deal with an optimal placing of administrative workers. This thesis focuses on solving a problem of dislocation of employees of the Ministry of Finance of the Czech Republic (MFCR) and it proposes a possible solution of the current situation. The basis for finding the optimal solutions are integer programming tasks. The structure of the MFCR and the description of the current/future state of dislocations has been defined in cooperation with the MFCR. Therefore, the solution fully meets the MFCR specifications. The thesis also outlines another optional solution for dislocations within MFCR. Finally, there are summarized other aspects of optimal dislocation of employees that can further improve the solution given in this thesis, especially in terms of efficiency, satisfaction and health of the employees.
|
|
|
Crew Scheduling Problem: Application in Fast Food Chains
Havlová, Irena ; Zouhar, Jan (advisor) ; Kořenář, Václav (referee)
Crew scheduling is very important, especially in continuous operating environments running 24 hours a day, 7 days a week, more so if the demand for staff is varying over each hour of the day. This thesis focuses on staff optimization in a fast food chain where special conditions for scheduling like flexible starting-times and shift lengths or heterogeneous crew are present. Two new models based on a mixed integer programming approach were designed, dealing with data from a particular restaurant with the aim of improving schedules and saving time spent on the creation of those schedules. At the end of the thesis the empiric schedules and results obtained are compared and the computational efficiency of both models is discussed.
|
|
|
Generalized assignment problem
Kocourková, Markéta ; Sekničková, Jana (advisor) ; Nečas, Dalibor (referee)
The generalized assignment problem is a topic of this thesis. The knapsack problem in general belongs to among classical operation research problems and belongs to the category of integer linear programming. It is very often formulated as a binary problem or 0-1. There are several types of knapsack problems which are described in this thesis. Some of the knapsack problems are so large and although exist exact algorithms for finding optimal solution, heuristics are rather used. They are not so exact but they find solution much earlier. Therefore some of the knapsack problems belong to NP-hard problems. This thesis is focused on one type particularly, the generalized assignment problem, which is demonstrated on practical example how the problem can be used.
|
|
|
Method of generation transport routes
Bartásková, Petra ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
This thesis is focused on optimizing the routes which are implemented in our country at night. Goods are transporting between designated central cities. It deals with creating cyclic routs, along which the goods should be effectively transported, with the respect of the cost. The instruction how to create these paths represents a heuristic method for generating cyclic paths. The algorithm uses the results provided by model that is based on a search for multiple product chart. The chart contains the minimum number of vehicles that provide transport and individual amount of transported goods. The principle of this heuristic method is to create cyclic paths in such a way to be able to serve all transportation requirements with the lowest number of reloads. This approach leads to the fact that the direct paths are preferred.
|
guest ::
