Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem

2017 ◽  
Vol 256 (2) ◽  
pp. 349-367 ◽  
Author(s):  
Daniel Porumbel ◽  
Gilles Goncalves ◽  
Hamid Allaoui ◽  
Tienté Hsu
Keyword(s):  
Local Search ◽  
Column Generation ◽  
Iterated Local Search ◽  
Set Covering ◽  
Covering Problem ◽  
Arc Routing ◽  
Set Covering Problem

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.

A 3-flip neighborhood local search for the set covering problem

2006 ◽  
Vol 172 (2) ◽  
pp. 472-499 ◽  
Author(s):  
Mutsunori Yagiura ◽  
Masahiro Kishida ◽  
Toshihide Ibaraki
Keyword(s):  
Local Search ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem

A new approach using a Binary Firefly Algorithm for the Set Covering Problem

2014 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Miguel Olivares-Suárez ◽  
Fernando Paredes
Keyword(s):  
Firefly Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
New Approach
Sign in / Sign up

Export Citation Format

Share Document