A Review of 315 Benchmark and Test Functions for Machine Learning Optimization Algorithms and Metaheuristics with Mathematical and Visual Descriptions
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913390790705152 |
|---|---|
| author | Naser, M. Z. al-Bashiti, Mohammad Khaled Tapeh, Arash Teymori Gharah Eslamlou, Armin Dadras Naser, Ahmed Kodur, Venkatesh Hawileeh, Rami Abdalla, Jamal Khodadadi, Nima Gandomi, Amir H. |
| author_facet | Naser, M. Z. al-Bashiti, Mohammad Khaled Tapeh, Arash Teymori Gharah Eslamlou, Armin Dadras Naser, Ahmed Kodur, Venkatesh Hawileeh, Rami Abdalla, Jamal Khodadadi, Nima Gandomi, Amir H. |
| contents | In the rapidly evolving optimization and metaheuristics domains, the efficacy of algorithms is crucially determined by the benchmark (test) functions. While several functions have been developed and derived over the past decades, little information is available on the mathematical and visual description, range of suitability, and applications of many such functions. To bridge this knowledge gap, this review provides an exhaustive survey of more than 300 benchmark functions used in the evaluation of optimization and metaheuristics algorithms. This review first catalogs benchmark and test functions based on their characteristics, complexity, properties, visuals, and domain implications to offer a wide view that aids in selecting appropriate benchmarks for various algorithmic challenges. This review also lists the 25 most commonly used functions in the open literature and proposes two new, highly dimensional, dynamic and challenging functions that could be used for testing new algorithms. Finally, this review identifies gaps in current benchmarking practices and suggests directions for future research. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09581 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Review of 315 Benchmark and Test Functions for Machine Learning Optimization Algorithms and Metaheuristics with Mathematical and Visual Descriptions Naser, M. Z. al-Bashiti, Mohammad Khaled Tapeh, Arash Teymori Gharah Eslamlou, Armin Dadras Naser, Ahmed Kodur, Venkatesh Hawileeh, Rami Abdalla, Jamal Khodadadi, Nima Gandomi, Amir H. Machine Learning Neural and Evolutionary Computing In the rapidly evolving optimization and metaheuristics domains, the efficacy of algorithms is crucially determined by the benchmark (test) functions. While several functions have been developed and derived over the past decades, little information is available on the mathematical and visual description, range of suitability, and applications of many such functions. To bridge this knowledge gap, this review provides an exhaustive survey of more than 300 benchmark functions used in the evaluation of optimization and metaheuristics algorithms. This review first catalogs benchmark and test functions based on their characteristics, complexity, properties, visuals, and domain implications to offer a wide view that aids in selecting appropriate benchmarks for various algorithmic challenges. This review also lists the 25 most commonly used functions in the open literature and proposes two new, highly dimensional, dynamic and challenging functions that could be used for testing new algorithms. Finally, this review identifies gaps in current benchmarking practices and suggests directions for future research. |
| title | A Review of 315 Benchmark and Test Functions for Machine Learning Optimization Algorithms and Metaheuristics with Mathematical and Visual Descriptions |
| topic | Machine Learning Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2406.09581 |