Binary cat swarm optimization for the set covering problem

The set covering problem belongs to the combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at minimal cost. The solution to this problem is presented using, for first time, the binary cat swarm optimization algorithm. This metaheuristic is based on the cat's behavior, where cats have curiosity by objects in motion and have a great hunting ability. Cats have two modes of behavior: seeking mode and tracing mode. The algorithm is tested on 65 instances, which are compared in a result table including a column with the relative percentage deviation.

[1]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[2]  H. Adler,et al.  Some factors of observational learning in cats. , 1955, The Journal of genetic psychology.

[3]  Akihiro Yamane,et al.  Mating behaviors, courtship rank and mating success of male feral cat (Felis catus) , 1996, Journal of Ethology.

[4]  Thomas Stützle,et al.  A Comparison Between ACO Algorithms for the Set Covering Problem , 2004, ANTS Workshop.

[5]  Budi Santosa,et al.  Cat Swarm Optimization for Clustering , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.

[6]  Broderick Crawford,et al.  Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem , 2014, TheScientificWorldJournal.

[7]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[8]  Broderick Crawford,et al.  Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization , 2013, Expert Syst. Appl..

[9]  Broderick Crawford,et al.  A Binary Firefly Algorithm for the Set Covering Problem , 2014, CSOC.

[10]  Pei-wei Tsai,et al.  Enhanced parallel cat swarm optimization based on the Taguchi method , 2012, Expert Syst. Appl..

[11]  Pedram Ghaderi,et al.  Hybridization of Harmony Search and Ant Colony Optimization for optimal locating of structural dampers , 2013, Appl. Soft Comput..

[12]  Ganapati Panda,et al.  IIR system identification using cat swarm optimization , 2011, Expert Syst. Appl..

[13]  Sharon L. Crowell-Davis,et al.  Cat Behaviour: Social Organization, Communication And Development , 2007 .

[14]  Jeng-Shyang Pan,et al.  Cat swarm optimization , 2006 .

[15]  Broderick Crawford,et al.  Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem , 2014, HCI.

[16]  Victoria Aspinall.  The complete textbook of veterinary nursing. , 2006 .

[17]  Zhi-Gang Ren,et al.  New ideas for applying ant colony optimization to the set covering problem , 2010, Comput. Ind. Eng..

[18]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[19]  M. A. Khanesar,et al.  Discrete binary cat swarm optimization algorithm , 2013, 2013 3rd IEEE International Conference on Computer, Control and Communication (IC4).

[20]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[21]  Shu-Chuan Chu,et al.  COMPUTATIONAL INTELLIGENCE BASED ON THE BEHAVIOR OF CATS , 2007 .

[22]  Broderick Crawford,et al.  Cultural Algorithms for the Set Covering Problem , 2013, ICSI.