Download
PDF 136.34 KB
master's thesis
21   10
A comparison of Recent Metaheuristic Optimization Methods
Danijel Radman (2014)
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Computer Engineering and Automation
Chair of Automation and Robotics
Cite this document...

Radman, D. (2014). Uspredba suvremenih metaheruističkih metoda za optimizaciju (Master's thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:576811

Radman, Danijel. "Uspredba suvremenih metaheruističkih metoda za optimizaciju." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2014. https://urn.nsk.hr/urn:nbn:hr:200:576811

Radman, Danijel. "Uspredba suvremenih metaheruističkih metoda za optimizaciju." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2014. https://urn.nsk.hr/urn:nbn:hr:200:576811

Radman, D. (2014). 'Uspredba suvremenih metaheruističkih metoda za optimizaciju', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 16 February 2019, https://urn.nsk.hr/urn:nbn:hr:200:576811

Radman D. Uspredba suvremenih metaheruističkih metoda za optimizaciju [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2014 [cited 2019 February 16] Available at: https://urn.nsk.hr/urn:nbn:hr:200:576811

D. Radman, "Uspredba suvremenih metaheruističkih metoda za optimizaciju", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2014. Available at: https://urn.nsk.hr/urn:nbn:hr:200:576811

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)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Lower level organizational unitsDepartment of Computer Engineering and Automation
Chair of Automation and Robotics
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