Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
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.
- The Minimum Risk Spanning Tree Problem
- Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
- Chance constrained bottleneck spanning tree problem
- Interactive decision making for uncertain minimum spanning tree problems with total importance based on a risk-management approach
- A polynomial solvable minimum risk spanning tree problem with interval data
- Decision-Making in a Fuzzy Environment
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Finding Minimum Spanning Trees
- Fuzzy programming and linear programming with several objective functions
- Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
- scientific article; zbMATH DE number 4033521 (Why is no real title available?)
- scientific article; zbMATH DE number 848785 (Why is no real title available?)
- On stochastic spanning tree problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- Robust discrete optimization and its applications
- Stochastic bottleneck spanning tree problem
This page was built for publication: Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760657)
