Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty (Q1760657): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58906741, #quickstatements; #temporary_batch_1707232231678
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:36, 5 March 2024

scientific article
Language Label Description Also known as
English
Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
scientific article

    Statements

    Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    Summary: We consider 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.
    0 references
    bottleneck spanning tree problem
    0 references
    edge costs
    0 references
    networks
    0 references
    randomness
    0 references
    reliability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references