Pregled bibliografske jedinice broj: 274886
Comparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem
Comparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem // Proceedings of the 17th International Conference on Information and Intelligent Systems / Aurer, Boris (ur.).
Varaždin: Fakultet organizacije i informatike Sveučilišta u Zagrebu, 2006. str. 413-418 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 274886 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Comparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem
Autori
Martinjak, Ivica ; Golub, Marin
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 17th International Conference on Information and Intelligent Systems
/ Aurer, Boris - Varaždin : Fakultet organizacije i informatike Sveučilišta u Zagrebu, 2006, 413-418
Skup
17th International Conference on Information and Intelligent Systems
Mjesto i datum
Varaždin, Hrvatska, 20.09.2006. - 22.09.2006
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Heuristic Algorithms; Genetic Algorithm; Hill Climbing; Simulated Annealing; Tabu Search; Knapsack Problem
Sažetak
This paper addresses the comparison of heuristic algorithms in the case of real functions optimization and knapsack problem. Metaheuristics for algorithms hill climbing, simulated annealing, tabu search and genetic algorithm are shown, test results are presented and conclusions are drawn. Input parameters for optimization functions problem are optimised on a sample of functions. Also, algorithms' efficiencies are compared and their achievement for large dimension of problems is measured.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo