An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
<span>The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the quality of the results provided by thes...
Main Authors: | Alexandre Silvestre FERREIRA, Aurora POZO, Richard Aderbal GONÇALVES |
---|---|
Format: | Article |
Language: | English |
Published: |
Ediciones Universidad de Salamanca
2015-12-01
|
Series: | Advances in Distributed Computing and Artificial Intelligence Journal |
Subjects: | |
Online Access: | https://revistas.usal.es/index.php/2255-2863/article/view/13172 |
Similar Items
-
Ant Colony Hyper-heuristics for Travelling Salesman Problem
by: Abd Aziz, Z
Published: (2015) -
Ant Colony Hyper-heuristics for Travelling Salesman Problem
by: Aziz, Z.A, et al.
Published: (2015) -
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem
by: Murilo Falleiros Lemos Schmitt, et al.
Published: (2020-02-01) -
A Hyper-Heuristic for the Orienteering Problem With Hotel Selection
by: Alan Toledo, et al.
Published: (2020-01-01) -
A Novel Heuristic Communication Heterogeneous Dual Population Ant Colony Optimization Algorithm
by: Mingle Xu, et al.
Published: (2017-01-01)