计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (11): 20-22.
• 博士论坛 • 上一篇 下一篇
来卫国 李鸥
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
WeiGuo Lai Ou Li
Received:
Revised:
Online:
Published:
Contact:
摘要： 本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树（D-MDST）问题，并给出了求解该问题的BCT算法。该文作者提出了一种新的生成树编码方法——过程控制编码。该编码将启发式算法与遗传算法结合起来且具有编码简单、译码方便、适用常规遗传算子等优点。作者给出了基于该种编码的遗传算法，并将BCT算法作为过程控制编码的译码器。仿真结果表明了该遗传算法的有效性。
关键词: 生成树, 最小直径, 遗传算法, 过程控制
Abstract: The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree (D-MDST) problem. The authors propose a novel spanning tree coding method based on procedure controlling. This coding method provides a new way to combine heuristic algorithms and genetic algorithms. A genetic algorithm for D-MDST problem based on this code is given , which uses BCT algorithm as decoder. Simulation results show its efficiency.
Key words: spanning tree, minimum diameter, genetic algorithm, procedure controlling
来卫国 李鸥. MSN网络的优化问题研究[J]. 计算机工程与应用, 2007, 43(11): 20-22.
WeiGuo Lai Ou Li. A Study on Optimization of MSN Networks[J]. Computer Engineering and Applications, 2007, 43(11): 20-22.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I11/20
