Thesis Details
Přehled současných přístupů k optimalizacím
This work aimed to study some of the optimization algorithms inspired by nature and to test their success in finding the extreme of a function on various functions. Four algorithms were selected, namely the bat algorithm, the firefly algorithm, the flower pollination algorithm, and the black hole algorithm. The Griewank function, the Rastringin function, and the Rosenbrock function were chosen as test functions for finding the extreme of the function. The work contains a description of individual algorithms, a description of test functions and a description of the experiments, and an evaluation of the success of the algorithms.
optimization algorithms, bat algorithm, firefly algorithm, flower pollination algorithm, blackhole algorithm, searching for extreme of a function, Griewank function, Rastringin function,Rosenbrock function, python
Grégr Matěj, Ing., Ph.D. (DIFS FIT BUT), člen
Hradiš Michal, Ing., Ph.D. (DCGM FIT BUT), člen
Kekely Lukáš, Ing., Ph.D. (DCSY FIT BUT), člen
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT), člen
@bachelorsthesis{FITBT19983,
author = "Patr\'{i}cia Hudecov\'{a}",
type = "Bachelor's thesis",
title = "P\v{r}ehled sou\v{c}asn\'{y}ch p\v{r}\'{i}stup\r{u} k optimalizac\'{i}m",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2020,
location = "Brno, CZ",
language = "slovak",
url = "https://www.fit.vut.cz/study/thesis/19983/"
}