Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto

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

doi:10.1109/CISTI.2015.7170376

Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto

Translated title of the contribution: Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem

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

SCHOOL OF COMPUTER ENGINEERING

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

Abstract

This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results.

Translated title of the contribution	Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem
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.7170376
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.7170376

Cite this

Crawford, B., Soto, R., Peña, C., Riquelme-Leiva, M., Torres-Rojas, C., Johnson, F., & Paredes, F. (2015). Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 Article 7170376 (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.7170376

Crawford, Broderick ; Soto, Ricardo ; Peña, Cristian et al. / Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto. 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{4202e572d0f54c2baaa5b6174b3bfd9d,

title = "Funciones de binarizaci{\'o}n para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto",

abstract = "This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results.",

keywords = "Metaheuristics, Set Covering Problem, Shuffled Frog Leaping Algorithm",

author = "Broderick Crawford and Ricardo Soto and Cristian Pe{\~n}a and Marco Riquelme-Leiva 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.7170376",

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, Peña, C, Riquelme-Leiva, M, Torres-Rojas, C, Johnson, F & Paredes, F 2015, Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto. in 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015., 7170376, 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.7170376

Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto. / Crawford, Broderick ; Soto, Ricardo; Peña, Cristian et al.
2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7170376 (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 - Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Peña, Cristian

AU - Riquelme-Leiva, Marco

AU - Torres-Rojas, Claudio

AU - Johnson, Franklin

AU - Paredes, Fernando

PY - 2015/7/28

Y1 - 2015/7/28

N2 - This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results.

AB - This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results.

KW - Metaheuristics

KW - Set Covering Problem

KW - Shuffled Frog Leaping Algorithm

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

U2 - 10.1109/CISTI.2015.7170376

DO - 10.1109/CISTI.2015.7170376

M3 - Conference contribution

AN - SCOPUS:84943328619

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, Peña C, Riquelme-Leiva M, Torres-Rojas C, Johnson F et al. Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7170376. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). doi: 10.1109/CISTI.2015.7170376

Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this