By Topic

A Genetic Algorithm Approach on Capacitated 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

4 Author(s)
Gengui Zhou ; Coll. of Bus. & Adm., Zhejiang Univ. of Technol. ; Zhenyu Cao ; Jian Cao ; Zhiqing Meng

For the capacitated minimum spanning tree problem (CMST), there are still no effective algorithms to solve this problem up to now. In this paper, we present a completely new approach by using the genetic algorithms (GAs). For the adaptation to the evolutionary process, we developed a tree-based genetic representation to code the candidate solution of the CMST problem. Numerical analysis shows the effectiveness of the proposed GA approach on the CMST problem

Published in:

Computational Intelligence and Security, 2006 International Conference on  (Volume:1 )

Date of Conference:

Nov. 2006