Publicação
Cherry-picking meta-heuristic algorithms and parameters for real optimization problems
| Resumo: | 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. |
|---|---|
| Autores principais: | Martins, Kevin |
| Outros Autores: | Mendes, Rui |
| Assunto: | No-free lunch theorem Real optimization Meta-heuristics Swarm intelligence Grammatical evolution |
| Ano: | 2022 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | 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. |
|---|