具模糊權數網路之最小生成樹可能性分配

The Possibility Distribution of Minimum Spanning Tree in a Network with Fuzzy Arc Weights

本文在探討當聯結權數為模糊數時，如何求解網路最小生成樹的可能性分配。首先，指出可利用Zadeh的擴充原則將問題轉成最小生成樹參數分析問題。接著，分別以最小生成樹問題之路徑最佳化條件與割集最佳化條件為基礎，提出兩個求解最小生成樹參數分析的方法。

In this paper, we consider the problem of finding the possibility distribution of minimum spanning tree in a network with fuzzy arc weights. At first, it is shown that this problem can be transformed into a parametric minimum spanning tree problem, using Zadeh's extension principle. Then, two algorithms, based on the path optimality and cut optimality respectively, are proposed to solve the parametric analysis problem.