Research Article

Degree-Constrained -Minimum Spanning Tree Problem

Table 11

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

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

Input graphs with random uniform costs
1501052.220.6193.6952.2254.7855760259.2652.2289.8920830
220134.081.61175.53135.7524.5825511.24955.85135.75126.1721111.24
330240.301.08370.28244.3126.0126481.66435.68245.24234.2544372.05
450564.370.47684.50584.185.535613.512486.65588.3148.698034.24
510025123.712.95163.55123.712.066701231.26123.71192.919950
650287.786.04337.69293.9029.209752.122546.91298.88339.6617313.85
775529.560.84650.54550.4146.0015333.933804.55563.89220.2811646.48
8100915.293.341093.20970.4350.6616996.025188.971021.63239.28123011.61
920050184.294.04279.89193.34168.4716264.912495.55198.36698.7110937.63
10100437.0830.84546.76467.7668.136577.014856.80492.90258.6340812.77
11150775.8918.53941.43836.899.54907.867444.72870.56273.5346012.20
122001285.326.431734.021480.7615.9115615.2010277.041614.61321.3052925.61

Input graphs with Euclidean distance costs
1Berlin5210279.230.512195.31279.23389.574209604581.09279.2321.443510
2201015.392.091270.761015.392.0120109757.741020.0272.2411890.45
3302065.122.232757.232065.1258.286258012888.362069.9032.445350.23
4526968.770.739738.247156.6517.7118952.6922432.487234.276.471063.80
5gr962573.56621.64112.7874.59144.6756471.40144.7274.807.65451.68
650168.53299.41219.39172.3897.1838112.28546.20180.29161.809846.97
775283.1496.28379.18292.2024.979663.19609.61302.6650.223026.89
896474.9517.58619.16497.0666.0225784.65944.82534.30320.22195612.49
9ch150501753.8336002050.391678.9338.58672−4.2718522.681722.83222.956131.76
10802881.7236003667.842843.87169.472972−1.3127659.442929.44141.143941.65
111003627.93279.884833.863788.2698.1817184.4135594.853773.76325.019084.01
121506368.7943.717566.166720.3142.557425.5152740.447005.90113.5031510.00