Adaptive Black Hole Algorithm for Solving the Set Covering Problem

Table 10

Sampling phase: hardest instances for groups C, D, NRE, NRF, BRG, and NRH.

Hardest instances		Transfer functions	Discretization methods
ID	Optimum values		Standard	Complement	Static probability	Elitist
B.5	72		75	75	73	74
			73	74	75	72
			75	74	74	73
			75	73	72	74
			73	73	74	75
			74	72	72	74
			74	74	72	75
			75	74	72	75
C.5	215		217	215	216	216
			217	217	218	218
			216	216	218	217
			215	218	217	217
			216	216	218	217
			215	216	217	216
			216	217	215	216
			216	218	215	217
D.5	61		61	61	61	63
			62	61	63	64
			64	63	64	63
			64	61	63	62
			61	61	61	64
			63	62	64	64
			61	63	62	62
			62	63	62	62
NRE.5	28		30	29	31	30
			29	31	28	31
			31	28	30	28
			28	31	28	28
			30	31	31	29
			29	29	29	28
			29	30	28	28
			31	30	30	28
NRF.5	13		14	15	15	14
			15	16	14	14
			16	13	14	15
			14	16	14	15
			16	14	16	16
			15	16	15	14
			13	16	14	14
			13	14	15	13
NRG.5	168		170	171	169	171
			170	171	171	171
			169	168	168	169
			170	171	171	169
			168	169	171	169
			170	169	170	171
			170	171	171	168
			171	169	170	169
NRH.5	55		58	57	58	56
			56	58	58	55
			58	56	57	57
			57	57	55	57
			58	57	58	55
			55	55	56	57
			55	58	56	58
			56	56	56	56