| 基于混合遗传算法求解CMST问题 |
| |
| 引用本文： | 曲润涛,韩兵,席裕庚. 基于混合遗传算法求解CMST问题[J]. 通信学报, 1999, 20(10): 31-35 |
| |
| 作者姓名： | 曲润涛 韩兵 席裕庚 |
| |
| 作者单位： | 上海交通大学电子信息学院,上海,200030 |
| |
| 摘 要： | ＣＭＳＴ （Ｃｏｎｓｔｒａｉｎｅｄ Ｍｉｎｉｍ ｕｍ Ｓｐａｎｎｉｎｇ Ｔｒｅｅ）是通信网络拓扑结构设计中经常遇到的问题，一般解决此问题采用启发式方法，本文提出了使用混合遗传算法求解ＣＭＳＴ问题的新算法。理论分析和仿真表明这种方法是有效的
|
| 关 键 词： | 有约束最小扩展树 遗传算法 启发式方法 |
Solving CMST Problem Based on Hybrid Genetic Algorithm |
| |
| Qu Runtao,Han Bing,Xi Yugeng. Solving CMST Problem Based on Hybrid Genetic Algorithm[J]. Journal on Communications, 1999, 20(10): 31-35 |
| |
| Authors: | Qu Runtao Han Bing Xi Yugeng |
| |
| Abstract: | Constrained Minimum Spanning Tree (CMST)problem can often be met in topological design of communication networks.It is usually solved by heuristic methods.In this paper a hybrid genetic algorithm was proposed to deal with it.Theoretical analysis and simulation results show the effectiveness of the given algorithm. |
| |
| Keywords: | constrained minimum spanning tree genetic algorithm heuristic method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
