IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v28y2017i3d10.1007_s10845-014-1015-3.html
   My bibliography  Save this article

Minimum spanning tree problem of uncertain random network

Author

Listed:
  • Yuhong Sheng

    (Tsinghua University
    Xinjiang University)

  • Zhongfeng Qin

    (Beihang University)

  • Gang Shi

    (Xinjiang University
    Tsinghua University)

Abstract

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.

Suggested Citation

  • Yuhong Sheng & Zhongfeng Qin & Gang Shi, 2017. "Minimum spanning tree problem of uncertain random network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 565-574, March.
    • Handle: RePEc:spr:joinma:v:28:y:2017:i:3:d:10.1007_s10845-014-1015-3
    DOI: 10.1007/s10845-014-1015-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-014-1015-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-014-1015-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joinma:v:28:y:2017:i:3:d:10.1007_s10845-014-1015-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.