TY - GEN

T1 - Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Suárez, Miguel Olivares

AU - Paredes, Fernando

AU - Johnson, Franklin

PY - 2014

Y1 - 2014

N2 - The set cover problem, belongs to the branch of combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at a minimal cost. In this work, the problem is solved by binary Firefly algorithm, based on the flashing behavior of fireflies, using binary representation. A firefly produces a change in brightness based position between the fireflies. The new position is determined by the change in the value of the old position of the firefly, but the number of the new position is a real number, we can solve this problem with the function tanh binarization compared with a random number generated uniformly distributed between 0 and 1. The proposed algorithm has been tested on 65 benchmark instances. The results show that it is capable of producing solutions competitivas. virtualización; ultrasecuenciación genetics.

AB - The set cover problem, belongs to the branch of combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at a minimal cost. In this work, the problem is solved by binary Firefly algorithm, based on the flashing behavior of fireflies, using binary representation. A firefly produces a change in brightness based position between the fireflies. The new position is determined by the change in the value of the old position of the firefly, but the number of the new position is a real number, we can solve this problem with the function tanh binarization compared with a random number generated uniformly distributed between 0 and 1. The proposed algorithm has been tested on 65 benchmark instances. The results show that it is capable of producing solutions competitivas. virtualización; ultrasecuenciación genetics.

KW - Coverage Problem Sets

KW - Firefly Algorithm Binary

KW - Metaheuristic

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

U2 - 10.1109/CISTI.2014.6877090

DO - 10.1109/CISTI.2014.6877090

M3 - Conference contribution

AN - SCOPUS:84906695071

SN - 9789899843431

T3 - Iberian Conference on Information Systems and Technologies, CISTI

BT - 9th Iberian Conference on Information Systems and Technologies, CISTI 2014

PB - IEEE Computer Society

T2 - 9th Iberian Conference on Information Systems and Technologies, CISTI 2014

Y2 - 18 June 2014 through 21 June 2014

ER -