By Topic

A new genetic algorithm for the degree-constrained minimum spanning tree problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li-Xia Han ; Fac. of Sci., Xidian Univ., Xi''an, China ; Yuping Wang ; Fu-Ying Guo

A novel genetic algorithm for the degree-constrained minimum spanning tree (d-MST) is proposed in this paper. In the proposed algorithm, a candidate solution is directly represented by set of the edges contained in the corresponding spanning tree, and a specific initialization scheme, a heuristic crossover and a mutation operator are designed, respectively. Moreover, both the crossover operator and the mutation operator are very easy to execute, and the offspring generated by them always represent feasible spanning trees. Furthermore, the global convergence of the proposed algorithm to globally optimal solution with probability one is proved. At last, the simulated results show the effectiveness of the proposed algorithm.

Published in:

VLSI Design and Video Technology, 2005. Proceedings of 2005 IEEE International Workshop on

Date of Conference:

28-30 May 2005