Cat swarm optimization with different binarization methods for solving set covering problems

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

4 Scopus citations

Abstract

In this paper, we present a Binary cat swarm optimization for solving the Set covering problem. The Set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behaviour of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. Moreover, eight different transfer functions and five discretization techniques are considered for solving the binary problem. We illustrate this approach with 65 instances of the problem and select the best transfer function and discretization technique to solve 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
Pages511-524
Number of pages14
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

  • Binary Cat SwarmOptimization
  • Metaheuristic
  • Set covering problem

Fingerprint Dive into the research topics of 'Cat swarm optimization with different binarization methods for solving set covering problems'. Together they form a unique fingerprint.

Cite this