摘要
针对边权值为梯形模糊数的模糊权值网络,提出一种求解该网络最小生成树问题的新算法.该算法首先基于梯形模糊结构元加权排序思想,将梯形模糊数转化为其加权特征数进行排序;然后利用经典的Dijkstra算法求解转化为边权值确定的网络的最小生成树问题,即得该模糊权值网络的最小生成树;最后对算法的复杂度进行分析,并通过算例验证了算法的有效性.
According to the fuzzy weighted network based trapezoidal fuzzy number,a new algorithm is proposed for the minimum spanning tree problem in this fuzzy weighted network.Based on the idea of weighted ranking of the fuzzy structured element,the trapezoidal fuzzy number is sorted by converting it to its weighted characteristic number.In addition,the minimum spanning tree of the precise weighted network which edge weight is the weighted characteristic number is obtained by adopting the classical Dijkstra algo-rithm.The algorithm complexity analysis is presented and its effectiveness is illustrated by a numerical example.
出处
《内蒙古师范大学学报（自然科学汉文版）》
CAS
北大核心
2015年第4期435-438,共4页
Journal of Inner Mongolia Normal University(Natural Science Edition)
基金
陕西省自然科学基础研究计划资助项目(2013JM1001)
关键词
模糊权值网络
梯形模糊结构元
加权特征数
DIJKSTRA
算法
最小生成树
fuzzy weighted network
trapezoidal fuzzy structured element
weighted characteristic number
Dijkstra algorithm
minimum spanning tree
