A Binary Whale Algorithm Applied to Knapsack Problem

Paola Moraga, Pamela Valenzuela, Francisco Altimiras, Luis Lopez, José Miguel Rubio

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

Resumen

Combinatorial and particularly combinatorial NP-hard problems are of importance and interest in operations research. Therefore, the design of efficient algorithms that address these combinatorial problems are applied research lines with interesting potential. Inspired by the above, this article designs a binarization method so that continuous metaheuristics can solve combinatorial problems. The binarization method uses the concept of percentile. This percentile method is applied to the firefly algorithm. The multidimensional backpack problem (MKP) was used to verify our algorithm.

Idioma originalInglés
Título de la publicación alojadaData Science and Intelligent Systems - Proceedings of 5th Computational Methods in Systems and Software 2021
EditoresRadek Silhavy, Petr Silhavy, Zdenka Prokopova
EditorialSpringer Science and Business Media Deutschland GmbH
Páginas465-474
Número de páginas10
ISBN (versión impresa)9783030903206
DOI
EstadoPublicada - 2021
Publicado de forma externa
Evento5th Computational Methods in Systems and Software, CoMeSySo 2021 - Virtual, Online
Duración: 1 oct. 20211 oct. 2021

Serie de la publicación

NombreLecture Notes in Networks and Systems
Volumen231 LNNS
ISSN (versión impresa)2367-3370
ISSN (versión digital)2367-3389

Conferencia

Conferencia5th Computational Methods in Systems and Software, CoMeSySo 2021
CiudadVirtual, Online
Período1/10/211/10/21

Huella

Profundice en los temas de investigación de 'A Binary Whale Algorithm Applied to Knapsack Problem'. En conjunto forman una huella única.

Citar esto