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

Broderick Crawford; Ricardo Soto; Natalia Berrios; Eduardo Olguín

doi:10.1007/978-3-319-33625-1_46

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

Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguín

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016
Editors	Radek Silhavy, Roman Senkerik, Zuzana Kominkova Oplatkova, Petr Silhavy, Zdenka Prokopova
Publisher	Springer Verlag
Pages	511-524
Number of pages	14
ISBN (Print)	9783319336237
DOIs	https://doi.org/10.1007/978-3-319-33625-1_46
State	Published - 2016
Event	5th Computer Science On-line Conference, CSOC 2016 - Prague, Czech Republic Duration: 27 Apr 2016 → 30 Apr 2016

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	464
ISSN (Print)	2194-5357

Conference

Conference	5th Computer Science On-line Conference, CSOC 2016
Country/Territory	Czech Republic
City	Prague
Period	27/04/16 → 30/04/16

Keywords

Binary Cat SwarmOptimization
Metaheuristic
Set covering problem

Access to Document

10.1007/978-3-319-33625-1_46

Cite this

Crawford, B., Soto, R., Berrios, N., & Olguín, E. (2016). Cat swarm optimization with different binarization methods for solving set covering problems. In R. Silhavy, R. Senkerik, Z. K. Oplatkova, P. Silhavy, & Z. Prokopova (Eds.), Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016 (pp. 511-524). (Advances in Intelligent Systems and Computing; Vol. 464). Springer Verlag. https://doi.org/10.1007/978-3-319-33625-1_46

Crawford, Broderick ; Soto, Ricardo ; Berrios, Natalia et al. / Cat swarm optimization with different binarization methods for solving set covering problems. Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. editor / Radek Silhavy ; Roman Senkerik ; Zuzana Kominkova Oplatkova ; Petr Silhavy ; Zdenka Prokopova. Springer Verlag, 2016. pp. 511-524 (Advances in Intelligent Systems and Computing).

@inproceedings{f444d4eb9ff34be2a0ff48b073337300,

title = "Cat swarm optimization with different binarization methods for solving set covering problems",

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.",

keywords = "Binary Cat SwarmOptimization, Metaheuristic, Set covering problem",

author = "Broderick Crawford and Ricardo Soto and Natalia Berrios and Eduardo Olgu{\'i}n",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 5th Computer Science On-line Conference, CSOC 2016 ; Conference date: 27-04-2016 Through 30-04-2016",

year = "2016",

doi = "10.1007/978-3-319-33625-1_46",

language = "English",

isbn = "9783319336237",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "511--524",

editor = "Radek Silhavy and Roman Senkerik and Oplatkova, {Zuzana Kominkova} and Petr Silhavy and Zdenka Prokopova",

booktitle = "Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016",

}

Crawford, B , Soto, R, Berrios, N & Olguín, E 2016, Cat swarm optimization with different binarization methods for solving set covering problems. in R Silhavy, R Senkerik, ZK Oplatkova, P Silhavy & Z Prokopova (eds), Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. Advances in Intelligent Systems and Computing, vol. 464, Springer Verlag, pp. 511-524, 5th Computer Science On-line Conference, CSOC 2016, Prague, Czech Republic, 27/04/16. https://doi.org/10.1007/978-3-319-33625-1_46

Cat swarm optimization with different binarization methods for solving set covering problems. / Crawford, Broderick ; Soto, Ricardo; Berrios, Natalia et al.
Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. ed. / Radek Silhavy; Roman Senkerik; Zuzana Kominkova Oplatkova; Petr Silhavy; Zdenka Prokopova. Springer Verlag, 2016. p. 511-524 (Advances in Intelligent Systems and Computing; Vol. 464).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Crawford, Broderick

AU - Soto, Ricardo

AU - Berrios, Natalia

AU - Olguín, Eduardo

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Binary Cat SwarmOptimization

KW - Metaheuristic

KW - Set covering problem

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

U2 - 10.1007/978-3-319-33625-1_46

DO - 10.1007/978-3-319-33625-1_46

M3 - Conference contribution

AN - SCOPUS:84964743319

SN - 9783319336237

T3 - Advances in Intelligent Systems and Computing

SP - 511

EP - 524

BT - Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016

A2 - Silhavy, Radek

A2 - Senkerik, Roman

A2 - Oplatkova, Zuzana Kominkova

A2 - Silhavy, Petr

A2 - Prokopova, Zdenka

PB - Springer Verlag

T2 - 5th Computer Science On-line Conference, CSOC 2016

Y2 - 27 April 2016 through 30 April 2016

ER -

Crawford B , Soto R, Berrios N, Olguín E. Cat swarm optimization with different binarization methods for solving set covering problems. In Silhavy R, Senkerik R, Oplatkova ZK, Silhavy P, Prokopova Z, editors, Artificial Intelligence Perspectives in Intelligent Systems - Proceedings of 5th Computer Science On-line Conference, CSOC 2016. Springer Verlag. 2016. p. 511-524. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-319-33625-1_46

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this