Fuzzy Sets and Systems
The fuzzy shortest path problem and its most vital arcs
Fuzzy Sets and Systems
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
Communications of the ACM
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Uncertainty Theory
Theory and Practice of Uncertain Programming
Theory and Practice of Uncertain Programming
Existence and uniqueness theorem for uncertain differential equations
Fuzzy Optimization and Decision Making
UNCERTAIN OPTIMAL CONTROL WITH APPLICATION TO A PORTFOLIO SELECTION MODEL
Cybernetics and Systems
Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty
Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty
A risk index model for multi-period uncertain portfolio selection
Information Sciences: an International Journal
The (σ,S) policy for uncertain multi-product newsboy problem
Expert Systems with Applications: An International Journal
The maximum flow problem of uncertain network
Information Sciences: an International Journal
Uncertain random newsboy problem
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
| Hi-index | 0.09 |
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it investigates solutions to the @a-shortest path and the most shortest path in an uncertain network. It points out that there exists an equivalence relation between the @a-shortest path in an uncertain network and the shortest path in a corresponding deterministic network, which leads to an effective algorithm to find the @a-shortest path and the most shortest path. Roughly speaking, this algorithm can be broken down into two parts: constructing a deterministic network and then invoking the Dijkstra algorithm.