Solving the min-degree constrained minimum spanning tree problem using heuristic and metaheuristic approaches

摘要

The min-degree constrained minimum spanning tree (MDCMST) problem seeks a spanning tree with minimum total cost such that each non-leaf node in the tree has a degree of at least d in the tree. MDCMST problem is NP-Hard. In this paper we have proposed a new heuristic and a metaheuristic approach to this problem. The metaheuristic approach consists of a recently proposed swarm intelligence technique called artificial bee colony algorithm. The proposed approaches have been tested on Euclidean and random instances both. For small values of d, the heuristic and ABC approach perform quite similar. However, advantage of ABC approach becomes clearly visible for larger values of d.