Degree-Constrained -Minimum Spanning Tree Problem

Table 14

Numerical results obtained with Q-learning algorithm for the random and Euclidean instances of Table 8 using d = 2.

#
	Best	Time (s)			Time (s)	#Iter
Input graphs with random uniform costs
1	132.92	34.03	2455.40	147.03	116.82	72924	10.61
2	321.64	309.74	5203.22	347.51	101.90	63021	8.04
3	820.70	520.03	10356.83	897.52	160.04	99831	9.36
4	1623.85	1301.40	15547.51	1990.10	441.38	263922	22.55
5	123.02	2003.07	2173.05	137.42	155.63	64597	11.70
6	265.68	3073.49	5346.13	307.22	442.60	183130	15.63
7	598.20	2448.10	10535.56	691.97	286.76	115717	15.67
8	1818.03	7200	20088.17	2287.40	305.80	126631	25.81
Input graphs with Euclidean distance costs
1	534.97	3600	6193.93	426.46	170.69	119614	−20.28
2	1133.49	3600	11619.78	909.03	82.05	57482	−19.80
3	1417.20	3600	18065.40	1441.78	275.34	192437	1.73
4	2991.96	3600	33966.22	2800.73	130.98	91758	−6.39