Adaptive Black Hole Algorithm for Solving the Set Covering Problem

Algorithm 1

Black hole algorithm.

Require: Problem input data,

Ensure: The best solution that resolves the set covering problem

1: ()

2: Produce the first generation of stars

3: for all star   do

4:for all dimension   do

5:

6:end for

7:

8: end for

9:

10: Produce -generations of stars

11: while    do

12:

13:if    then

14:

15:for all dimension   do

16:

17:end for

18:end if

19:for all star   do

20:Calculate the event horizon through Eq. (5) and distance between the current solution with respect to the best solution

21:

22:

23:if    then

24:for all dimension   do

25:

26:end for

27:end if

28:end for

29:for all star   do

30:for all dimension   do

31:Generate new solutions through Eq. (4)

32:

33:In previous step, the value generated belongs to the real domain and it must be brought to a binary domain

34:

35:end for

36:end for

37: end while

38: return Postprocess results and visualization;