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

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

doi:10.1109/CISTI.2015.7170366

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

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 contribution	Set covering problem solved by new binary firefly algorithm
Original language	Spanish
Title of host publication	2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9789899843455
DOIs	https://doi.org/10.1109/CISTI.2015.7170366
State	Published - 28 Jul 2015
Event	10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal Duration: 17 Jun 2015 → 20 Jun 2015

Publication series

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

Conference

Conference	10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Country/Territory	Portugal
City	Aveiro
Period	17/06/15 → 20/06/15

Access to Document

10.1109/CISTI.2015.7170366

Cite this

Crawford, B., Soto, R., Riquelme-Leiva, M., Peña, C., Torres-Rojas, C., Johnson, F., & Paredes, F. (2015). Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 Article 7170366 (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISTI.2015.7170366

Crawford, Broderick ; Soto, Ricardo ; Riquelme-Leiva, Marco et al. / Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario. 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015).

@inproceedings{47131555994947049425023ab21ece06,

title = "Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luci{\'e}rnaga Binario",

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.",

keywords = "Discretization Methods, Modified Binary Firefly Algorithm, NP-hard, Set Covering Problem, Transfer Functions",

author = "Broderick Crawford and Ricardo Soto and Marco Riquelme-Leiva and Cristian Pe{\~n}a and Claudio Torres-Rojas and Franklin Johnson and Fernando Paredes",

note = "Publisher Copyright: {\textcopyright} 2015 AISTI.; 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 ; Conference date: 17-06-2015 Through 20-06-2015",

year = "2015",

month = jul,

day = "28",

doi = "10.1109/CISTI.2015.7170366",

language = "Spanish",

series = "2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015",

}

Crawford, B , Soto, R, Riquelme-Leiva, M, Peña, C, Torres-Rojas, C, Johnson, F & Paredes, F 2015, Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario. in 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015., 7170366, 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, Institute of Electrical and Electronics Engineers Inc., 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, Aveiro, Portugal, 17/06/15. https://doi.org/10.1109/CISTI.2015.7170366

Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario. / Crawford, Broderick ; Soto, Ricardo; Riquelme-Leiva, Marco et al.
2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7170366 (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Riquelme-Leiva, Marco

AU - Peña, Cristian

AU - Torres-Rojas, Claudio

AU - Johnson, Franklin

AU - Paredes, Fernando

PY - 2015/7/28

Y1 - 2015/7/28

N2 - 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.

AB - 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.

KW - Discretization Methods

KW - Modified Binary Firefly Algorithm

KW - NP-hard

KW - Set Covering Problem

KW - Transfer Functions

UR - http://www.scopus.com/inward/record.url?scp=84943328998&partnerID=8YFLogxK

U2 - 10.1109/CISTI.2015.7170366

DO - 10.1109/CISTI.2015.7170366

M3 - Conference contribution

AN - SCOPUS:84943328998

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

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 17 June 2015 through 20 June 2015

ER -

Crawford B , Soto R, Riquelme-Leiva M, Peña C, Torres-Rojas C, Johnson F et al. Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7170366. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). doi: 10.1109/CISTI.2015.7170366

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this