Binary firefly algorithm for the set covering problem
B Crawford, R Soto, MO Suárez… - 2014 9th Iberian …, 2014 - ieeexplore.ieee.org
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 …
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 …
[引用][C] Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]
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 …
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 …