以機遇限制規劃模式求解可能性最小生成樹問題

Solving Possibilistic Minimum Spanning Tree Problems by Using Chance-Constrained Models

林高正(Kao-Cheng Lin) ； 曾文宏(Wen-Hung Tseng) ； 邱清爐(Chin-Lu Chyu) ； 許惠馨(Hey-Sin Hsu)

《管理資訊計算》 6卷特刊2 (2017/08) Pp. 82-95

https://doi.org/10.6285/MIC.6(S2).07

摘要

本文在探討，當聯結權數為模糊數時，如何以機遇限制規劃模式求解最小生成樹問題。在模式中，聯結權數為受限於機遇限制的決策變數，要求實際的聯結權數不大於規劃的聯結權數之可能性不低於預定的信賴水準。依決策者的特性，所提出模式分為 Minimin 模式與 Maximin 模式兩種。本文指出當聯結權數為具無互動性的模糊數時，可將問題轉成傳統的最小生成樹問題。

關鍵字

可能性規劃 ； 最小生成樹 ； 機遇限制模式 ； Minimin 模式 ； Maximin 模式

並列摘要

In this paper, two possibilistic chance-constrained models for solving the minimum spanning tree problem with fuzzy arc weights are proposed. In these models, the arc weights used in planning are treated as decision variables and subject to a set of chance constraints. These constraints require the possibilities that the arc weights used in planning are sufficient are not less than the specified levels. According to the characteristic of the decision maker, there are two kinds of chance-constrained model, the minimin model and the maximin model. It is shown that when the arc weights are non-interactive, these two models can be transformed into the classical minimum spanning tree problems easily.

並列關鍵字

Possibilistic Optimization ； Minimum Spanning Tree ； Chance-constrained Models ； Minimin Model ； Maximin Model

參考文獻

Ahuja, R.K.,Magnanti, T.L.,Orlin, J.B.(1993).Network Flows: Theory, Algorithms, and Applications.Englewood Cliffs, New Jersey:Prentice-Hall.

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.

Bertsekas, D.P.,Gallager, R.(1992).Data Networks.Upper Saddle River, New Jersey:Prentice-Hall.

Bertsimas, D.(1990).The probabilistic minimum spanning tree problem.Networks.20(3),245-275.

Carlsson, C.,Fullér, R.(2001).On possibilistic mean value and variance of fuzzy numbers.Fuzzy Sets and System.122(2),315-326.