A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem

The set covering problem seeks for minimum cost family of subsets from n given subsets, which together covers the complete set. In this article, we present multi dynamic binary black hole algorithm for resolving the set covering problem. This algorithm has the particularity to propose a generic dynamic binarization method to manage the exploration and exploitation properties. Furthermore we explore the implementation of the algorithm on Apache Spark distributed framework.