engleski

Comparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem

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.

Heuristic Algorithms; Genetic Algorithm; Hill Climbing; Simulated Annealing; Tabu Search; Knapsack Problem

nije evidentirano