IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2012y2012i1n364086.html

Risk‐Control Approach for a Bottleneck Spanning Tree Problem with the Total Network Reliability under Uncertainty

Author

Listed:
  • Takashi Hasuike
  • Hideki Katagiri
  • Hiroshi Tsuda

Abstract

This paper considers a new risk‐control and management approach for a bottleneck spanning tree problem under the situation where edge costs in a given network include randomness and reliability. Particularly, this paper focuses on the case that only mean value and variance of edge costs are calculated without assuming a specific random distribution. In order to develop the risk control approach, a confidence interval‐based formulation is introduced. Using this interval, as well as minimizing the maximum value of worse edge costs, maximizing the minimum value of robust parameters to edge costs is introduced as objective functions in the risk‐control. Furthermore, in order to maintain the constructing spanning tree network entirely, the reliability for each edge is introduced, and maximizing the total reliability of spanning tree is assumed as the third objective function. The proposed model is a multiobjective programming problem, and hence, it is difficult to solve it directly without setting some optimal criterion. Therefore, satisfaction functions for each object and the integrated function are introduced, and the exact solution algorithm is developed by performing deterministic equivalent transformations. A numerical example is provided by comparing our proposed model with previous standard models.

Suggested Citation

  • Takashi Hasuike & Hideki Katagiri & Hiroshi Tsuda, 2012. "Risk‐Control Approach for a Bottleneck Spanning Tree Problem with the Total Network Reliability under Uncertainty," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
  • Handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:364086
    DOI: 10.1155/2012/364086
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2012/364086
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/364086?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
    ---><---

    References listed on IDEAS

    as
    1. Yen Hung Chen, 2012. "Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-8, March.
    2. Yen Hung Chen, 2012. "Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      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:wly:jnljam:v:2012:y:2012:i:1:n:364086. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

      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.