Optimización por colonia de gatos del problema de cobertura de conjuntos [Binary cat swarm optimization for the set covering problem]

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorBerrios, N.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T16:31:37Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T16:31:37Z
dc.date.issued2015
dc.description.abstractThe 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.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1109/CISTI.2015.7170365es_ES
dc.identifier.urihttps://doi.org/10.1109/CISTI.2015.7170365
dc.language.isospaes_ES
dc.publisherInstitute of Electrical and Electronics Engineers Inc.es_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_ES
dc.source2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015es_ES
dc.subjectComputer Sciencees_ES
dc.subjectSocial Scienceses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#1.02.01es_ES
dc.titleOptimización por colonia de gatos del problema de cobertura de conjuntos [Binary cat swarm optimization for the set covering problem]es_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
130. Optimización por colonia de gatos del problema de cobertura de conjuntos [Binary cat swarm optimization for the set covering problem].pdf
Tamaño:
2.16 MB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso