|
|
An assignment of employees to clients in a small bussiness
Lebr, Karel ; Skočdopolová, Veronika (advisor) ; Fiřtová, Lenka (referee)
Employee assignment to clients in the service sector is often a problem with simple intuitive solution but with the growing number of employees and clients, the complexity of the problem is increasing. For these purposes it is possible to use methods of operational research, more specifically linear or non-linear programming. In the context of assigning something to something else, we can talk more specifically about the assignment problem. This thesis deals with the question of how to assign employees to clients according to their time preferences, taking into account the policy of the company surveyed. For this purpose, a model has been created and implemented in the form of a general assignment problem with upper and lower limits on the number of clients assigned to one teacher. The task also uses the minimax principle. From the studied models, that closest to the reality was chosen and was implemented on a real problem.
|
|
|
Detection of the Cars Approaching the Crossroad
Vácha, Lukáš ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
Traffic monitoring using computer vision is becoming the desired system in practice. It allows nondestructive installation and also is very useful in many applications. This thesis focuses on automatic detection of vehicles approaching to a crossroads. This work also includes description of selected methods for detecting moving vehicles and the way of tracking them. On the basis of these methods is designed application that is implemented and tested in different lighting and weather conditions and various direction of approaching vehicles.
|
|
|
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.
|
|
|
Component Interconnection Inference
Olšarová, Nela ; Rychlý, Marek (referee) ; Křivka, Zbyněk (advisor)
The Master Thesis deals with the design of hardware component interconnection inference algorithm that is supposed to be used in the FPGA schema editor that was integrated into educational integrated development environment VLAM IDE. The aim of the algorithm is to support user by finding an optimal interconnection of two given components. The editor and the development environment are implemented as an Eclipse plugin using GMF framework. A brief description of this technologies and the embedded systems design are followed by the design of the inference algorithm. This problem is a topic of combinatorial optimization, related to the bipartite matching and assignment problem. After this, the implementation of the algorithm is described, followed by tests and a summary of achieved results.
|
|
|
Utilization of The Hungarian method for solution of Assignment problem
Petrovičová, Andrea ; Fábry, Jan (advisor) ; Borovička, Adam (referee)
The objective of this thesis is to present the basic of Assignment problem and also of the utilization of The Hungarian method. The theoretical part describes economic and mathematical model of problem. The paper describes in detail combinatorial optimization algorithm, The Hungarian method, which is considered one of the most efficient algorithm of solving process of Assignment problem. In the practical part, the algorithm is applied to create a new algorithm in VBA for MS Office Excel, which could be considered to be alternative optimization modeling software. Solution of tasks of great dimension and application of The Hungarian method to Transportation problem contribute to complex image of difficulty of the method.
|
|
|
Training plan solved by assignment problem
Vejvodová, Tereza ; Borovička, Adam (advisor) ; Fábry, Jan (referee)
The aim of the bachelor thesis is to create the best training plan for the dancers on a weekly training camp. This is the assignment of categories to certain hours of training for every day on training camp. Each category has different requirements in terms of days of training and of course hours of individual trainings. This problem solves an assignment problem and for calculation is used optimization program LINGO. The most effective plan for dancers will be found with this program. This plan should be fair and should satisfy all categories. In the theoretical part is described linear programming, primarily assignment problem and integer programming. In the practical part is the theory applied in practice and it is created schedule of categories for each day of training camp.
|
|
|
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:
|
|
|
Use of simulation model for the estimates of auction house’s revenues
Ondráčková, Kristýna ; Kuncová, Martina (advisor) ; Borovička, Adam (referee)
The auction is a form of trading, which is becoming more popular in recent years. For English auction the typical object intended for trading is art or antique etc. Auction houses require the most accurate estimates of total sales for each auction because of their economic activity. These estimates are constructed, but the only information that is available is starting price of auctioned objects (paintings). Two methods have been proposed for purpose of this estimation. They are conducted in the application Crystal Ball. Selling prices of the objects are generated in the first method and total sales are estimated with the help of application assignment problem. The second method consists in the simple sum of generated selling prices. The cornerstone of these methods is the distribution from which a coefficient is generated that sets increase of the starting prices to selling prices. The first part of practical application is dedicated to estimating parameters of this distribution. In the second part, total revenues are estimated using both methods. In conclusion there is the assessment of the suitability for both methods and estimated distributions. Method that provides the most accurate estimate of total sales for auction house is determined there also.
|
|
|
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.
|
guest ::
