Solving biobjective set covering problem using binary cat swarm optimization algorithm

Broderick Crawford, Ricardo Soto, Hugo Caballero, Eduardo Olguín, Sanjay Misra

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

2 Citas (Scopus)

Resumen

The 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.

Idioma originalInglés
Título de la publicación alojadaComputational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings
EditoresBernady O. Apduhan, Beniamino Murgante, Sanjay Misra, David Taniar, Carmelo M. Torre, Ana Maria A.C. Rocha, Shangguang Wang, Osvaldo Gervasi, Elena Stankova
EditorialSpringer Verlag
Páginas220-231
Número de páginas12
ISBN (versión impresa)9783319420844
DOI
EstadoPublicada - 2016
Publicado de forma externa
Evento16th International Conference on Computational Science and Its Applications, ICCSA 2016 - Beijing, China
Duración: 4 jul. 20167 jul. 2016

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen9786
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia16th International Conference on Computational Science and Its Applications, ICCSA 2016
País/TerritorioChina
CiudadBeijing
Período4/07/167/07/16

Huella

Profundice en los temas de investigación de 'Solving biobjective set covering problem using binary cat swarm optimization algorithm'. En conjunto forman una huella única.

Citar esto