Applications of Genetic Algorithm to Degree-Constrained Minimum Spanning Tree
Gong Jing · Journal of Hunan Environment-biological Polytechnic · 2009
Genetic Algorithm(GA) is a heuristic randomized search algorithm,which roots in biology population's evolutionary rules: natural selection,the better wins and the worse fails.It is characterized by generality and robustness,is widely applied to communication design domain such as degree-constrained minimum spanning tree.This paper discusses the application of GA in degree-constrained minimum spanning tree and sets forth challenges when applying GA.17refs.