|
Processes in IT company and their potential improvement
Česák, Petr ; Chlapek, Dušan (advisor) ; Pecha, Tomáš (referee)
This diploma thesis deals with the issue of Business Process Management in specific IT Company. The first part describes basic terms of Business Process Management with focus on processes optimization throw their potential improvement. Next part outlines processes closer including their maturity and level of description. Identification of potential improvements selected processes is performed in practical part. In this chapter are also designed phases of identified potential improvements. In final part are evaluated executed changes.
|
|
Study of diaphragm pump with linear motor
Čejka, Pavel ; Uttendorfský, Petr (referee) ; Pochylý, František (advisor)
The diploma thesis is aimed at the constructional design of diaphragm pumps with a linear motor. This pump is supposed to be used in medicine for pumping the blood or as an artificial heart. The basic facts, which are focused on the function of the heart and artificial heart, are mentioned in the first parts of the thesis. The next parts describe the diaphragm pumps and the constructional ways of their diaphragm fixation. Furthermore, the basic calculations, describing the function of the pump, are derived there. The basic parameters of the pump are also calculated. The thesis also contains the description of the body pump construction, whose working room is optimized by CFD calculation before the pump is manufactured. The final part of the thesis is concentrated on the measurement evaluation of produced pump model.
|
|
Grocery shopping online focused on Tesco
Nousková, Michaela ; Sedláček, Jiří (advisor) ; Hrinko, Michal (referee)
This thesis deals with shopping and sale of grocery online focusing on Tesco Stores CR,a.s. The aim of the study is to evaluate the Tesco e-shop from user's perspective, compare it with the competition and to propose steps towards optimization. The first part of thesis describes general information about the Internet and e-commerce, online grocery market and its specifics. Following part includes analyzeds of grocery e-shops based on multi-criteria evaluation and comparison with the Tesco service. This thesis should help the company Tesco optimize their web and activities.
|
|
Program system for solving dynamic programming problems
Zetka, Petr ; Popovský, Vítězslav (referee) ; Dvořák, Jiří (advisor)
This work deals with building a program system for solving dynamic programming problems on a computer. The theoretical part describes dynamic programming as a tool used for optimizing multistage decision processes and dynamic programming problems implemented in the program system. The practical part describes the design and implementation of the program system and verification of its functionality.
|
|
Modernizing of Testing Cell for Combustion Engines
Vévoda, Antonín ; Ramík, Pavel (referee) ; Svída, David (advisor)
The content of this thesis is the proposal of modernization of brake site in engine testing cell of Institute of Automotive Engineering. The main part focuses on the design of individual components for attaching the motorcycle engine Husaberg FE 570. Finally, work is the preparation of the measuring head to determine and optimize the performance parameters of the test engine.
|
|
Competing on Analytics
Nagin, Gleb ; Pour, Jan (advisor) ; Basl, Josef (referee)
Business analytics refers to the skills, technologies, applications and practisies for continuous iterative exploration and investigation of past business performance to gain insight and drive business planning. Business analytics focuses on developing new insights and understanding of business performance based on data and statistical methods. Business intelligence traditionally focuses on using a consistent set of metrics to both measure past performance and guide business planning, which is also based on data and statistical methods. Analytics makes extensive use of data, statistical or quantitative analyses, explanatory and predictive modeling, and fact based management to drive decision, making. Analytics may be used as input for human decisions or may drive fully automated decisions. In other words, querying, reporting, OLAP, and alert tools can answer questions such as what happened, how many, how often, where the problem is, and what actions are needed. Business analytics can answer questions like why is this happening, what if these trends continue, what will happen next, what is the best that can happen (optimize). Example of application analytics in different areas: banks use data analyses to differentiate among customers based on credit risk, usage of other characteristics with appropriate product offering. Harrah's company (from 2010 renamed and called Caesers entertaiment. Gaming corporation that owns and operate over 50 casinos, hotels, and seven golf courses under several brands), uses analytics for customer loyalty programs. Deere & Company (manufacturer of agricultural machinery like tractors, combine harvesters, sprayers and other) saved more than $1 billion by employing and implementing a new analytical tool to better optimize inventory. We can mention areas where within analytics are basic domain model: sales/retail business, financial services, risk & credit, marketing, fraud, pricing, telecommunications, supply chain, transportation and many others.
|
|
Evolutionary algorithms
Haupt, Daniel ; Polách, Petr (referee) ; Honzík, Petr (advisor)
The first part of this work deals with the optimization and evolutionary algorithms which are used as a tool to solve complex optimization problems. The discussed algorithms are Differential Evolution, Genetic Algorithm, Simulated Annealing and deterministic non-evolutionary algorithm Taboo Search.. Consequently the discussion is held on the issue of testing the optimization algorithms through the use of the test function gallery and comparison solution all algorithms on Travelling salesman problem. In the second part of this work all above mentioned optimization algorithms are tested on 11 test functions and on three models of placement cities in Travelling salesman problem. Firstly, the experiments are carried out with unlimited number of accesses to the fitness function and secondly with limited number of accesses to the fitness function. All the data are processed statistically and graphically.
|
|
Mobile robot path planning by means of ant algorithms
Sedlák, Václav ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with robot path planning by means of ant colony optimization algorithms. The theoretical part of this thesis introduces basics of path planning problematics. The theoretical part either deals with ant algorithms as optimization and path planning tools. The practical part deals with design and implementation of path planning by means of ant algorithms in Java language.
|
|
Assembly workplace optimizationwith emphasis on ergonomy and loss minimization
Sobotka, Lubomír ; Štangler, Jiří (referee) ; Simeonov, Simeon (advisor)
This diploma thesis describes optimization of assembly working place of cylinder locks brand FAB company ASSA ABLOY Rychnov, s.r.o. Theoretical part deals with universal process for designing manufacturing systems and for description of selected analytical and engineered methods and ergonomics .The practical part shows evaluation of current situation and create new time standards. in accordance with are designed 3 variants of the solution for lay out working place. For each variant is created simulation model, which is explore especially working load and automatic filling machine. The various options are compared by weight valuation and the most optimal is determined by maximal work in process and optimal warehouse supply of input components.
|
|
Constraint Programming as Means for Solving Discrete Problems
Janečková, Jitka ; Fábry, Jan (advisor) ; Černý, Michal (referee)
Application of constraint programming (CP) is one of the possible ways of solving discrete problems. It can be used for both search for feasible solution and optimization. CP offers a whole range of approaches for either a solution search or for acceleration of the process of its search -- from search algorithms or consistency techniques to propagation algorithms, which are basically only a combination of the two preceding methods. For optimization we most often use branch and bound approach, which differs in some aspects from a method of the same name used in mathematical programming (MP). Comparison of CP and MP is interesting in many other aspects. With CP the formulation of problems is more flexible, which allows for creation of often simpler and smaller models. On the other hand, its disadvantage is a limited use: Constraint satisfaction (optimisation) problem, as we call the constraint programming problem, cannot contain any discrete variables. CP is suitable especially for problems with a lot of constraints and only few variables, ideally only two. In the beginning, the paper introduces the basic terms of constraint programming, then it describes algorithms and techniques used for solving discrete problems and compares CP with mathematical programming.
|
guest ::
