A Reactive Tabu Search algorithm with variable clustering for the Unicost Set Covering Problem

2007 ◽  
Vol 2 (2) ◽  
pp. 156 ◽  
Author(s):  
Gary W. Kinney ◽  
J. Wesley Barnes ◽  
Bruce W. Colletti
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Tabu Search Algorithm ◽  
Reactive Tabu Search ◽  
Variable Clustering ◽  
Unicost Set Covering Problem

A binary monkey search algorithm variation for solving the set covering problem

2019 ◽  
Vol 19 (4) ◽  
pp. 825-841 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Rodrigo Olivares ◽  
Gabriel Embry ◽  
Diego Flores ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Monkey Search

Optimised placement of control and protective devices in electric distribution systems through reactive tabu search algorithm

2008 ◽  
Vol 78 (3) ◽  
pp. 372-381 ◽  
Author(s):  
Luis G. Wesz da Silva ◽  
Rodrigo A. Fernandes Pereira ◽  
Juan Rivier Abbad ◽  
José R. Sanches Mantovani
Keyword(s):  
Tabu Search ◽  
Distribution Systems ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Protective Devices ◽  
Reactive Tabu Search ◽  
Electric Distribution

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.

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
Sign in / Sign up

Export Citation Format

Share Document