A Self-Adaptive Cuckoo Search Algorithm Using a Machine Learning Technique

Fecha

2021

Profesor Guía

Formato del documento

Articulo

ORCID Autor

Título de la revista

ISSN de la revista

Título del volumen

Editor

MDPI

ISBN

ISSN

item.page.issne

Departamento o Escuela

Escuela de Ingenieria Informatica

Determinador

Recolector

Especie

Nota general

Resumen

Metaheuristics are intelligent problem-solvers that have been very efficient in solving huge optimization problems for more than two decades. However, the main drawback of these solvers is the need for problem-dependent and complex parameter setting in order to reach good results. This paper presents a new cuckoo search algorithm able to self-adapt its configuration, particularly its population and the abandon probability. The self-tuning process is governed by using machine learning, where cluster analysis is employed to autonomously and properly compute the number of agents needed at each step of the solving process. The goal is to efficiently explore the space of possible solutions while alleviating human effort in parameter configuration. We illustrate interesting experimental results on the well-known set covering problem, where the proposed approach is able to compete against various state-of-the-art algorithms, achieving better results in one single run versus 20 different configurations. In addition, the result obtained is compared with similar hybrid bio-inspired algorithms illustrating interesting results for this proposal.

Descripción

Lugar de Publicación

Auspiciador

Palabras clave

CLUSTERING TECHNIQUES, METAHEURISTICS, MACHINE LEARNING, SELF-ADAPTIVE, PARAMETER SETTING, EXPLORATION, EXPLOITATION

Licencia

Copyright: © 2021 by the authors. Licensee MDP
Basel
Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

URL Licencia