An Artificial Fish Swarm Optimization Algorithm to Solve Set Covering Problem

Trends in Applied Knowledge-Based Systems and Data Science - Lecture Notes in Computer Science ◽

10.1007/978-3-319-42007-3_76 ◽

2016 ◽

pp. 892-903

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Eduardo Olguín ◽

Sebastián Mansilla Villablanca ◽

Álvaro Gómez Rubio ◽

...

Keyword(s):

Optimization Algorithm ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

Artificial Fish Swarm

Download Full-text

Solving Biobjective Set Covering Problem Using Binary Cat Swarm Optimization Algorithm

Computational Science and Its Applications – ICCSA 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-42085-1_17 ◽

2016 ◽

pp. 220-231 ◽

Cited By ~ 1

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Hugo Caballero ◽

Eduardo Olguín ◽

Sanjay Misra

Keyword(s):

Optimization Algorithm ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

Cat Swarm Optimization

Download Full-text

Solving the Set Covering Problem Using Cat Swarm Optimization Algorithm with a Variable Mixture Rate and Population Restart

Applied Computational Intelligence and Mathematical Methods - Advances in Intelligent Systems and Computing ◽

10.1007/978-3-319-67621-0_14 ◽

2017 ◽

pp. 156-166

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Hugo Caballero

Keyword(s):

Optimization Algorithm ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

Cat Swarm Optimization

Download Full-text

A Bi-Objetive Cat Swarm Optimization Algorithm for Set Covering Problem

Advances in Intelligent Systems and Computing - Artificial Intelligence Perspectives in Intelligent Systems ◽

10.1007/978-3-319-33625-1_44 ◽

2016 ◽

pp. 491-500

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Hugo Caballero ◽

Eduardo Olguín

Keyword(s):

Optimization Algorithm ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

Cat Swarm Optimization

Download Full-text

A new approach for solving set covering problem using jumping particle swarm optimization method

Natural Computing ◽

10.1007/s11047-015-9509-2 ◽

2015 ◽

Vol 15 (3) ◽

pp. 503-517 ◽

Cited By ~ 20

Author(s):

S. Balaji ◽

N. Revathi

Keyword(s):

Particle Swarm Optimization ◽

Particle Swarm ◽

Optimization Method ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

New Approach ◽

Particle Swarm Optimization Method

Download Full-text

Using a Social Media Inspired Optimization Algorithm to Solve the Set Covering Problem

Social Computing and Social Media. Design, Human Behavior and Analytics - Lecture Notes in Computer Science ◽

10.1007/978-3-030-21902-4_4 ◽

2019 ◽

pp. 43-52

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Guillermo Cabrera ◽

Agustín Salas-Fernández ◽

Fernando Paredes

Keyword(s):

Social Media ◽

Optimization Algorithm ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem

Download Full-text

Binary cat swarm optimization for the set covering problem

2015 10th Iberian Conference on Information Systems and Technologies (CISTI) ◽

10.1109/cisti.2015.7170365 ◽

2015 ◽

Cited By ~ 4

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Natalia Berrios ◽

Franklin Johnson ◽

Fernando Paredes

Keyword(s):

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

Cat Swarm Optimization

Download Full-text

Finding Solutions of the Set Covering Problem with an Artificial Fish Swarm Algorithm Optimization

Computational Science and Its Applications – ICCSA 2016 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-42085-1_13 ◽

2016 ◽

pp. 166-181

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Eduardo Olguín ◽

Sanjay Misra ◽

Sebastián Mansilla Villablanca ◽

...

Keyword(s):

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Algorithm Optimization ◽

Artificial Fish Swarm Algorithm ◽

Artificial Fish Swarm ◽

Swarm Algorithm

Download Full-text

A Binary Invasive Weed Optimization Algorithm for the Set Covering Problem

Advances in Intelligent Systems and Computing - Artificial Intelligence Perspectives in Intelligent Systems ◽

10.1007/978-3-319-33625-1_41 ◽

2016 ◽

pp. 459-468 ◽

Cited By ~ 2

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Ismael Fuenzalida Legüe ◽

Eduardo Olguín

Keyword(s):

Optimization Algorithm ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Invasive Weed Optimization ◽

Invasive Weed

Download Full-text

A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem

Computational Science and Its Applications -- ICCSA 2015 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-21410-8_32 ◽

2015 ◽

pp. 411-420 ◽

Cited By ~ 6

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Claudio Torres-Rojas ◽

Cristian Peña ◽

Marco Riquelme-Leiva ◽

...

Keyword(s):

Optimization Algorithm ◽

Fruit Fly ◽

Set Covering ◽

Covering Problem ◽

Fruit Fly Optimization Algorithm ◽

Set Covering Problem ◽

Fruit Fly Optimization

Download Full-text

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

Mathematical Problems in Engineering ◽

10.1155/2015/578541 ◽

2015 ◽

Vol 2015 ◽

pp. 1-8 ◽

Cited By ~ 27

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Natalia Berríos ◽

Franklin Johnson ◽

Fernando Paredes ◽

...

Keyword(s):

Moving Objects ◽

Minimum Cost ◽

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Swarm Optimization ◽

Cat Swarm Optimization ◽

The Matrix ◽

Problem Instances ◽

Unicost Set Covering Problem

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.

Download Full-text