An efficient local search heuristic with row weighting for the unicost set covering problem

2015 ◽  
Vol 246 (3) ◽  
pp. 750-761 ◽  
Author(s):  
Chao Gao ◽  
Xin Yao ◽  
Thomas Weise ◽  
Jinlong Li
Keyword(s):  
Local Search ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Search Heuristic ◽  
Local Search Heuristic ◽  
Unicost Set Covering Problem

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

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
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.

A GRASP algorithm to solve the unicost set covering problem

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

An iterated-tabu-search heuristic for a variant of the partial set covering problem

2014 ◽  
Vol 20 (2) ◽  
pp. 143-164 ◽  
Author(s):  
Nehme Bilal ◽  
Philippe Galinier ◽  
Francois Guibault
Keyword(s):  
Tabu Search ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Search Heuristic ◽  
Iterated Tabu Search

An improved configuration checking-based algorithm for the unicost set covering problem

2021 ◽  
Author(s):  
Yiyuan Wang ◽  
Shiwei Pan ◽  
Sameh Al-Shihabi ◽  
Junping Zhou ◽  
Nan Yang ◽  
...  
Keyword(s):  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Configuration Checking ◽  
Unicost Set Covering Problem
Sign in / Sign up

Export Citation Format

Share Document