Fuzzy random degree-constrained minimum spanning tree problem

被引:1
|
作者
Liu, Wei [1 ]
Yang, Chengjing [1 ]
机构
[1] Chengdu Sports Univ, Chengdu, Peoples R China
关键词
minimum spanning tree problem; fuzzy random programming; fuzzy random simulation; genetic algorithm;
D O I
10.1142/S0218488507004649
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The degree-constrained minimum spanning tree problem (dc-MST) is to find a minimum spanning tree of the given graph, subject to constraints on node degrees. This paper investigates the dc-MST problem with fuzzy random weights. Three concepts are presented: expected fuzzy random dc-MST, (alpha, beta)-dc-MST and the most chance dc-MST according to different optimization requirement. Correspondingly, by using the concepts as decision criteria, three fuzzy random programming models for dc-MST are given. Finally, a hybrid intelligent algorithm is designed to solve these models, and some numerical examples are provided to illustrate its effectiveness.
引用
收藏
页码:107 / 115
页数:9
相关论文
共 50 条