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

Authors:
Huynh Thi Binh;Truong Binh Nguyen
Affiliations:
Hanoi University of Technology, Ha Noi, Viet Nam;Hanoi University of Technology, Ha Noi, Viet Nam
Venue:
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Year:
2008

Citing 3
Cited 1

Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

Journal of Heuristics
An ant-based algorithm for finding degree-constrained minimum spanning tree

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A new evolutionary approach to the degree-constrained minimumspanning tree problem

IEEE Transactions on Evolutionary Computation

Degree constrained minimum spanning tree problem: a learning automata approach

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.