Fuzzy Degree-Constrained Minimum Spanning Tree problem

被引:0
|
作者
Lu, Yiwen [1 ]
机构
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
关键词
Degree-Constrained; Minimum Spanning Tree problem; fuzzy programming; tree-based; fuzzy simulation; genetic algorithm;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Degree-Constrained Minimum Spanning Tree problem is to find a minimum spanning tree of the given graph, subject to constraints on node degrees. The dc-MST problem is NP-complete. This paper investigates the dc-MST problem with fuzzy weights. According to different decision criteria, three models are proposed: expected dc-MST model, alpha-dc-MST model and the most dc-MST model. Finally, a hybrid intelligent algorithm approach with a tree-based genetic representation is designed to solve these models, and numerical examples are provided to illustrate its effectiveness.
引用
收藏
页码:578 / 584
页数:7
相关论文
共 50 条