Adaptive Black Hole Algorithm for Solving the Set Covering Problem

Algorithm 3

Heuristic feasibility operator.

1: The set of columns that cover row ,

2: The set of rows covered by column ,

3: The set of columns in a solution

4: The number of columns that cover row , . For this, ,  

5: The set of uncovered rows. For this,

6: for all row (in increasing order of ) do

7:Find the first column in increasing order of that minimizes

8:Add to and set

9:Set

10: end for

11: for all column (in decreasing order of ) do

12:if    then

13:

14:

15: end if

16: end for

17: return   is now a feasible solution for the set covering problem that contains no redundant columns;