Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem

Table 4

Numerical results using group 2 instances.

Clustering type	Center		μ = 3		μ = 5		μ = 7		μ = 10		Overall
Heuristics	Gap (%)	Time (sec)	Gap (%)	Time (sec)	Gap (%)	Time (sec)	Gap (%)	Time (sec)	Gap (%)	Time (sec)	Avg. gap (%)	Avg. time (sec)
CPLEX_1	796.47	300.00	406.34	300.00	747.82	300.00	684.87	636.61	547.54	300.00	636.61	300.00
CPLEX_2	738.79	3600.00	406.34	3600.00	710.08	3600.00	622.84	576.00	401.97	3600.00	576.00	3571.97
C1	20.51	0.0027	14.41	0.1640	22.64	0.0028	27.60	24.23	36.19	0.0000	24.23	0.0033
RC2	7.06	0.0038	4.94	0.0104	8.47	0.0046	10.59	8.92	13.65	0.0018	8.92	0.0046
RC3	8.89	0.0051	6.53	0.0126	10.53	0.0052	12.07	10.50	14.53	0.0022	10.50	0.0057
RC4	17.67	0.0034	12.68	0.0092	18.69	0.0036	22.25	19.94	28.53	0.0008	19.94	0.0038
RC5	11.30	0.8094	8.08	3.6052	11.85	0.8861	14.79	13.35	18.62	0.1600	13.35	1.1653
GMSTP1	5.23	20.418	3.56	127.251	6.02	25.478	7.06	6.07	8.52	0.4677	6.07	37.499
GMSTP2	5.06	28.051	3.30	236.258	5.55	35.529	5.96	5.62	8.26	0.5968	5.62	63.360
GMSTP3	5.09	26.379	3.33	190.505	5.94	29.034	6.91	5.99	8.71	0.4374	5.99	51.820