Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic

Table 3

Comparison of each algorithm on instances with 2000 variables.

Instance	Characteristics					CPLEX	GRASP	EA/G			DLSWCC
	Var	Cnst	Density (%)	M_one	Weight	Opt	Best	Best	Avrg	ATET	Best	Avrg	ATET	Hit
pb2000rand1	2000	10000	2.54	100	[1-20]	40	Yes	40	40.00	31.66	40	40.00	2115.64	16
pb2000rand2	2000	10000	2.55	100	[1-1]	2	Yes	2	2.00	10.38	2	2.00	2126.56	16
pb2000rand3	2000	10000	0.55	20	[1-20]	478	No	478	463.75	129.86	478	477.06	238.61	11
pb2000rand4	2000	10000	0.55	20	[1-1]	32	Yes	32	30.25	81.58	32	31.88	278.09	16
pb2000rand5	2000	2000	2.55	100	[1-20]	140	Yes	140	135.50	61.03	140	140.00	1419.60	16
pb2000rand6	2000	2000	2.56	100	[1-1]	9	Yes	9	8.50	34.23	9	9.00	1395.76	16
pb2000rand7	2000	2000	0.56	20	[1-20]	1784	No	1784	1765.94	160.14	1811	1810.88	28.13	15
pb2000rand8	2000	2000	0.56	20	[1-1]	131	No	131	130.38	73.84	135	134.13	23.19	2
Avrg						327.00		327.00	322.04	72.84	330.88	330.62	953.20	13.50