Cherry-Picking Meta-heuristic Algorithms and Parameters for Real Optimization Problems

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an approach that is able to automatically choose the best meta-heuristic and configuration for solving a real optimization problem. Our approach allows the researcher to indicate which meta-heuristics to choose from and, for each meta-heuristic, which parameters should be automatically configured to find good solutions for the optimization problem. We show that our approach is sound using ten well know real optimization problems and five meta-heuristics. As a side effect, we were also able to provide an unbiased way of assessing meta-heuristics concerning their performance to address one or more classes of real optimization problems. Our approach improved the results found for all the meta-heuristics in all problems and was also able to find very competitive results for all optimization problems when given the liberty to choose which meta-heuristic to use.

Cite

CITATION STYLE

APA

Martins, K., & Mendes, R. (2022). Cherry-Picking Meta-heuristic Algorithms and Parameters for Real Optimization Problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13566 LNAI, pp. 500–511). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-16474-3_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free