|
| |
|
|
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.
|
|
|
Evolutionary computing
Popelka, Jan ; Smékal, Zdeněk (referee) ; Karásek, Jan (advisor)
The aim of this Bachelor's Thesis was to get acquainted with the Evolutionary Optimization Techniques, mainly with the Genetic Algorithm and Genetic Programming. It was subsequently described the role of optimization problem TSP solved using Genetic Algorithms and other Chapter solving Symbolic Regression using Genetic Programming. This optimalization problems were created in the programming JAVA and there are solved practical part of the thesis.
|
|
|
Discovery of Wireless Sensor Network Topology Using Genetic Algorithms
Dalecký, Štěpán ; Samek, Jan (referee) ; Zbořil, František (advisor)
The thesis deals with a design of the genetic algorithm that is able to discover the wireless sensor network topology using signal strength among particular sensors. At first, the thesis describes the theory of genetic algorithm and wireless sensor network. Subsequently, on the basis of this theory, the genetic algorithm serving for the wireless sensor network topology discovery has been designed. The thesis also describes important features of the algorithm implementation. In conclusion, the outcomes have been reviewed.
|
|
|
Hranice – redefinition of urban structure
Varmužová, Adéla ; Veselá, Markéta (referee) ; Foretník, Jan (advisor)
I think of a library in a small town as a social center rather than a closed institution. It should be seen as part of the public space of the city, an open place with a cultural - educational and social life. Apart from the possibility of concentrated individual study, it should also provide space for group work and social gathering of residents. Authors' readings, lectures and workshops are held in such a library. The library environment should be pleasant and suitable for a long stay with plenty of natural light and contact with the exterior. It includes a literary café, a buffet and an open-air reading room. The library in Hranice is designed as a terraced "house" with walking roofs. The building creates a link between the park and the street of 1. Máje. You can walk through the library from the street to park and vice versa, both through the interior of the library and outside on its roof.
|
|
|
Crossover in Cartesian Genetic Programming
Vácha, Petr ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
Optimization of digital circuits still attracts much attention not only of researchers but mainly chip producers. One of new the methods for the optimization of digital circuits is cartesian genetic programming. This Master's thesis describes a new crossover operator and its implementation for cartesian genetic programming. Experimental evaluation was performed in the task of three-bit multiplier and five-bit parity circuit design.
|
|
|
Travelling Salesman Problem
Kolář, Adam ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
The aim of this bachelor's thesis is to design a testing environment for the traveling salesman problem and compare the effectiveness of different approaches to the solution. The first part discussed the possibility of genetic algorithms, depending on the setting of a crossover, mutations and population size. In the second part, there is the same problem using two types of neural networks. The representative of the self-learning net was chosen Kohonen neural network. Hopfield neural network represents a method of minimizing the energy function with fixed coefficients. At both neural networks, there were described possible advantages and disadvantages. In the end, all the findings were interpreted in a global context.
|
|
|
Genetic programming - Java implementation
Tomaštík, Marek ; Kuba,, Martin (referee) ; Matoušek, Radomil (advisor)
This Master´s thesis implements computer program in Java, useful for automatic model generating, specially in symbolic regression problem. Thesis includes short description of genetic programming (GP) and own implementation with advanced GP operands (non-destructive operations, elitism, exptression reduction). Mathematical model is generating by symbolic regression, exacly for choosen data set. For functioning check are used test tasks. Optimal settings is found for choosen GP parameters.
|
|
|
Krásnopolská and Opavská streets intersection
Kocurek, Ondřej ; Kotas, Roman (referee) ; Všetečka, Martin (advisor)
This final thesis focuses on the intersection of Krásnopolská and Opavská Streets in Ostrava. The present intersection provides a main traffic connection between the city districts of Krásné Pole and Poruba. Opavská Street is part of the road I/11, a major traffic route between Opava and Ostrava. This final thesis focuses on the design options for a better connection of Krásnopolská Street with Opavská Street. The existing junction is technically unsatisfactory, mainly because the view for traffic is not ideal and previous adjustments to the corners of the intersection are inappropriate. All options are proposed in accordance with the applicable standards and regulations.
|
guest ::
