Cat swarm optimization with different binarization methods for solving set covering problems
Autor
Crawford B.
Soto R.
Berrios N.
Olguín E.
Resumen
In this paper, we present a Binary cat swarm optimization for solving the Set covering problem. The Set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behaviour of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. Moreover, eight different transfer functions and five discretization techniques are considered for solving the binary problem. We illustrate this approach with 65 instances of the problem and select the best transfer function and discretization technique to solve this problem. © Springer International Publishing Switzerland 2016.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Cat swarm optimization with different transfer functions for solving set covering problems (2020)
Crawford B.; Soto R.; Berrios N.; Olguín E.; Misra S. (Springer Verlag, 2016) -
Conference Paper
Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020)
Crawford B.; Soto R.; Riquelme-Leiva M.; Peña C.; Torres-Rojas C.; Johnson F.; Paredes F. (Springer Verlag, 2015) -
Conference Paper
An artificial fish swarm optimization algorithm to solve set covering problem (2020)
Crawford B.; Soto R.; Olguín E.; Villablanca S.M.; Rubio Á.G.; Jaramillo A.; Salas J. (Springer Verlag, 2016)