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

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