In order to solve the Minimum Spanning Tree(MST)problem, this paper provides a niche Genetic Algorithm(GA) importing Tabu search. The algorithm uses Pr fer number to encode these trees. Before selection and crossover, that the algorithm uses niche to keep the distance of selected trees is bigger than one threshold, so it can guarantee the multiformity of individuals. That mutation of GA uses Tabu search algorithm, can improve the local searching ability, and speed up the convergence for satisfactory results...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
