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

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

Volumn , Issue , 2005, Pages 31-34

  Han, Li Xia ^a   Wang, Yuping ^a   Guo, Fu Ying ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

DEGREE-CONSTRAINED MINIMUM SPANNING TREE (D-MST); GENOTYPES; MUTATION OPERATORS; RANDOM DIJKSTRA'S ALGORITHM;

GENETIC ALGORITHMS;

EID: 23844533006     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem", in Proc. Amer. Math. Soc.,vol. 7, pp. 48-50, 1956.
2. E. W. Dijkstra, "A note on two problems in connection with graphs", Numerische math., vol. 1, pp. 269-271, 1959.
3. G. Zhou and M. Gen, "Genetic algorithm on leaf-constrained Minimum spanning tree problem", Beijing Math., vol. 7, no. 2, pp. 50-62, 1998.
4. H. Chou, G. Premkumar and C. H. Chu, "Genetic algorithms for communications network design-An empirical study of the factors that influence performance", IEEE Transaction on Evolutionary Computation, vol. 5, pp. 236-249, June 2001.
5. J.Knowles and D.Corne, "A new evolutionary approach to The degree constrained minimum spanning tree problem", IEEE Transaction on Evolutionary Computation, vol.4, pp. 125-134, Apr. 2000.
6. Günther R. Raidl and Bryant A. Julstrom, "Edge Sets: an Effective evolutionary coding of spanning trees", IEEE Trans. Evolutionary Computation, vol. 7, no. 3, pp. 225-239, 2003.
7. Thomas Back, "Evolutionary algorithms in theory and Practice", New York: Oxford University Press, 1998