Modified binary firefly algorithms with different transfer functions for solving set covering problems

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Marco Riquelme-Leiva, Cristian Peña, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes

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

12 Scopus citations

Abstract

In this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand.

Original languageEnglish
Title of host publicationSoftware Engineering in Intelligent Systems - Proceedings of the 4th Computer Science On-line Conference 2015, CSOC2015
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Zdenka Prokopova, Petr Silhavy
PublisherSpringer Verlag
Pages307-315
Number of pages9
ISBN (Print)9783319184722
DOIs
StatePublished - 1 Jan 2015
Event4th International Conference on Computer Science On-line Conference, CSOC 2015 - Zlin, Czech Republic
Duration: 27 Apr 201530 Apr 2015

Publication series

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

Conference

Conference4th International Conference on Computer Science On-line Conference, CSOC 2015
Country/TerritoryCzech Republic
CityZlin
Period27/04/1530/04/15

Keywords

  • Combinatorial Optimization
  • Metaheuristics
  • Modified Binary FireFly Algorithm
  • Set Covering Problem

Fingerprint

Dive into the research topics of 'Modified binary firefly algorithms with different transfer functions for solving set covering problems'. Together they form a unique fingerprint.

Cite this