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

Broderick Crawford, Ricardo Soto, Miguel Olivares Suárez, Fernando Paredes, Franklin Johnson

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

17 Citas (Scopus)

Resumen

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.

Título traducido de la contribuciónBinary Firefly algorithm for the set covering problem
Idioma originalEspañol
Título de la publicación alojada9th Iberian Conference on Information Systems and Technologies, CISTI 2014
EditorialIEEE Computer Society
ISBN (versión impresa)9789899843431
DOI
EstadoPublicada - 2014
Evento9th Iberian Conference on Information Systems and Technologies, CISTI 2014 - Barcelona, Espana
Duración: 18 jun. 201421 jun. 2014

Serie de la publicación

NombreIberian Conference on Information Systems and Technologies, CISTI
ISSN (versión impresa)2166-0727
ISSN (versión digital)2166-0735

Conferencia

Conferencia9th Iberian Conference on Information Systems and Technologies, CISTI 2014
País/TerritorioEspana
CiudadBarcelona
Período18/06/1421/06/14

Palabras clave

  • Coverage Problem Sets
  • Firefly Algorithm Binary
  • Metaheuristic

Huella

Profundice en los temas de investigación de 'Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos'. En conjunto forman una huella única.

Citar esto