@inproceedings{9416711f80e54abc9c361d001b60ccc1,
title = "Solving the set covering problem with binary cat swarm optimization",
abstract = "The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero–one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a binary version of Cat Swarm Optimization generated by observing cat behavior. Cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve the Set Covering Problem, for this the proposed algorithm has been tested on 65 benchmarks instances.",
keywords = "Binary cat swarm optimization, Metaheuristic, Set covering problem",
author = "Broderick Crawford and Ricardo Soto and Natalia Berr{\'I}os and Franklin Johnson and Fernando Paredes",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; null ; Conference date: 25-06-2015 Through 28-06-2015",
year = "2015",
doi = "10.1007/978-3-319-20466-6_4",
language = "English",
isbn = "9783319204659",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "41--48",
editor = "Alexander Gelbukh and Ying Tan and Swagatam Das and Andries Engelbrecht and Fernando Buarque and Yuhui Shi",
booktitle = "Advances in Swarm and Computational Intelligence - 6th International Conference, ICSI 2015 held in conjunction with the 2nd BRICS Congress, CCI 2015, Proceedings",
}