Two Neighbourhood-based Approaches for the Set Covering Problem
The Set Covering Problem is a well-known NP-complete problem which we address in this work. Due to its combinatorial nature heuristic methods, namely neighbourhood-based meta-heuristics, were used. Based on the well-known algorithms GRASP, Simulated Annealing and Variable Neighbourhood Descend, alon...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidade do Porto
2019-02-01
|
| Series: | U.Porto Journal of Engineering |
| Subjects: | |
| Online Access: | https://journalengineering.fe.up.pt/article/view/151 |