Degree-Constrained -Minimum Spanning Tree Problem

Table 10

Numerical results obtained with VNS algorithms for the instances of Table 7 using .

#
	Best	Time (s)			Time (s)	#Iter				Time (s)	#Iter
Input graphs with random uniform costs
1	118.82	40.30	534.32	139.36	1330.83	47429	17.28	510.03	127.26	494.26	36291	7.10
2	283.63	64.73	762.97	338.44	2549.43	7665	19.32	775.47	298.83	1893.42	8481	5.35
3	703.42	2022.93	1088.49	850.68	1381.55	326	20.93	1000.36	750.05	3851.54	966	6.62
4	1334.61	7200	1349.38	1349.38	32.68	1	1.10	1349.38	1349.38	32.70	1	1.10
5	110.20	193.66	492.26	126.27	1376.58	52156	14.58	526.08	124.87	1015.61	63720	13.31
6	236.59	2316.85	783.62	306.03	1465.56	8242	29.35	677.53	257.46	3628.70	20296	8.82
7	522.61	259.07	1129.36	696.20	2587.27	664	33.21	1058.37	635.21	4130.04	1045	21.54
8	1459.53	7200	1485.59	1485.59	83.45	1	1.78	1485.59	1485.59	83.13	1	1.78
Input graphs with Euclidean distance costs
1	480.35	3600	1095.00	446.91	314.41	96332	−6.96	1076.54	440.38	74.39	31647	−8.32
2	1011.07	3600	1385.72	897.55	425.80	11551	−11.22	1447.17	890.15	195.38	8251	−11.95
3	1316.17	3600	1774.88	1304.78	786.14	8339	−0.86	1689.48	1303.48	570.31	5417	−0.96
4	2493.68	3600	2440.94	2440.94	7.94	1	−2.11	2440.94	2440.94	7.94	1	−2.11