Title :
A Genetic Algorithm Approach on Capacitated Minimum Spanning Tree Problem
Author :
Zhou, Gengui ; Cao, Zhenyu ; Cao, Jian ; Meng, Zhiqing
Author_Institution :
Coll. of Bus. & Adm., Zhejiang Univ. of Technol.
Abstract :
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
Keywords :
genetic algorithms; numerical analysis; trees (mathematics); capacitated minimum spanning tree problem; evolutionary process; genetic algorithm; numerical analysis; tree-based genetic representation; Ant colony optimization; Costs; Educational institutions; Genetic algorithms; Linear programming; Numerical analysis; Topology; Tree graphs; Wiring;
Conference_Titel :
Computational Intelligence and Security, 2006 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
1-4244-0605-6
Electronic_ISBN :
1-4244-0605-6
DOI :
10.1109/ICCIAS.2006.294124
