A weighting-based local search heuristic algorithm for the Set Covering Problem

2014 ◽  
Author(s):  
Chao Gao ◽  
Thomas Weise ◽  
Jinlong Li
Keyword(s):  
Local Search ◽  
Heuristic Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Search Heuristic ◽  
Local Search Heuristic

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

scholarly journals Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem

2020 ◽  
Vol 26 (2) ◽  
pp. 293-316
Author(s):  
Murilo Falleiros Lemos Schmitt ◽  
Mauro Mulati ◽  
Ademir Constantino ◽  
Fábio Hernandes ◽  
Tony Hild
Keyword(s):  
Local Search ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Ant Colony Optimization Algorithm ◽  
The Impact

This paper proposes an algorithm for the set covering problem based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Set, which uses a lineoriented approach and a novelty pheromone manipulation based on the connections between components of the construction graph, while also applying a local search. The algorithm is compared with other ACO-based approaches. The results obtained show the effectiveness of the algorithm and the impact of the pheromone manipulation.

Sign in / Sign up

Export Citation Format

Share Document