IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i23p3812-d1535100.html
   My bibliography  Save this article

Uncertainty Modeling and Stability Assessment of Minimum Spanning Trees in Network Design

Author

Listed:
  • Ahmad Hosseini

    (Centre for Information Technologies and Applied Mathematics, School of Engineering and Management, University of Nova Gorica, 5000 Nova Gorica, Slovenia)

Abstract

The Minimum Spanning Tree (MST) problem in networks focuses on finding efficient routes, with applications in transportation, logistics, telecommunications, and more. However, catastrophes can make these networks uncertain, requiring robust computational models for decision-making. This paper introduces an uncertainty theory-based model to analyze the stability of MSTs in uncertain networks. By incorporating reliability and risk variables, we assess the robustness of uncertain MSTs (UMSTs) and address the challenge of computing link tolerances, which define the range within which network links can vary without compromising MST optimality. This study proposes computational formulations to systematically calculate these tolerances, offering a more efficient alternative to traditional re-optimization methods.

Suggested Citation

  • Ahmad Hosseini, 2024. "Uncertainty Modeling and Stability Assessment of Minimum Spanning Trees in Network Design," Mathematics, MDPI, vol. 12(23), pages 1-17, December.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3812-:d:1535100
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3812/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/23/3812/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:23:p:3812-:d:1535100. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.