A Comparison of Several Heuristic Algorithms for Solving High Dimensional Optimization Problems (CROSBI ID 217860)
Prilog u časopisu | prethodno priopćenje | međunarodna recenzija
Podaci o odgovornosti
Nyarko, Emmanuel Karlo ; Cupec, Robert ; Filko, Damir
engleski
A Comparison of Several Heuristic Algorithms for Solving High Dimensional Optimization Problems
The number of heuristic optimization algorithms has exploded over the last decade with new methods being proposed constantly. A recent overview of existing heuristic methods has listed over 130 algorithms. The majority of these optimization algorithms have been designed and applied to solve real-parameter function optimization problems, each claiming to be superior to other methods in terms of performance. However, most of these algorithms have been tested on relatively low dimensional problems, i.e., problems involving less than 30 parameters. With the recent emergence of Big Data, the existing optimization methods need to be tested to find those (un)suitable to handle highly dimensional problems. This paper represents an initial step in such direction. Three traditional heuristic algorithms are systematically analyzed and tested in detail for problems involving up to 100 parameters. Genetic algorithms (GA), particle swarm optimization (PSO) and differential evolution (DE) are compared in terms of accuracy and runtime, using several high dimensional standard benchmark functions.
heuristic optimization ; high dimensional optimization ; nature-inspired algorithms ; optimization techniques
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
5 (1)
2014.
1-8
objavljeno
1847-6996
1847-7003
Povezanost rada
Računarstvo