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: | , , |
|---|---|
| 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 |