Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura

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

doi:10.1109/CISTI.2015.7170352

Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura

Translated title of the contribution: Using binary fruit fly algorithm for solving the set covering problem

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

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

Abstract

Many practical applications are used in set covering problems (SCP), in this research, we used to solve SCP: the binary Fruit Fly Optimization algorithms. This algorithm is divided in four phases: initiation, smell based search local vision based search and global vision based search. The metaheuristic is based by the knowledge from the foraging behavior of fruit-flies in finding food. The algorithm used a probability vector to improve the exploration. The tests were performed with eight different transfer functions and an elitist selection method. The test results show the effectiveness of the algorithm proposed.

Translated title of the contribution	Using binary fruit fly algorithm for solving 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.7170352
State	Published - 28 Jul 2015
Externally published	Yes
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.7170352

Cite this

Crawford, B., Soto, R., Torres-Rojas, C., Peña, C., Riquelme-Leiva, M., Johnson, F., & Paredes, F. (2015). Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015 [7170352] (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.7170352

Crawford, Broderick ; Soto, Ricardo ; Torres-Rojas, Claudio et al. / Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura. 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{9171f00a252c47c2bd82c887f5816f36,

title = "Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura",

abstract = "Many practical applications are used in set covering problems (SCP), in this research, we used to solve SCP: the binary Fruit Fly Optimization algorithms. This algorithm is divided in four phases: initiation, smell based search local vision based search and global vision based search. The metaheuristic is based by the knowledge from the foraging behavior of fruit-flies in finding food. The algorithm used a probability vector to improve the exploration. The tests were performed with eight different transfer functions and an elitist selection method. The test results show the effectiveness of the algorithm proposed.",

keywords = "fruit fly optimization algorithm, metaheuristics, set covering problem, transfer functions",

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

note = "Publisher Copyright: {\textcopyright} 2015 AISTI.; null ; Conference date: 17-06-2015 Through 20-06-2015",

year = "2015",

month = jul,

day = "28",

doi = "10.1109/CISTI.2015.7170352",

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, Torres-Rojas, C, Peña, C, Riquelme-Leiva, M, Johnson, F & Paredes, F 2015, Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura. in 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015., 7170352, 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.7170352

Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura. / Crawford, Broderick ; Soto, Ricardo; Torres-Rojas, Claudio et al.

2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7170352 (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 - Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Torres-Rojas, Claudio

AU - Peña, Cristian

AU - Riquelme-Leiva, Marco

AU - Johnson, Franklin

AU - Paredes, Fernando

PY - 2015/7/28

Y1 - 2015/7/28

N2 - Many practical applications are used in set covering problems (SCP), in this research, we used to solve SCP: the binary Fruit Fly Optimization algorithms. This algorithm is divided in four phases: initiation, smell based search local vision based search and global vision based search. The metaheuristic is based by the knowledge from the foraging behavior of fruit-flies in finding food. The algorithm used a probability vector to improve the exploration. The tests were performed with eight different transfer functions and an elitist selection method. The test results show the effectiveness of the algorithm proposed.

AB - Many practical applications are used in set covering problems (SCP), in this research, we used to solve SCP: the binary Fruit Fly Optimization algorithms. This algorithm is divided in four phases: initiation, smell based search local vision based search and global vision based search. The metaheuristic is based by the knowledge from the foraging behavior of fruit-flies in finding food. The algorithm used a probability vector to improve the exploration. The tests were performed with eight different transfer functions and an elitist selection method. The test results show the effectiveness of the algorithm proposed.

KW - fruit fly optimization algorithm

KW - metaheuristics

KW - set covering problem

KW - transfer functions

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

U2 - 10.1109/CISTI.2015.7170352

DO - 10.1109/CISTI.2015.7170352

M3 - Conference contribution

AN - SCOPUS:84943329455

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.

Y2 - 17 June 2015 through 20 June 2015

ER -

Crawford B , Soto R, Torres-Rojas C, Peña C, Riquelme-Leiva M, Johnson F et al. Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura. In 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7170352. (2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015). https://doi.org/10.1109/CISTI.2015.7170352

Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this