Mostrar el registro sencillo del ítem

Solving the set covering problem with binary cat swarm optimization

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorBerrÍos 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.1007/978-3-319-20466-6_4
dc.identifier.citation9140, , 41-48
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4121
dc.descriptionThe 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. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceGelbukh A.Tan Y.Das S.Engelbrecht A.Buarque F.Shi Y.
dc.subjectBinary cat swarm optimization
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.subjectArtificial intelligence
dc.subjectBins
dc.subjectFormal model
dc.subjectMetaheuristic
dc.subjectMinimum cost
dc.subjectOptimization problems
dc.subjectSet covering problem
dc.subjectSwarm optimization
dc.subjectOptimization
dc.titleSolving the set covering problem with binary cat swarm optimization
dc.typeConference Paper


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84947800806.pdf
Tamaño:
1.962Kb
Formato:
PDF
Ver/

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

Mostrar el registro sencillo del ítem