Binary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos]

Crawford B.; Soto R.; Berrios N.; Johnson F.; Paredes F.

dc.contributor.author	Crawford B.
dc.contributor.author	Soto R.
dc.contributor.author	Berrios N.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:15:35Z
dc.date.available	2020-09-02T22:15:35Z
dc.date.issued	2015
dc.identifier	10.1109/CISTI.2015.7170365
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4118
dc.description	The set covering problem belongs to the 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 minimal cost. The solution to this problem is presented using, for first time, the binary cat swarm optimization algorithm. This metaheuristic is based on the cat's behavior, where cats have curiosity by objects in motion and have a great hunting ability. Cats have two modes of behavior: seeking mode and tracing mode. The algorithm is tested on 65 instances, which are compared in a result table including a column with the relative percentage deviation. © 2015 AISTI.
dc.language.iso	es
dc.publisher	Institute of Electrical and Electronics Engineers Inc.
dc.subject	binary cat swarm optimization
dc.subject	metaheuristic
dc.subject	set covering problem
dc.subject	Algorithms
dc.subject	Bins
dc.subject	Combinatorial optimization
dc.subject	Information systems
dc.subject	Combinatorial optimization problems
dc.subject	Complex problems
dc.subject	Metaheuristic
dc.subject	Minimal cost
dc.subject	Relative percentage deviations
dc.subject	Set covering problem
dc.subject	Swarm optimization
dc.subject	Swarm optimization algorithms
dc.subject	Optimization
dc.title	Binary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos]
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84943328985.pdf
Tamaño:: 2.388Kb
Formato:: PDF

Ver/

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

Artículos científicos

Mostrar el registro sencillo del ítem

Repositorio Académico

Binary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos]

Ficheros en el ítem

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

Ítems relacionados

The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020) ﻿

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

Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos] (2020) ﻿

The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje] (2020)

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

Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos] (2020)