By Topic

The generalized approaches of genetic algorithms on constrained minimum spanning tree problems

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

4 Author(s)
Gengui Zhou ; Coll. of Bus. Adm., Zhejiang Univ. of Technol., Hangzhou, China ; Yihua Zhu ; Xiaobin Weng ; Feng Ye

This paper explores the generalization of problem-solving by genetic algorithms (GAs) for a class of constrained minimum spanning tree (MST) problems. These constrained MST problems are quite different from each other in constraints and usually NP-hard but of high practical importance. The paper emphasizes that it is possible for GAs to generalize the problem-solving as long as the problems at hand can be generalized in data structure of solutions. The proposed method adopts only one solution encoding and one algorithm to deal with three constrained MST problems. Numerical experiments show that the proposed GAs approach can respectively compete with the existing heuristic algorithms on these constrained MST problems.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:3 )

Date of Conference:

15-19 June 2004