A K-means Bat Algorithm Applied to the Knapsack Problem

Leonardo Pavez, Francisco Altimiras, Gabriel Villavicencio

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

3 Citas (Scopus)

Resumen

Combinatorial problems are frequent in the industry and in the engineering field. Many of these problems are NP-hard and can hardly be addressed with complete techniques. Therefore, the design of binary algorithms based on continuous metaheuristic swarm intelligence is an area of interest in operational research. In this article we use a general binarization mechanism based on the k-means technique. This technique is applied to the bat algorithm with the objective of solving the problem of the multidimensional backpack (MKP). The experiments are designed to demonstrate the utility of the k-means technique in binarization. In addition, we verified the efficiency of our algorithm through reference instances, showing that the k-means binary bat (BKBA) algorithm obtains adequate results when evaluated against another next-generation algorithm.

Idioma originalInglés
Título de la publicación alojadaSoftware Engineering Perspectives in Intelligent Systems - Proceedings of 4th Computational Methods in Systems and Software 2020
EditoresRadek Silhavy, Petr Silhavy, Zdenka Prokopova
EditorialSpringer Science and Business Media Deutschland GmbH
Páginas612-621
Número de páginas10
ISBN (versión impresa)9783030633189
DOI
EstadoPublicada - 2020
Evento4th Computational Methods in Systems and Software, CoMeSySo 2020 - Vsetin, República Checa
Duración: 14 oct. 202017 oct. 2020

Serie de la publicación

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

Conferencia

Conferencia4th Computational Methods in Systems and Software, CoMeSySo 2020
País/TerritorioRepública Checa
CiudadVsetin
Período14/10/2017/10/20

Huella

Profundice en los temas de investigación de 'A K-means Bat Algorithm Applied to the Knapsack Problem'. En conjunto forman una huella única.

Citar esto