master's thesis
A comparison of Recent Metaheuristic Optimization Methods

Danijel Radman (2014)
Sveučilište Josipa Jurja Strossmayera u Osijeku
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Zavod za računalno inženjerstvo i automatiku
Katedra za automatiku i robotiku
Metadata
TitleUspredba suvremenih metaheruističkih metoda za optimizaciju
AuthorDanijel Radman
Mentor(s)Robert Cupec (thesis advisor)
Emmanuel Karlo Nyarko (thesis advisor)
Abstract
U ovom diplomskom radu objašnjen je rad pojedinih suvremenih metaheurističkih metoda za optimizaciju. To su: Backtracking search optimization algoritam (BSA), Cuckoo search algoritam (CUC), Differential search algoritam (DS), Firefly algoritam (FA) i Particle swarm optimisation (PSO). Svaki algoritam ima svoje prednosti i nedostatke. Iz tog razloga se proveo eksperiment na navedenim algoritmima, te ispitalo njihovo svojstvo lociranja globalnog minimuma. Prilikom ispitivanja pojedinih metoda korištene su sljedeće testne funckije: Ackleyeva funkcija, Rastrigin funkcija i Rosenbrock funkcija
KeywordsOptimization Objective function Global optimum Search space Evolutionary algorithms Swarm intelligence Recombination Crossover Mutation Selection Adaption Fitness Migrating behavior Initialization Iteration BSA CUC DS FA PSO
Parallel title (English)A comparison of Recent Metaheuristic Optimization Methods
Committee MembersRobert Cupec (committee chairperson)
Alfonzo Baumgartner (committee member)
Emmanuel Karlo Nyarko (committee member)
GranterSveučilište Josipa Jurja Strossmayera u Osijeku
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Lower level organizational unitsZavod za računalno inženjerstvo i automatiku
Katedra za automatiku i robotiku
PlaceOsijek
StateCroatia
Scientific field, discipline, subdisciplineTECHNICAL SCIENCES
Computing
Process Computing
Study programme typeuniversity
Study levelgraduate
Study programmeGraduate University Study Programme in Computer Engineering
Academic title abbreviationmag.ing.comp.
Genremaster's thesis
Language Croatian
Defense date2014-10-02
Parallel abstract (English)
This paper explains the work of some modern metaheuristic methods for optimization. These are: Backtracking search optimization algorithm (BSA), Cuckoo search algorithm (CUC), Differential search algorithm (DS), Firefly algorithm (FA) i Particle swarm optimisation (PSO). Each algorithm has its own advantages and disadvantages. For this reason a experiment was conducted on the mentioned algorithms and examined they ability of locating the global minimum. During the experiment, the following test functions were used: Ackley's function, Rastrigin's fucntion and Rosenbrock's fucntion
Parallel keywords (Croatian)Optimizacija Ciljna funckija Globalni optimum Prostor pretraživanja Evolucijski algoritmi Inteligencija roja Rekombinacija Križanje Mutacija Selekcija Adaptacija Fitness Migracijsko ponašanje Inicijalizacija Iteracija BSA CUC DS FA PSO
Resource typetext
Access conditionOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
URN:NBNhttps://urn.nsk.hr/urn:nbn:hr:200:576811
CommitterAnka Ovničević