Article ID: | iaor20126024 |
Volume: | 12 |
Issue: | 3 |
Start Page Number: | 345 |
End Page Number: | 365 |
Publication Date: | Nov 2012 |
Journal: | Operational Research |
Authors: | Singh Alok, Sundar Shyam |
Keywords: | heuristics: local search |
In this paper, we present a hybrid approach combining an artificial bee colony (ABC) algorithm with a local search to solve the non‐unicost Set Covering Problem (SCP). Given a 0–1 matrix where each column is associated with a non‐negative cost. A 1 at the