Mostrar el registro sencillo del ítem

Solving biobjective set covering problem using binary cat swarm optimization algorithm

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorCaballero H.
dc.contributor.authorOlguín E.
dc.contributor.authorMisra S.
dc.date.accessioned2020-09-02T22:15:36Z
dc.date.available2020-09-02T22:15:36Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42085-1_17
dc.identifier.citation9786, , 220-231
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4124
dc.descriptionThe set cover problem is a classical question in combinatorics, computer science and complexity theory. It is one of Karp’s 21 NP-complete problems shown to be NP-complete in 1972. Several algorithms have been proposed to solve this problem, based on genetic algorithms (GA), Particle Swarm Optimizer (PSO) and in recent years algorithms based in behavior algorithms based groups or herds of animals, such as frogs, bats, bees and domestic cats. This work presents the basic features of the algorithm based on the behavior of domestic cats and results to solve the SCP bi-objective, experimental results and opportunities to improve results using adaptive techniques applied to Cat Swarm Optimization. For this purpose we will use instances of SCP OR-Library of Beasley by adding an extra function fitness to transform the Beasly instance to Bi-Objective problem. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceApduhan B.O.Murgante B.Misra S.Taniar D.Torre C.M.Rocha A.M.A.C.Wang S.Gervasi O.Stankova E.
dc.subjectCat swarm optimization
dc.subjectEvolutionary algorithm
dc.subjectMultiobjective cat swarm optimization
dc.subjectMultiobjective problems
dc.subjectPareto dominance
dc.subjectSwarm optimization
dc.subjectAlgorithms
dc.subjectComputational complexity
dc.subjectEvolutionary algorithms
dc.subjectGenetic algorithms
dc.subjectMultiobjective optimization
dc.subjectParticle swarm optimization (PSO)
dc.subjectProblem solving
dc.subjectAdaptive technique
dc.subjectMulti-objective problem
dc.subjectPareto dominance
dc.subjectParticle swarm optimizers
dc.subjectSet cover problem
dc.subjectSet covering problem
dc.subjectSwarm optimization
dc.subjectSwarm optimization algorithms
dc.subjectOptimization
dc.titleSolving biobjective set covering problem using binary cat swarm optimization algorithm
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem