scholarly journals Local Search Algorithm for Unicost Set Covering Problem

Author(s):  
Nysret Musliu
2019 ◽  
Vol 19 (4) ◽  
pp. 825-841 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Rodrigo Olivares ◽  
Gabriel Embry ◽  
Diego Flores ◽  
...  

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Natalia Berríos ◽  
Franklin Johnson ◽  
Fernando Paredes ◽  
...  

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.


2007 ◽  
Vol 34 (10) ◽  
pp. 3162-3173 ◽  
Author(s):  
Joaquín Bautista ◽  
Jordi Pereira

Sign in / Sign up

Export Citation Format

Share Document