Confidence regional method of stochastic spanning tree problem

Authors:
H. Ishii;T. Matsutomi
Affiliations:
Department of Mathematical Sciences Faculty of Engineering, Osaka University Suita, Osaka 565, Japan;Department of Industrial Engineering Faculty of Engineering, Kinki University Kure, Hiroshima 737-01, Japan
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 0
Cited 2

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

The Journal of Supercomputing
Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making

Information Sciences: an International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

We consider a P model version of stochastic spanning tree problems with random edge costs. Parameters of underling probability distribution of edge costs are unknown and so they are estimated by a confidence region from statistical data. The problem is first transformed into a deterministic equivalent problem with a minimax type objective function and a confidence region of means and variances, since we assume normal distributions with respect to random edge costs. Our model reflects the situation that the maximum possible damage due to an unknown parameter should be minimized. We show the problem can be reduced to the deterministic equivalent problem of another stochastic spanning tree problem, which is already investigated by us. Thus, we can find an optimal spanning tree of the original problem very efficiently by this reduction.