A new taxonomy of global optimization algorithms
Autor: | Thomas Bartz-Beielstein, Agoston E. Eiben, Jörg Stork |
---|---|
Přispěvatelé: | Network Institute, Computational Intelligence, Artificial intelligence |
Jazyk: | angličtina |
Rok vydání: | 2020 |
Předmět: |
021103 operations research
Optimization problem Computer science 0211 other engineering and technologies Complex system 02 engineering and technology Taxonomie Evolutionärer Algorithmus Computer Science Applications Metaheuristik Search algorithm Theory of computation 0202 electrical engineering electronic engineering information engineering ddc:000 Embedding 020201 artificial intelligence & image processing Algorithm design Global optimization Algorithm Metaheuristic |
Zdroj: | Stork, J, Eiben, A E & Bartz-Beielstein, T 2020, ' A new taxonomy of global optimization algorithms ', Natural Computing, vol. 21, no. 2, pp. 219-242 . https://doi.org/10.1007/s11047-020-09820-4 Natural Computing, 21(2), 219-242. Springer Netherlands |
ISSN: | 1572-9796 1567-7818 |
DOI: | 10.1007/s11047-020-09820-4 |
Popis: | Surrogate-based optimization, nature-inspired metaheuristics, and hybrid combinations have become state of the art in algorithm design for solving real-world optimization problems. Still, it is difficult for practitioners to get an overview that explains their advantages in comparison to a large number of available methods in the scope of optimization. Available taxonomies lack the embedding of current approaches in the larger context of this broad field. This article presents a taxonomy of the field, which explores and matches algorithm strategies by extracting similarities and differences in their search strategies. A particular focus lies on algorithms using surrogates, nature-inspired designs, and those created by automatic algorithm generation. The extracted features of algorithms, their main concepts, and search operators, allow us to create a set of classification indicators to distinguish between a small number of classes. The features allow a deeper understanding of components of the search strategies and further indicate the close connections between the different algorithm designs. We present intuitive analogies to explain the basic principles of the search algorithms, particularly useful for novices in this research field. Furthermore, this taxonomy allows recommendations for the applicability of the corresponding algorithms. |
Databáze: | OpenAIRE |
Externí odkaz: |