|
|
Optimalization of labor force in a Family Hotel
Balšánková, Tereza ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
Primary objective of this bachelor thesis "Optimalization of laber force in a Family Hotel" is to solve the linear task of optimalization of the work force in the family hotel Balkan utilizing the Hungarian method and sub-sequently using the optimalization system LINGO. For optimalization is used the modification of assignment problem, which belongs to typical tasks of linear programing, so called distribution task. Theoretical part of this thesis describes not only linear programming itself, yet it is just focused to distrubution methods. In the practical part the task is treated by both of the above mentioned ways. The objective is to create the schedule of assignments of the given position to the concrete person at certain day. The secondary objective of the bachelor thesis is to compare the results of the solution of both methods and evaluate which variant is more suitable in this case.
|
|
|
Logical puzzles and brainteasers as optimization problems
Lukesová, Kristýna ; Chýna, Vladislav (advisor) ; Šindelářová, Irena (referee)
This thesis applies classical optimization problems such as assignment or set-covering problem on logical puzzles or brainteasers. Listed in the first part are mathematical model, description and typical example of each optimization problem used in this thesis. The second part contains these models applied to the particular brainteasers for example Sudoku or Einstein's Puzzle. Exercises are divided into simpler and more complex ones. There is specification, source and a described method of solution stated for each of them. The calculation examples use Lingo or MS Excel or both. The aim is to show the possibility to address logical puzzles and brainteasers with the use of optimization problems, and thus confirm the wide possibilities of using these models. These examples can clarify and diversify the curriculum.
|
|
| |
|
|
Graph theory – an alternative method of solving LP problems
Hrabovská, Michaela ; Šindelářová, Irena (advisor) ; Chýna, Vladislav (referee)
This bachelor thesis analyses an example of an alternative method of solving selected linear programming problems using graph theory. These alternative methods are explained not only theoretically, but also illustrated on the practical examples. For comparison, there is a theoretical description and also practical solution of selected problems with using linear programming stated in the text. In the introductory part of the thesis, the theory of operations research is briefly discussed. The selected problems are: knapsack problem, transportation problem, assignment problem.
|
|
|
Staff scheduling in health services
Uhlíř, Filip ; Dlouhý, Martin (advisor) ; Fábry, Jan (referee)
Purpose of this thesis is to show different solutions for the staff scheduling in health services. There will be shown various issues that this special assignment problem brings. The text will describe solutions using mathematical modeling and one solution using heuristics. Solutions of the mathematical models are divided into two parts. The first part describes two models that address the assignment problem for night duties only. The second part describes two more models that address the assignment problem for the whole day. The models are compared with each other. Among other things, there are also described several possibilities how different models could be combined. Model example is calculated for the staff allocation on night duties. The example uses some of the conditions from the two models that solve this assignment problem.
|
|
|
Using of AIMMS at solving of optimization models
Lacinová, Věra ; Jablonský, Josef (advisor) ; Zouhar, Jan (referee)
The bachelor's thesis is about AIMMS -- a system for mathematical modeling. The aim of the thesis is to create a simple user's guide for interested individuals that want to use this system on the basic level. Practical part is about making models of selected distribution problems. Thesis is organized into three main chapters. The first chapter is about linear programming and selected distribution problems of linear programming. There is outlined development of linear programming and its place in mathematical modeling. In this chapter, mathematical models of selected distribution problems as transportation problem, container-transportation problem, allocation problem, covering problem and assignment problem are formulated. The second chapter is about AIMMS and describes how to work with this system. It contains basic information about the system and its author J. Bisschop. The next part informs how to work with system AIMMS. There is a way of declaration of individual sections and procedures in Model Explorer discussed. The AIMMS Page Manager, a tool for creating end-user's pages, is described. By this tool the end-user can change data sets and obtain results of analyzed problems. The third chapter is practical part. It contains the description of selected distribution problems with the emphasis on their implementation in AIMMS. Appendix contains end-pages of selected distribution problems and the list of solvers supported by AIMMS.
|
|
|
The Optimization Methods with Utilization of the Simulation in MS Exel
Škulavíková, Štěpánka ; Kuncová, Martina (advisor) ; Fábry, Jan (referee)
Thesis is based on original self-made application programmed at VBA in MS Excel 2007. The reason to build this application was integration of simulation Monte Carlo and chosen optimization methods. The application allows do simulation of the knapsack problem and of the assignment problem with uncertainty. The parameters of these models are possible to set up as changing values in dependence of chosen probability distribution. Output of the simulation is a probability recommendation which objects should be used. Choose of objects depend on optimized models. Results of both models are represented by statistical indexes, tables of parameters and graph.
|
|
|
The Solving of Distribution Problems in MS Excel / LINGO
Bisová, Sára ; Jablonský, Josef (advisor) ; Skočdopolová, Veronika (referee)
The goal of this work is to explain the topic of distribution problems, special kind of linear programming problems, and also to show possibilities for solving them in some programming systems. For solving several types of distribution problems - transportation problem, container transportation problem, assignment problem, allocation problem and travelling salesman problem - I have created an application which connects MS Excel with programming language LINGO. This connection is realized by means of VBA - Visual Basic for Applications. There are described the main procedures and functions of LINGO and VBA including minute description of interconnection of these systems. Created application is illustrated on several small problems in the last part of work.
|
|
|
Assignment problem
Partynglová, Soňa ; Lagová, Milada (advisor) ; Kalčevová, Jana (referee)
This thesis is describing one of the most popular method (Hungarian method) for solving the assignment problem. This type of problem is usually just defined by most the writers instead of it's real treatement. The main target of this thesis was to resume the knowledge of this problem, to define it carefully and to use Hungarian method for finding the best solution. This thesis also shows the differences between solving this problem by minimalisation or maximalization of the function of effectiveness and this thesis also shows how to solve the unbalanced tasks.
|
|
|
Speciální algoritmy některých úloh operačního výzkumu
Klaschková, Alena ; Šindelářová, Irena (advisor) ; Zouhar, Jan (referee)
Práce sumarizuje a dává do souvislostí vybrané úlohy operačního výzkumu, pro něž byly vyvinuty speciální optimalizační algoritmy či heuristiky kromě obecných algoritmů řešících problémy lineárního programování nebo diskrétního programování, s důrazem na praktické možnosti řešení těchto problémů danými algoritmy. Zabývá se běžnými úlohami lineárního programování s omezenými proměnnými, úlohami teorie grafů (toky, cesta grafem, kostra grafu), úlohou batohu, dopravním problémem, přiřazovacím problémem a úlohou obchodního cestujícího a srovnává speciální algoritmy s obecnými.
|
guest ::
