A Binary Whale Algorithm Applied to Knapsack Problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationData Science and Intelligent Systems - Proceedings of 5th Computational Methods in Systems and Software 2021
EditorsRadek Silhavy, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Science and Business Media Deutschland GmbH
Pages465-474
Number of pages10
ISBN (Print)9783030903206
DOIs
StatePublished - 2021
Externally publishedYes
Event5th Computational Methods in Systems and Software, CoMeSySo 2021 - Virtual, Online
Duration: 1 Oct 20211 Oct 2021

Publication series

NameLecture Notes in Networks and Systems
Volume231 LNNS
ISSN (Print)2367-3370
ISSN (Electronic)2367-3389

Conference

Conference5th Computational Methods in Systems and Software, CoMeSySo 2021
CityVirtual, Online
Period1/10/211/10/21

Keywords

  • Combinatorial optimization
  • Metaheuristics
  • Multidimensional knapsack problem

Fingerprint

Dive into the research topics of 'A Binary Whale Algorithm Applied to Knapsack Problem'. Together they form a unique fingerprint.

Cite this