A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem

Proceedings - 5th International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2003

Volumn , Issue , 2003, Pages 218-222

  Zeng, Yong ^a   Wang, Yu Ping ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Algorithm design and analysis; Decoding; Encoding; Evolutionary computation; Genetic algorithms; Network topology; NP complete problem; Search methods; Space exploration; Tree graphs

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DECODING; ELECTRIC NETWORK TOPOLOGY; ENCODING (SYMBOLS); GENETIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); NETWORK ARCHITECTURE; SPACE RESEARCH; TOPOLOGY; TREES (MATHEMATICS);

ALGORITHM DESIGN AND ANALYSIS; NETWORK TOPOLOGY; SEARCH METHOD; SPACE EXPLORATIONS; TREE GRAPH;

EVOLUTIONARY ALGORITHMS;

EID: 33751383026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIMA.2003.1238128     Document Type: Conference Paper

References (4)

1. Zhou, G. Gen, M. "A Note on Genetic Algorithms for Degree-Constrained Spanning Tree Problems." Networks 30, 1997, 91-95.
2. Hsinghua Chou, G.Premkumar, and Chao-Hsien Chu. "Genetic Algorithms for Communications Network Design - An Empirical Study of the Factors that Influence Performance." IEEE Trans. on Evolutionary Computation.Vol.5, No.3, June 2001, 236-249.
3. Narula, S. C. and C. A. Ho, "Degree-constrained minimum spanning tree." Comput, Ops.Res.7, 1980, 239-249.
4. M. Gen and R. Cheng, "Genetic Algorithms & Engineering Design." New York: Wiley, 1997.