|
|
Continuous mathematical models of population dynamics
Pecka, Luboš ; Opluštil, Zdeněk (referee) ; Franců, Jan (advisor)
The aim of this thesis is to describe the most frequent models describing population dynamics and then to perform some numerical experiments in the MATLAB environment. These simulations should validate our theoretical results. The models are sorted from the basic models to the most complicated and are divided into the models which describe dynamics of one population and models of coexistence of two biological species. The master's thesis icludes also a program for drawing graphs and trajectories of solutions of models described in this thesis including a description of this MATLAB program.
|
|
| |
|
|
Genetic Algorithm Design for Distribution Network Outfits Optimalization
Ondruš, Tomáš ; Skala, Petr (referee) ; Paar, Martin (advisor)
The work deals with genetic algorithms and their potential use in application software to optimize high voltage switching elements of distribution network. Theoretical part explains the basic concepts of genetic algorithms such as a gene, population and chromosome and basic principles of the development of genetic algorithms.. The main task of the thesis is to design the algorithm that will simulate the distribution of the sectionalizers by telecontrolled section switches or reclosers and analyze how to set the the parameters affecting the convergence speed of genetic algorithm. The basic parameters affecting the convergence of breeding, mutation probability, population size or using of elitism. The second goal is finding a suitable set of input parameters for the selected population sizes without and with using elitism. The results of the work determine the most appropriate settings for each generation and determining the approximate number of generations needed to find the best solution. The genetic algorithm applocation was tested on a less extensive distribution network with six switching elements
|
|
|
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.
|
|
| |
|
|
Optimization of Processes in Logistics with Visualization Support
Kršák, Martin ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor)
The master thesis aims to design, implement, and compare algorithms that optimize processes in logistics, mainly in the planning phase. Heuristics and approximation genetic algorithms will find an near-optimal solution to NP-hard problem, such as the traveling salesman problem, with a delay less than several hours. The role of this algorithm is to plan an efficient route for garbage trucks that collect and distribute large-scale waste to waste yards in a specific city. The goal of the optimization is to minimize the shipping costs.
|
|
|
Population models in biology
Vadkerti, Kristián ; Archalous, Tomáš (referee) ; Jiřík, Radovan (advisor)
In this work I focused on a program creation to demonstrate population models in biology, concretely in Matlab program environment. The aim of by myself created graphic interface is modeling from directly given parameters or parameters gained by appropriately chosen optimalisation methods for concreate population model type from loaded real data, whereas I efforted to create such a model, that fits the most approximately with real datas.
|
|
|
Road-accident investigation and evaluation critical places on urban area Brna
Holoubek, Vladimír ; Mika, Otakar Jiří (referee) ; Mašek, Ivan (advisor)
At first, the work focuses on the statical description of the condition of the highway and railway system in Brno and the South Moravian region. Above all, it focuses on the statistics of the accident frequency, the intensity of transportation and the trucking traffic flows. In its analytical parts, it computes, from the available statical datas and the condition of highways, frequent sections of the accident frequency, dangerous places and the most used routes of the freights of dangerous chemical substances and detergents. The work evaluates the jeopardy for the inhabitants and the environment.
|
|
| |
|
|
Genetic Algorithms - Multi-core CPU Implementation
Studnička, Vladimír ; Kuba, Martin (referee) ; Matoušek, Radomil (advisor)
his diploma thesis deals with creating the most universal library of genetic algorithms in C++, as much as possible, implemented with the certain number of universal operators, and then with testing created library on some examples. Library must support multi-core processors, implementation will be done over OpenMP. The library will be tested on three examples in all. The first two examples are mathematical functions, that are used just for genetic algorithms testing. Last problem for test is N-Queens problem. Finally we will use genetic algorithms to try find solution for Eternity II puzzle, there is declared a 2 million bounty for full solution.
|
guest ::
