Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario

Translated title of the contribution: Set covering problem solved by new binary firefly algorithm

Broderick Crawford, Ricardo Soto, Marco Riquelme-Leiva, Cristian Peña, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes

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

1 Scopus citations

Abstract

In this paper, we propose a Modified Binary Firefly Algorithm to solve different instances of the Set Covering Problem (SCP). The Set Covering Problem is considered a classic combinatorial optimization problem, belonging to the class NP-hard problem [8] and have many practical applications. In this paper we consider applying Modified Binary Firefly Algorithm supported in eight Transfer Functions and five Discretization Methods that allow us to express the solution of the problem in the binary domain. The different results presented in this paper show that our algorithm is a good alternative at a low cost to solve the SCP.

Translated title of the contributionSet covering problem solved by new binary firefly algorithm
Original languageSpanish
Title of host publication2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9789899843455
DOIs
StatePublished - 28 Jul 2015
Externally publishedYes
Event10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal
Duration: 17 Jun 201520 Jun 2015

Publication series

Name2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

Conference

Conference10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Country/TerritoryPortugal
CityAveiro
Period17/06/1520/06/15

Fingerprint

Dive into the research topics of 'Set covering problem solved by new binary firefly algorithm'. Together they form a unique fingerprint.

Cite this