Degree-Constrained -Minimum Spanning Tree Problem

Table 12

Numerical results obtained with ACO algorithms for random and Euclidean instances of Table 8 using .

#
	Best	Time (s)			Time (s)	#Iter				Time (s)	#Iter
Input graphs with random uniform costs
1	132.92	34.03	193.95	146.53	26.59	98	10.23	2228.39	158.67	1443.44	1091	19.37
2	321.64	309.74	419.46	367.16	43.30	165	14.15	4620.75	396.94	589.52	468	23.41
3	820.70	520.03	980.56	898.25	64.56	237	9.44	9596.31	923.88	918.36	703	12.57
4	1623.85	1301.40	2122.15	1933.14	128.82	495	19.04	14537.58	2107.74	1130.55	865	29.79
5	123.02	2003.07	172.02	136.33	98.30	210	10.81	2581.64	143.35	2080.93	917	16.52
6	265.68	3073.49	328.39	298.32	155.47	338	12.28	5243.13	316.62	1187.53	530	19.17
7	598.20	2448.10	754.03	683.36	6.10	13	14.23	10356.11	724.67	1247.05	563	21.14
8	1818.03	7200	2370.22	2224.40	5.61	11	22.35	20229.56	2631.20	1151.90	521	44.72
Input graphs with Euclidean distance costs
1	534.97	3600	426.30	401.87	113.06	632	−24.87	675.36	405.20	227.45	196	−24.25
2	1133.49	3600	990.04	846.67	96.56	539	−25.30	2944.45	919.30	3.48	3	−18.89
3	1417.20	3600	1554.94	1311.62	42.31	236	−7.44	2909.14	1358.90	312.40	270	−4.11
4	2991.96	3600	3477.83	2983.92	2.18	11	−0.26	6137.08	3239.96	292.15	255	8.28