Title
A bi-objetive Cat Swarm Optimization algorithm for set covering problem
Date Issued
01 January 2016
Access level
metadata only access
Resource Type
conference paper
Author(s)
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
In this paper, we study a classical problem in combinatorics and computer science, Set Covering Problem. It is one of Karp’s 21 NP-complete problems, using a new and original metaheuristic, Cat Swarm Optimization. This algorithm imitates the domestic cat through two states: seeking and tracing mode. The OR-Library of Beasley instances were used for the benchmark with additional fitness function, thus the problem was transformed from Mono-objective to Bi-objective. The Cat Swarm Optimization finds a set solution non-dominated based on Pareto concepts, and an external file for storing them. The results are promising for further continue in future work optimizing this problem.
Start page
491
End page
500
Volume
464
Language
English
OCDE Knowledge area
Ciencias de la computación
Otras ingenierías y tecnologías
Subjects
Scopus EID
2-s2.0-84964701642
Source
Advances in Intelligent Systems and Computing
Resource of which it is part
Advances in Intelligent Systems and Computing
ISSN of the container
21945357
ISBN of the container
9783319336237
Conference
5th Computer Science On-line Conference, CSOC 2016
Sponsor(s)
The author Broderick Crawford is supported by grant CONICYT/FONDECYT /REGULAR/1140897 and Ricardo Soto is supported by grant CONICYT/FONDECYT/INICIA CION/11130459
Sources of information:
Directorio de Producción Científica
Scopus