A bi-objetive Cat Swarm Optimization algorithm for set covering problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationArtificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
EditorsRadek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
PublisherSpringer Verlag
Pages491-500
Number of pages10
ISBN (Print)9783319336237
DOIs
StatePublished - 1 Jan 2016
Event5th Computer Science On-line Conference, CSOC 2016 - Prague, Czech Republic
Duration: 27 Apr 201630 Apr 2016

Publication series

NameAdvances in Intelligent Systems and Computing
Volume464
ISSN (Print)2194-5357

Conference

Conference5th Computer Science On-line Conference, CSOC 2016
CountryCzech Republic
CityPrague
Period27/04/1630/04/16

Keywords

  • Cat swarm optimization
  • Evolutionary algorithm
  • Multiobjective cat swarm optimization
  • Multiobjective problems
  • Pareto dominance
  • Swarm optimization

Fingerprint Dive into the research topics of 'A bi-objetive Cat Swarm Optimization algorithm for set covering problem'. Together they form a unique fingerprint.

Cite this