A Binary Firefly Algorithm Applied to Knapsack Problem

Hernan Pinto, Matias Valenzuela, Carlos Maureira, Luis Lopez, Andrés Fernández

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

Abstract

The NP-hard problems are of interest in operations research and particularly the combinatorial problems. Therefore, the design of efficient algorithms that address these combinatorial problems are active lines of research. 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 method of percentile is applied to the firefly algorithm. The multidimensional knapsack problem (MKP) was used to verify our algorithm.

Original languageEnglish
Title of host publicationArtificial Intelligence in Intelligent Systems - Proceedings of 10th Computer Science On-line Conference, 2021
EditorsRadek Silhavy
PublisherSpringer Science and Business Media Deutschland GmbH
Pages376-385
Number of pages10
ISBN (Print)9783030774448
DOIs
StatePublished - 2021
Externally publishedYes
Event10th Computer Science Online Conference, CSOC 2021 - Virtual, Online
Duration: 1 Apr 20211 Apr 2021

Publication series

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

Conference

Conference10th Computer Science Online Conference, CSOC 2021
CityVirtual, Online
Period1/04/211/04/21

Keywords

  • Combinatorial optimization
  • Metaheuristics
  • Multidimensional Knapsack problem

Fingerprint

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

Cite this