By Topic

A new genetic algorithm with local search method for 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
$33 $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

2 Author(s)
Yong Zeng ; Fac. of Sci., Xidian Univ., Xi'an, China ; Yu-Ping Wang

A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the problem. To enhance the algorithm, two new genetic operators are specifically designed, which can avoid producing infeasible solutions. In addition, two novel local search operators are designed and combined into the algorithm to further improve the quality of solutions. As a result, the proposed evolutionary algorithm can efficiently explore the search space.

Published in:

Computational Intelligence and Multimedia Applications, 2003. ICCIMA 2003. Proceedings. Fifth International Conference on

Date of Conference:

27-30 Sept. 2003