Solving DCMST Problem with Ant Algorithm

In this paper we propose to use a new ant algorithm to solve the degree-constrained minimum spanning tree (DCMST) problem, which is a NP problem. The new ant algorithm is different from the general ant algorithm and it is very suitable to solve the DCMST problem. The ability of the algorithm is tested and given encouraging results. Finally, because the problem of clustering analysis and DCMST is very similar, so we put this new method into solving clustering analysis, and gain the interesting result.