prikaz prve stranice dokumenta Uspredba suvremenih metaheruističkih metoda za optimizaciju
  Download
PDF 136.34 KB
master's thesis
Uspredba suvremenih metaheruističkih metoda za optimizaciju
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2014. urn:nbn:hr:200:576811
Radman, Danijel
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

Institutional repository: Faculty of Electrical Engineering, Computer Science and Information Technology Osijek

Cite this document

Radman, D. (2014). 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. 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 27 November 2024, 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 2024 November 27] 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
Title (english)A comparison of Recent Metaheuristic Optimization Methods
AuthorDanijel Radman
MentorRobert Cupec (mentor)
MentorEmmanuel Karlo Nyarko (mentor)
Committee memberRobert Cupec (predsjednik povjerenstva)
Committee memberAlfonzo Baumgartner (član povjerenstva)
Committee memberEmmanuel Karlo Nyarko (član povjerenstva)
GranterJosip 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)
Osijek
Defense date and country2014-10-02, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
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
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
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:576811
Study programmeTitle: Graduate University Study Programme in Computer Engineering
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2016-07-06 10:15:53