Binary Firefly algorithm for the set covering problem

@article{Crawford2014BinaryFA,
  title={Binary Firefly algorithm for the set covering problem},
  author={Broderick Crawford and Ricardo Soto and Miguel Olivares Suarez and Fernando Paredes and Franklin Johnson},
  journal={2014 9th Iberian Conference on Information Systems and Technologies (CISTI)},
  year={2014},
  pages={1-5}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Similar Papers

Loading similar papers…