Thesis Details
Variace evolučního SOMA algoritmu pro dynamické úlohy
This study is focused on SOMA evolution algorithm and testing its versions aimed to solve dynamic problems. At the beginning it briefly explains principes of evolution algorithms and then it looks closer on SOMA algorithm. It describes its contemporary troubles for static and dynamic problems. There are also mentioned ways for their correction. It also describes the mostly used strategies -- All To One, All To Random, All To All and All To All Adaptive and shows their advantages and disadvantages. Furthermore another searching strategy is proposed focused on dynamic functions that are changing independently on program. The separate chapter is about project part of the study. There is described implementation and merging of used programs. This part is available on included CD along with results of testing strategies. Tables with average values are also part of the thesis.
SOMA, evolution algorithms
Drahanský Martin, prof. Ing., Dipl.-Ing., Ph.D. (DITS FIT BUT), člen
Kreslíková Jitka, doc. RNDr., CSc. (DIFS FIT BUT), člen
Pelikán Jaroslav, RNDr., Ph.D. (FI MUNI), člen
Zbořil František, doc. Ing., Ph.D. (DITS FIT BUT), člen
Zemčík Pavel, prof. Dr. Ing. (DCGM FIT BUT), člen
@bachelorsthesis{FITBT5860, author = "Jan Pokorn\'{y}", type = "Bachelor's thesis", title = "Variace evolu\v{c}n\'{i}ho SOMA algoritmu pro dynamick\'{e} \'{u}lohy", school = "Brno University of Technology, Faculty of Information Technology", year = 2007, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/5860/" }