A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem

Gabriel Villavicencio, Matias Valenzuela, Francisco Altimiras, Paola Moraga, Hernan Pinto

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva


Many of the problems addressed at the industrial level are of a combinatorial type and a sub-assembly not less than these are of the NP-hard type. The design of algorithms that solve combinatorial problems based on the continuous metaheuristic of swarm intelligence is an area of interest at an industrial level. In this article, we explore a general binarization mechanism of continuous metaheuristics based on the k-means technique. In particular, we apply the k-means technique to the Grasshopper optimization algorithm in order to solve the set covering problem (SCP). The experiments are designed with the aim of demonstrating the usefulness of the k-means technique in binarization. Additionally, we verify the effectiveness of our algorithm through reference instances. The results indicate the K-means binary grasshopper optimization algorithm (KBGOA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

Idioma originalInglés
Título de la publicación alojadaArtificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference, CSOC 2020
EditoresRadek Silhavy
Número de páginas12
ISBN (versión impresa)9783030519704
EstadoPublicada - 2020
Publicado de forma externa
Evento9th Computer Science On-line Conference, CSOC 2020 - Zlin, República Checa
Duración: 15 jul. 202015 jul. 2020

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen1225 AISC
ISSN (versión impresa)2194-5357
ISSN (versión digital)2194-5365


Conferencia9th Computer Science On-line Conference, CSOC 2020
País/TerritorioRepública Checa


Profundice en los temas de investigación de 'A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem'. En conjunto forman una huella única.

Citar esto