摘要
在对遗传算法、最小生成树和最小steiner生成树的概念作简单介绍之后,给出了一种改进后的求解最小steiner生成树问题的遗传算法。通过实例通信网络构建的仿真实验,说明改进后的算法能够更好地收敛到局部近似最优解,并分析了算法的优缺点。
After introducing the concept of genetic algorithm , minimum spanning tree and minimum Steiner spanning tree briefly, we describe the application of genetic algorithm in the problem of minimum Steiner spanning tree and give one improved method.And then, improved method can attain the better local approximate root through solving an emulated experimentation on a communication network.
出处
《安庆师范学院学报(自然科学版)》
2016年第2期30-32,共3页
Journal of Anqing Teachers College(Natural Science Edition)