| 用遗传算法求最小生成树 |
| |
| 引用本文： | 朱彦廷.用遗传算法求最小生成树[J].琼州学院学报,2012,19(2):32-35. |
| |
| 作者姓名： | 朱彦廷 |
| |
| 作者单位： | 广西现代职业技术学院计算机系,广西河池,547000 |
| |
| 摘 要： | 以图论和遗传算法为基础,给出一种基于节点编码的求最小生成树算法.该算法效率较高,而且比较简单,容易实现.传统算法一般只能得到一棵最小生成树,该算法能获得一批最小生成树或次小生成树,可以为决策提供更多选择.
|
| 关 键 词： | 最小生成树 遗传算法 节点编码 |
A Genetic Algorithm to Seek the Minimum Spanning Tree |
| |
| ZHU Yan-ting.A Genetic Algorithm to Seek the Minimum Spanning Tree[J].Journal of Qiongzhou University,2012,19(2):32-35. |
| |
| Authors: | ZHU Yan-ting |
| |
| Institution: | ZHU Yan-ting(Department of Computer Science,Guangxi Modern Polytechnic College,Hechi Guangxi 547000,China) |
| |
| Abstract: | Based on the graphic theory and genetic algorithm,an improved algorithm to encode node is introduced to search the minimum spanning tree.The algorithm is efficient and very simple and therefore easy to program.It can obtain a group of minimum or less spanning trees in order to provide more choices for decision making,while the traditional algorithms usually only get a minimum spanning tree. |
| |
| Keywords: | minimum spanning tree genetic algorithm node code |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
