Minimum spanning tree problem of uncertain random network

详细信息    查看全文

• 作者：Yuhong Sheng ; Zhongfeng Qin ; Gang Shi
• 关键词：Minimum spanning tree ; Chance theory ; Uncertain random network ; Ideal chance distribution
• 刊名：Journal of Intelligent Manufacturing
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：28
• 期：3
• 页码：565-574
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：Production; Manufacturing, Machines, Tools; Control, Robotics, Mechatronics;
• 出版者：Springer US
• ISSN：1572-8145
• 卷排序：28

文摘

Minimum spanning tree problem is a typical and fundamental problem in combinatorial optimization. Most of the existing literature is devoted to the case with deterministic or random weights. However, due to lack of data, a proportion of edge weights have to be estimated according to experts’ evaluations, which may be considered as uncertain variables. This paper focuses on the case where some weights are random variables and the others are uncertain variables. The concept of an ideal chance distribution is introduced and its expression is given based on the uncertainty distributions and probability distributions. A model is formulated to find a minimum spanning tree whose chance distribution is the closest to the ideal one. Finally, a numerical example is given to illustrate the modelling idea of the study.