Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm

Table 7

Results of comparison for multiple and single colony ant algorithm.

Sample graph
	Average solution ()		Optimal solution (best)
	Multiple	Single	Multiple	Single
eil51	374.43	413.50	398.00	402.00
eil76	534.98	537.50	519.00	524.00
chn31	14012.02	14041.91	13870.86	13870.83
overil30	371.92	372.11	365.00	367.23
ulysses16	45.00	45.50	43.00	44.00
ulysses22	46.50	45.00	43.00	44.00
rand75	7390.14	7384.14	7326.04	7329.46
rand100	8248.18	8398.32	8166.56	8212.65
gr96	462.50	463.70	445.00	449.00
gr120	1678.90	1692.41	1631.00	1663.00
gr137	686.80	690.30	682.00	683.00
bayg29	8107.22	8597.52	8432.44	8439.00
beilin52	7702.51	7761.52	7442.58	7627.00
burma14	19.70	19.90	18.00	19.00
danzig42	647.16	656.39	640.65	642.92
st70	662.73	663.90	643.00	650.00
kroA150	27446.79	27611.06	27363.01	27471.08