Binary Harmony Search Algorithm for Solving Set-Covering Problem

摘要

This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used.