Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem

Table 3

Details of the 65 test instances.

Instance set	Number of instances	𝑚	𝑛	Cost range	Density (%)	Optimal solution
4	10	200	1000	[1,100]	2	Known
5	10	200	2000	[1,100]	2	Known
6	5	200	1000	[1,100]	5	Known
A	5	300	3000	[1,100]	2	Known
B	5	300	3000	[1,100]	5	Known
C	5	400	4000	[1,100]	2	Known
D	5	400	4000	[1,100]	5	Known
NRE	5	500	5000	[1,100]	10	Unknown
NRF	5	500	5000	[1,100]	20	Unknown
NRG	5	1000	10000	[1,100]	2	Unknown
NRH	5	1000	10000	[1,100]	5	Unknown