|
|
Job Scheduling in Logistic Warehouses
Povoda, Lukáš ; Uher, Václav (referee) ; Karásek, Jan (advisor)
The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Managing and scheduling works is currently often problem. There is no simple solution due to complexity of this problem. This problem must be resolved because of a lack efficiency of work with a higher load such as during the christmas holidays. This paper describes the methods used to solve this problem focusing mainly on the use of search algorithms, evolutionary algorithms, specifically grammar guided genetic programming. This paper describes the problem of job shop scheduling on a simple theoretical example. The implemented algorithm for solving this problem was subjected to tests inspired on data from real warehouse, as well as synthetically created tests with more jobs and a greater number of workers. Synthetic tests were generated randomly. All tests were therefore run several times and the results were averaged. In conclusion of this work are presented the results of the algorithm and the optimum parameter settings for different sizes of problems and requirements for the solution. Genetic algorithm has been extended to calculate fitness of individuals with regard to number of collisions, extended to use priority rules during run of evolution, and some parts of algorithm was parallelized.
|
|
| |
|
|
Simulation model of waste collection for Network Simulator 3
Kolaja, Lukáš ; Mlýnek, Petr (referee) ; Fujdiak, Radek (advisor)
The goal of this diploma thesis is create an application for route optimalization for waste collection which is one of the technologies of smart cities. At first was described issue of smart cities focused to waste collection. The thesis describes the real deployment of smart waste collection using sensor network and was also designed its own model of smart waste collection. It is also described graph theory and related genetic algorithms which is suitable for waste collection optimalization. On that basics an application was made in C/C++ language which using a genetic algorithm to compute best possible path in graph which represents a map where waste is collected. By input data to application is vector image of evaluated graph in SVG data format.
|
|
|
Evolutionary algorithms
Bortel, Martin ; Karásek, Jan (referee) ; Burget, Radim (advisor)
Thesis describes main attributes and principles of Evolutionary and Genetic algorithms. Crossover, mutation and selection are described as well as termination options. There are examples of practical use of evolutionary and genetic algorithms. Optimization of distribution routes using PHP&MySQL and Google Maps API technologies.
|
|
|
PIFA Antenna design for GSM band
Kollár, Marcel ; Čapek, Miloslav (referee) ; Kadlec, Petr (advisor)
The main topic of this diploma thesis is a design of the PIFA antenna working in GSM bands. In the beginning there is a brief analysis of planar antennas. The thesis describes PIFA antenna and the techniques for minimization of dimensions of the antenna. Essential part of the thesis is dedicated to multicriterial optimalizaton of the antenna shape. The genetic algorithm programmed in the MATLAB enviroment cooperates with a full-wave solver CST to obrain desired impedance matching of the antenna its radiationt paterns. Also dimensions of the antenna can be minimized using the optimization procedure. Final part of the thesis compares measured data of the optimalized antenna with results obtained in CST Microwave Studio.
|
|
|
Eye gaze tracking
Bastl, Petr ; Číp, Pavel (referee) ; Richter, Miloslav (advisor)
This thesis deals with the eye gaze tracking and determining the direction and the place of the view. The overview of methods for determining the view direction is provided here. The direct 3D gaze estimation technique is proposed and implemented. The eye gaze can be estimated by using a single camera and under nature head movement. This paper describes the algorithms for the image processing and the image description. The center of the pupil is determined by the genetic algorithm for the ellipse detection. The procedures of the instrumentation calibration are proposed here as well. The work also addresses the issue of the determining the eye location. Finally, the comparison of the accuracy with similar projects is mentioned in my thesis.
|
|
|
Recognition of emotions in Czech texts
Červenec, Radek ; Smékal, Zdeněk (referee) ; Burget, Radim (advisor)
With advances in information and communication technologies over the past few years, the amount of information stored in the form of electronic text documents has been rapidly growing. Since the human abilities to effectively process and analyze large amounts of information are limited, there is an increasing demand for tools enabling to automatically analyze these documents and benefit from their emotional content. These kinds of systems have extensive applications. The purpose of this work is to design and implement a system for identifying expression of emotions in Czech texts. The proposed system is based mainly on machine learning methods and therefore design and creation of a training set is described as well. The training set is eventually utilized to create a model of classifier using the SVM. For the purpose of improving classification results, additional components were integrated into the system, such as lexical database, lemmatizer or derived keyword dictionary. The thesis also presents results of text documents classification into defined emotion classes and evaluates various approaches to categorization.
|
|
| |
|
|
Genetic Algorithms
Miček, David ; Pohl, Jan (referee) ; Honzík, Petr (advisor)
This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.
|
|
|
Automotive antenna for mobile communications
Porč, Jan ; Láčík, Jaroslav (referee) ; Pokorný, Michal (advisor)
This thesis deals with design of flush–mounted planar disc antenna suitable for use in vehicles. For each of the bands GSM900 and GSM1800, which are used in Czech republic, an independent antenna has been created. As a simulator of the electromagnetic field the program IE3D has been used. For the improvement of theoretical results an optimisation in the program MATLAB has been developed. As the optimisation method the genetic algorithms have been selected.
|
guest ::
