New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem

Given a connected, weighted, undirected graph G=(V, E) and a bound d . The Degree-Constrained Minimum Spanning Tree problem (DCMST or d -MST) seeks the spanning tree with smallest weight in which no vertex have degree more than d . This problem is NP-hard with d ***2. This paper proposes a new Particle Swarm Optimization algorithm for solving the d -MST problem. The proposed algorithm uses some new methods for selecting vector of particles. Results of computational experiments are reported to show the efficiency of the algorithm.