基于Steiner树的模糊最短路径问题的研究  

Fuzzy Shortest Path for Steiner Tree Problem

作　　者：赵娜[1] 

机构地区：[1]太原师范学院城市与旅游学院,山西太原030012

出　　处：《洛阳理工学院学报（自然科学版）》2012年第1期82-85,共4页Journal of Luoyang Institute of Science and Technology：Natural Science Edition

基　　金：山西省软科学项目(2007041011-02)

摘　　要：在对模糊最短路径分析的基础上,提出了最短路径的改进方案。结合S teiner树的方法,用模糊数代替实数分配给每个边缘,使用了一种新的排序方法求解模糊最短路径。通过实例分析合理地得出问题的最优解,验证了这种方法的有效性。In this paper,a modification of the shortest path has been proposed based on the fuzzy shortest paths evaluations.In view of the Steiner tree problem,a fuzzy number substitutes the real number to be assigned to each edge.A new ranking method is also used to work out the fuzzy shortest path.The optimal solution has been acquired through case study and the effect of this method has been verified.

关 键 词：模糊排序 单一最短路径 STEINER树 

分 类 号：O159[理学—数学]