Uncertain Distribution-Minimum Spanning Tree Problem

@article{Zhou2016UncertainDS,
  title={Uncertain Distribution-Minimum Spanning Tree Problem},
  author={Jian Zhou and Xiajie Yi and Ke Wang and J. Liu},
  journal={Int. J. Uncertain. Fuzziness Knowl. Based Syst.},
  year={2016},
  volume={24},
  pages={537-560}
}
This paper studies the minimum spanning tree problem on a graph with uncertain edge weights, which are formulated as uncertain variables. The concept of ideal uncertain minimum spanning tree (ideal UMST) is initiated by extending the definition of the uncertain α-minimum spanning tree to reect the overall properties of the α-minimum spanning tree weights at any confidence level α∈[0,1]. On the basis of this new concept, the definition of uncertain distribution-minimum spanning tree is proposed… 

Figures and Tables from this paper

On Multi-Objective Minimum Spanning Tree Problem under Uncertain Paradigm

TLDR
Two uncertain programming models of the proposed uncertain multi-objective minimum spanning tree problem (UMMSTP) are developed and their corresponding crisp equivalence models are investigated, and the practical problem of optimizing the distribution of petroleum products was solved using a classical multi- objective solution technique, the epsilon-constraint method.

A competitive analysis approach for route choice with uncertain travel times and blocked nodes

TLDR
It is proved that the competitive analysis for this route choice problem can be handled in the framework of traditional online shortest path problem via its equivalent counterpart on the corresponding deterministic network.

A New Crossover Mechanism for Genetic Algorithms for Steiner Tree Optimization

TLDR
This article proposes a new crossover mechanism, called leaf crossover (LC), which generates legal offspring by just exchanging partial parent chromosomes, requiring neither the global network link information, encoding/decoding nor repair operations.

A systematic review of uncertainty theory with the use of scientometrical method

TLDR
The literature on uncertainty theory follows a linear growth trend, involves an extensive network of 1000 scholars worldwide and is published in 300 journals, indicating thus that uncertainty theory has become increasingly attractive, and its academic influence is gradually expanding.

Reliability Assessment of Random Uncertain Multi-State Systems

TLDR
By joint employment of probability theory and uncertainty theory, the reliability of a random uncertain multi-state system is analyzed and an assessment technique for system reliability is proposed to compute the system reliability under the crisp user demand.

The covariance of uncertain variables: definition and calculation formulae

TLDR
The definitions and calculation formulae of covariance and correlation coefficient of two uncertain variables are suggested by means of their inverse distributions and it is shown that the correlation coefficient is essentially a measure of the relevance of distributions of uncertain variables.

A web service based advanced traveller information system for itinerary planning in an uncertain multimodal network

TLDR
The results of comparison among the four travel routes between various origin–destination pairs indicate that the proposed system could be an applicable tool for providing pre-trip information and assisting multimodal travellers under uncertain conditions.

References

SHOWING 1-10 OF 44 REFERENCES

Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights

TLDR
It is shown that both the expected UMST problem and the α-UMST problem can be transformed into an equivalent classical minimum spanning tree problem on a corresponding deterministic graph, which leads to effective algorithms with low computational complexity.

Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In

Uncertain Quadratic Minimum Spanning Tree Problem

TLDR
It is shown that the problem of finding an uncertain quadratic - minimum spanning tree can be handled in the framework of the deterministic quadrato-minimum spanning tree problem requiring no particular solving methods.

Fuzzy α-minimum spanning tree problem: definition and solutions

TLDR
It is proved that the fuzzy -minimum spanning tree problem can be transformed to a classical problem on a crisp graph in these two cases, which can be solved by classical algorithms such as the Kruskal algorithm and the Prim algorithm in polynomial time.

The Inverse Spanning Tree of a Fuzzy Graph Based on Credibility Measure

TLDR
It is shown that when all the edge weights are assumed to be independent fuzzy variables with regular credibility distributions, the proposed model can be reformulated into a traditional nonlinear programming according to the equivalent condition of fuzzy α-minimum spanning tree characterized by a set of constraints on non-tree edges and their tree paths.

Models for inverse minimum spanning tree problem with fuzzy edge weights

TLDR
A fuzzy α-minimum spanning tree model and a credibility maximization model are presented to formulate the problem according to different decision criteria, and a fuzzy simulation for computing credibility is designed and embedded into a genetic algorithm to produce some hybrid intelligent algorithms.

A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

TLDR
A learning automata-based heuristic algorithm to solve the minimum spanning tree problem in stochastic graphs wherein the probability distribution function of the edge weight is unknown and the superiority of the proposed algorithm over the well-known existing methods both in terms of the number of samples and the running time of algorithm is shown.

On Two-Stage Stochastic Minimum Spanning Trees

TLDR
For the two-stage stochastic optimization formulation with finite scenarios, a simple iterative randomized rounding method on a natural LP formulation of the problem yields a nearly best-possible approximation algorithm.

Confidence regional method of stochastic spanning tree problem