Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty (Q1760657)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty |
scientific article; zbMATH DE number 6106184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty |
scientific article; zbMATH DE number 6106184 |
Statements
Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty (English)
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
0 references
0 references
0 references
0.8149676322937012
0 references
0.8024041652679443
0 references
0.7994702458381653
0 references
0.7900261878967285
0 references
0.7874175906181335
0 references