Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorBerrios N.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:35Z
dc.date.available2020-09-02T22:15:35Z
dc.date.issued2015
dc.identifier10.1109/CISTI.2015.7170365
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4118
dc.descriptionThe 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.isoes
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectbinary cat swarm optimization
dc.subjectmetaheuristic
dc.subjectset covering problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectInformation systems
dc.subjectCombinatorial optimization problems
dc.subjectComplex problems
dc.subjectMetaheuristic
dc.subjectMinimal cost
dc.subjectRelative percentage deviations
dc.subjectSet covering problem
dc.subjectSwarm optimization
dc.subjectSwarm optimization algorithms
dc.subjectOptimization
dc.titleBinary cat swarm optimization for the set covering problem [Optimización por Colonia de Gatos del Problema de Cobertura de Conjuntos]
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record