Mostrar el registro sencillo del ítem

Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorSuárez M.O.
dc.contributor.authorParedes F.
dc.contributor.authorJohnson F.
dc.date.accessioned2020-09-02T22:16:10Z
dc.date.available2020-09-02T22:16:10Z
dc.date.issued2014
dc.identifier10.1109/CISTI.2014.6877090
dc.identifier.issn21660727
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4226
dc.descriptionThe 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. © 2014 AISTI.
dc.language.isoes
dc.publisherIEEE Computer Society
dc.subjectCoverage Problem Sets
dc.subjectFirefly Algorithm Binary
dc.subjectMetaheuristic
dc.subjectAlgorithms
dc.subjectBenchmarking
dc.subjectBioluminescence
dc.subjectCombinatorial optimization
dc.subjectFire protection
dc.subjectInformation systems
dc.subjectOptimization
dc.subjectRandom number generation
dc.subjectBinary representations
dc.subjectCombinatorial optimization problems
dc.subjectCoverage problem
dc.subjectFirefly algorithms
dc.subjectMetaheuristic
dc.subjectRandom Numbers
dc.subjectSet cover problem
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleBinary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84906695071.pdf
Tamaño:
2.635Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem