In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
以寻找最短的加权送电路径为优化目标，将网络重构建模为一个寻找图的局部最小树问题，并计及各种约束。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
应用推荐