Research Article

Degree-Constrained -Minimum Spanning Tree Problem

Table 9

Numerical results obtained with VNS algorithms for random and Euclidean instances using .

#
BestTime (s)Time (s)#IterTime (s)#Iter

Input graphs with random uniform costs
1501046.860.80254.7648.276.06138423.00208.7346.860.6216200
220113.970.73266.68118.5322.8072134.00353.48116.078.2927961.84
330204.351.67338.03206.3546.5136740.97326.75205.4330.4925030.52
450459.091.00463.14463.140.0810.88463.14463.140.0810.88
510025115.441.79352.14115.44115.10238260413.40118.7718.5988542.88
650263.956.43564.30269.1861.8929621.98517.86265.4286.4173820.55
775454.445.04600.65465.48197.6126812.42659.23456.59215.4640980.47
8100749.7522.56749.87749.870.2510.01749.87749.870.2410.01
920050162.5510.39555.42179.981857.836364010.72463.99169.38477.84187284.20
10100378.43506.06725.35395.982928.53123244.63763.28386.121657.5291942.03
11150652.861663.29883.28721.071250.9191210.44926.60670.361130.828722.68
122001049.25505.271056.341056.343.9810.671056.341056.343.9010.67

Input graphs with Euclidean distance costs
1Berlin5210274.460.821976.48274.461.41595901645.70274.460.094700
220926.772.153923.04926.772.69738203161.01926.770.368200
3301935.712.314961.302104.325.2951338.714484.232071.97178.341930487.03
4526081.6326081.636081.630.01106081.636081.630.0010
5gr962572.40268.87204.0079.28122.542303369.50247.0774.14271.895085832.40
650162.80250.78307.92179.5074.783409410.25260.74163.702.7411630.55
775267.57109.28388.13269.8820.9730490.86372.46267.57141.16211760
896436.2342.30436.23436.230.0210436.23436.230.0110
9ch150501567.77921.273441.771716.09348.671547349.463290.911696.0637.20161078.18
10802657.2136004327.972792.69115.65138895.094480.372771.08223.80216754.28
111003399.171009.764722.643527.70408.36153663.784745.733499.01288.25138582.93
121505882.45212.275882.455882.450.12105882.455882.450.1210