:::

詳目顯示

回上一頁
題名:以期望值模式求解可能性最小生成樹問題
書刊名:管理資訊計算
作者:林高正 引用關係曾文宏鄧凱年許惠馨
作者(外文):Lin, Kao-chengTseng, Wen-hungDeng, Kai-nianHsu, Hui-hsin
出版日期:2019
卷期:8:特刊2
頁次:頁37-50
主題關鍵詞:模糊聯結權數最小生成樹最佳化條件模糊均值參數分析Fuzzy arc weightsMinimum spanning treeOptimal conditionsMean valuesParametric analysis
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:1
  • 點閱點閱:5
當聯結權數為模糊數時,網路生成樹的總權數亦為模糊數。由於網路生成樹的數量眾多,如何選取生成樹成為有趣的問題。本文,以可能性理論為基礎,首先提出在選取比序函數時應考慮的基本與重要準則。接著,指出當所採用的比序函數具有可加性時,可用比序函數對聯結權數解模糊,將問題轉成傳統的最小生成樹問題。具體而言,建議採用機率性均值或可能性均值之上下限的加權平均做為比序函數,其中的加權權數可用以代表決策者之特性。最後,則討論如何同時求解各種加權權數所對應之最小生成樹的問題。
When the arc weights are fuzzy numbers, the total weight of a spanning tree is also a fuzzy number. Since the number of spanning trees in a network is usually very large, how to select a spanning tree is an interesting problem. In this paper, based on the possibility theory, some rules and criteria for choosing a ranking function for this problem are proposed at first. Then, it is pointed out that if the ranking function is additive, then the problem can be transformed into the classical problem by defuzzifying the arc weights using the ranking function. In particular, weighted averages of the upper bound and the lower bound of the probabilistic mean value or the possibilistic mean value are suggested, in which the weight can be used to represent the characteristic of the decision maker. Finally, we consider the problem of finding the optimal spanning trees for all kinds of decision makers at the same time.
期刊論文
1.Dubois, D.、Prade, H.(1989)。Fuzzy Sets, Probability and Measurement。European Journal of operational Research,40(2),135-154。  new window
2.Bazlamacci, C. F.、Hindi, K. S.(2001)。Minimum-weight spanning tree algorithms: A survey and empirical study。Computers and Operations Research,28(8),767-785。  new window
3.Chang, P.-T.、Lee, E.-S.(1999)。Fuzzy decision networks and deconvolution。Computers and mathematics with Applications,37(11/12),53-63。  new window
4.Hsu, L.-H.、Jan, R.-H.、Lee, Y.-C.、Hung, C. N.、Chem, M.-S.(1991)。Finding the most vital edge with respect to minimum spanning tree in weighted graphs。Information Processing Letters,39(5),277-281。  new window
5.Iwano, K.、Katoh, N.(1993)。Efficient algorithms for finding the most vital edge of a minimum spanning tree。Information Processing Letters,48(5),211-213。  new window
6.Kruskal, J. B. Jr.(1956)。On the shortest spanning subtree of a graph and traveling salesman problem。Proceedings of AMS,7,45-50。  new window
7.Liu, B.(1998)。Minimax chance constrained programming models for fuzzy decision systems。Information Sciences,112(1),25-38。  new window
8.Liu, B.、Iwamura, K.(1998)。Chance constrained programming with fuzzy parameters。Fuzzy Sets and Systems,94(2),227-237。  new window
9.Pettie, S.、Ramachandran, V.(2002)。An optimal minimum spanning tree algorithm。Journal of the Association for Computing Machinery,49(1),16-34。  new window
10.Bertsimas, D.(1990)。The probabilistic minimum spanning tree problem。Networks,20(3),245-275。  new window
11.Dubois, D.、Prade, H.(1992)。When upper probabilities are possibility measures。Fuzzy Sets and Systems,49(1),65-74。  new window
12.Haymond, R. E.、Jarvis, J. P.、Shier, D. R.(1984)。Computational methods for minimum spanning tree algorithms。SIAM Journal on Scientific and Statistical Computing,5(1),157-174。  new window
13.Frieze, A. M.(1985)。On the value of a random minimum spanning tree problem。Discrete Applied Mathematics,10(1),47-56。  new window
14.Liang, W.(2001)。Finding the k most vital edges with respect to minimum spanning trees for fixed k。Discrete Applied Mathematics,113(2/3),319-327。  new window
15.Kulkarni, V. G.(1988)。Minimum spanning trees in undirected networks with exponentially distributed arc weights。Networks,18(2),111-124。  new window
16.Steele, J. M.(1987)。Growth rates on Frieze's z(3) limit for lengths of minimal spanning trees。Discrete Applied Mathematics,18(1),99-103。  new window
17.Prim, R. C.(1957)。Shortest connection networks and some generalizations。Bell System Technical Journal,36(6),1389-1401。  new window
18.林高正、曾文宏、邱清爐、許惠馨(20170800)。以機遇限制規劃模式求解可能性最小生成樹問題。管理資訊計算,6(特刊2),82-95。new window  延伸查詢new window
19.Adamo, J. M.(1980)。Fuzzy decision trees。Fuzzy Sets and Systems,4(3),207-219。  new window
20.Carlsson, C.、Fuller, R.(2001)。On Possibilistic Mean Value and Variance of Fuzzy Numbers。Fuzzy Sets and Systems,122(2),315-326。  new window
21.Dubois, Didier、Prade, Henri(1978)。Operations on fuzzy numbers。International Journal of Systems Science,9(6),613-626。  new window
22.Dubois, D.、Prade, H.(1987)。The Mean Value of a Fuzzy Number。Fuzzy Sets and Systems,24(3),279-300。  new window
23.Dubois, D.、Prade, H.(1997)。The Three Semantics of Fuzzy Sets。Fuzzy Sets and Systems,90(2),141-150。  new window
24.Fredman, Michael L.、Tarjan, Robert Endre(1987)。Fibonacci heaps and their uses in improved network optimization algorithms。Journal of the Association for Computing Machinery,34(3),596-615。  new window
25.Lin, Kao-Chêng、Chern, Maw-Sheng(1993)。The fuzzy shortest path problem and its most vital arcs。Fuzzy Sets and Systems,58(3),343-353。  new window
26.Lin, Kao-Chêng、Chern, Maw-Sheng(1993)。The most vital edges in the minimum spanning tree problem。Information Processing Letters,45(1),25-31。  new window
27.Wang, Xuzhu、Kerre, Etienne E.(2001)。Reasonable Properties for the Ordering of Fuzzy Quantities。Fuzzy Sets and Systems,118(3),375-385。  new window
28.Zadeh, Lotfi Asker(1999)。Fuzzy sets as a basis for a theory of possibility。Fuzzy sets and systems,100(S1),9-34。  new window
29.Zadeh, Lotfi Asker(1965)。Fuzzy sets。Information and Control,8(3),338-353。  new window
會議論文
1.林高正、鄧凱年(2006)。具模糊權數之最小生成樹的可能性分配。中華民國第十四屆模糊理論及其應用會議。高雄縣:義守大學。  延伸查詢new window
學位論文
1.鄧凱年(2007)。具模糊權數之最小生成樹問題(碩士論文)。南臺科技大學,臺南縣永康市。  延伸查詢new window
圖書
1.Dubois, D.、Prade, H.(2000)。Fundamentals of Fuzzy Sets-The Handbooks of Fuzzy Sets Series。Kluwer Academic Publishers。  new window
2.Klement, E. P.、Mesiar, R.、Pap, E.(2000)。Triangular Norms。Boston, Massachusetts:Kluwer Academic Publishers。  new window
3.Cook, W. J.、Cunningham, W. H.、Pulleyblank, W. R.、Schrijver, A.(1998)。Combinatorial Optimization。New York:John-Wiley & Sons。  new window
4.Klir, G. J.、Yuan, B.(1995)。Fuzzy Sets and Fuzzy Logics: Theory and Applications。Upper Saddle River, New Jersey:Prentice-Hall。  new window
5.Ball, M. O.、Magnanti, T. L.、Monma, C. L.、Nemhauser, G. L.(1995)。Handbooks in Operations Research and Management Science, Volume 8: Network Routing。Amsterdam:Elsevier Science。  new window
6.Ball, M. O.、Magnanti, T. L.、Monma, C. L.、Nemhauser, G. L.(1995)。Handbooks in Operations Research and Management Science, Volume 7: Network Models。Amsterdam:Elsevier Science。  new window
7.Ahuja, R. K.、Orlin, J. B.、Magnanti, T. L.(1993)。Network Flows: Theory, Algorithms, and Applications。Prentice-Hall。  new window
8.Bazaraa, M. S.、Jarvis, J. J.、Sherali, H. D.(1990)。Linear Programming and Network Flows。New York:John Wiley & Sons。  new window
圖書論文
1.Dubois, D.、Prade, H.(1987)。Fuzzy Numbers: An Overview。Analysis of Fuzzy Information (Vol. 1): Mathematics and Logic。Boca Raton, Florida:CRC Press。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE