基于混合遗传算法求解CMST问题

Solving CMST Problem Based on Hybrid Genetic Algorithm

ＣＭＳＴ （Ｃｏｎｓｔｒａｉｎｅｄ Ｍｉｎｉｍ ｕｍ Ｓｐａｎｎｉｎｇ Ｔｒｅｅ）是通信网络拓扑结构设计中经常遇到的问题，一般解决此问题采用启发式方法，本文提出了使用混合遗传算法求解ＣＭＳＴ问题的新算法。

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.