A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

Broderick Crawford; Ricardo Soto; Natalia Berríos; Franklin Johnson; Fernando Paredes; Carlos Castro; Enrique Norero

doi:10.1155/2015/578541

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

Broderick Crawford, Ricardo Soto, Natalia Berríos, Franklin Johnson, Fernando Paredes, Carlos Castro, Enrique Norero

SCHOOL OF COMPUTER ENGINEERING

Research output: Contribution to journal › Article › peer-review

41 Scopus citations

Abstract

The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.

Original language	English
Article number	578541
Journal	Mathematical Problems in Engineering
Volume	2015
DOIs	https://doi.org/10.1155/2015/578541
State	Published - 2015

Access to Document

10.1155/2015/578541

Cite this

@article{82adc6670bc6462ebff7d112d85b0bc2,

title = "A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem",

abstract = "The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.",

author = "Broderick Crawford and Ricardo Soto and Natalia Berr{\'i}os and Franklin Johnson and Fernando Paredes and Carlos Castro and Enrique Norero",

note = "Publisher Copyright: {\textcopyright} 2015 Broderick Crawford et al.",

year = "2015",

doi = "10.1155/2015/578541",

language = "English",

volume = "2015",

journal = "Mathematical Problems in Engineering",

issn = "1024-123X",

publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Berríos, Natalia

AU - Johnson, Franklin

AU - Paredes, Fernando

AU - Castro, Carlos

AU - Norero, Enrique

PY - 2015

Y1 - 2015

N2 - The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.

AB - The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.

UR - http://www.scopus.com/inward/record.url?scp=84937792291&partnerID=8YFLogxK

U2 - 10.1155/2015/578541

DO - 10.1155/2015/578541

M3 - Article

AN - SCOPUS:84937792291

SN - 1024-123X

VL - 2015

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

M1 - 578541

ER -

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this