|
|
Optimization of concrete structures using stochastic optimization methods
Slowik, Ondřej ; Pukl,, Radomír (referee) ; Novák, Drahomír (advisor)
The thesis focuses the reader on the sense of optimization and its importance for civil engineering. It outlines the principles used by some optimization methods and discusses the possibility of combination of any type of methods LHS with other optimization method. The result is a new type of optimization method named Nested LHS described in the text of the third chapter. The fifth chapter applies some of the lessons learned to solve practical optimization problem - reinforced concrete bridge solved by nonlinear finite element analysis using pseudostochastic optimization method LHS mean.
|
|
| |
|
|
Graphic Animation of Problem Solving Methods
Macek, Jiří ; Jurka, Pavel (referee) ; Zbořil, František (advisor)
There are many kinds of implementation artificial intelligence for automatic solving problems by computer technology. The main topics of this bachelor's thesis are some typical methods, describing of their features, comparing them among and shows some useful techniques of algoritmization and implementation too. Main purpose of this thesis is creating application, which clearly demonstrates at chosen problems methods of their solving.
|
|
| |
|
|
Shopping Advisor
Kocourek, Jakub ; Bartík, Vladimír (referee) ; Kolář, Dušan (advisor)
The attached bachelor thesis deals with nding the shortest ways in a shop for the selected purchase. The different technologies of creating web pages are described. As for the state space search algorithms are given for nding the shortest path between two points and for solving the travel salesmen problem. The thesis continues with the description of a design and implementation of application with all used technologies (PHP, Nette, MySQL, JS, JQuery) applying the Dijkstra's algorithm for nding the shortest path and genetic algorithm for solving the travel salesmen problem.
|
|
|
Optimization Methods for SIMLIB/C++
Godula, Martin ; Martinek, David (referee) ; Peringer, Petr (advisor)
Bachelor's thesis is concerned with methods for global optimization. It deals with concept of optimization theoretically, and describes its goals and chosen optimization methods, suggests process of their implementation with regard to compatibility with simulation library SIMLIB/C++. It describes their implementation in C++ language and demostrates their functionality on different test problems and evaluates their rate of success.
|
|
| |
|
|
Traveling Salesman Problem: Parallel Methods Using SMP (Threads)
Weigner, Martin ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
This thesis is focused on solving the problem of traveling salesman. At first, the problem is solved by serial access at four algorithms. There are two of them chosen and transferred to parallel access. In the end there are summarized observations about different parameters of both access. This thesis also introduces questions of programming parallel applications with threads to the reader.
|
|
|
Prediction of Multiple Time Series at Stock Market Trading
Palček, Peter ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
The diploma thesis comprises of a general approach used to predict the time series, their categorization, basic characteristics and basic statistical methods for their prediction. Neural networks are also mentioned and their categorization with regards to the suitability for prediction of time series. A program for the prediction of the progress of multiple time series in stock market is designed and implemented, and it's based on a model of flexible neuron tree, whose structure is optimized using immune programming and parameters using a modified version of simulated annealing or particle swarm optimization. Firstly, the program is tested on its ability to predict simple time series and then on its ability to predict multiple time series.
|
|
|
Analysis of Various Approaches to Solving Optimization Tasks
Knoflíček, Jakub ; Samek, Jan (referee) ; Zbořil, František (advisor)
This paper deals with various approaches to solving optimization tasks. In prolog some examples from real life that show the application of optimization methods are given. Then term optimization task is defined and introducing of term fitness function which is common to all optimization methods follows. After that approaches by particle swarm optimization, ant colony optimization, simulated annealing, genetic algorithms and reinforcement learning are theoretically discussed. For testing we are using two discrete (multiple knapsack problem and set cover problem) and two continuous tasks (searching for global minimum of Ackley's and Rastrigin's function) which are presented in next chapter. Description of implementation details follows. For example description of solution representation or how current solutions are changed. Finally, results of measurements are presented. They show optimal settings for parameters of given optimization methods considering test tasks. In the end are given test tasks, which will be used for finding optimal settings of given approaches.
|
guest ::
