Solving the Set Covering Problem with a Binary Black Hole Inspired Algorithm
There are multiple problems in several industries that can be solved with combinatorial optimization. In this sense, the Set Covering Problem is one of the most representative of them, being used in various branches of engineering and science, allowing find a set of solutions that meet the needs identified in the restrictions that have the lowest possible cost. This paper presents an algorithm inspired by binary black holes (BBH) to resolve known instances of SPC from the OR Library. Also, it reproduces the behavior of black holes, using various operators to bring good solutions.
ICCSA