A binary firefly algorithm for the set covering problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Miguel Olivares-Suárez, Fernando Paredes

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

40 Scopus citations

Abstract

The non-unicost Set Covering Problem is a well-known NP-hard problem with many practical applications. In this work, a new approach based on Binary Firefly Algorithm is proposed to solve this problem. The Firefly Algorithm has attracted much attention and has been applied to many optimization problems. Here, we demonstrate that is also able to produce very competitive results solving the portfolio of set covering problems from the OR-Library.

Original languageEnglish
Title of host publicationModern Trends and Techniques in Computer Science - 3rd Computer Science On-line Conference, CSOC 2014
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Verlag
Pages65-73
Number of pages9
ISBN (Electronic)9783319067391
DOIs
StatePublished - 1 Jan 2014
Event3rd Computer Science On-line Conference, CSOC 2014 -
Duration: 1 Apr 2014 → …

Publication series

NameAdvances in Intelligent Systems and Computing
Volume285
ISSN (Print)2194-5357

Conference

Conference3rd Computer Science On-line Conference, CSOC 2014
Period1/04/14 → …

Keywords

  • Binary firefly algorithm
  • Metaheuristic
  • Set covering problem

Fingerprint Dive into the research topics of 'A binary firefly algorithm for the set covering problem'. Together they form a unique fingerprint.

Cite this