The shortest path problem in graphs with uncertainties in the parameters is an important problem in the mathematical programming, since it has a wide range of applications in different areas of Computation and Engineering, such as: computer networks, telecommunications, transportation, manufacturing, etc. However, due to its high computational complexity, there are few algorithms in the literature. In this paper is proposed an algorithm, based on Okada and Soper algorithm, which uses two uncertainty parameters, cost and time, with time restrictions in the nodes. The uncertainties are discussed using the fuzzy set theory.
graphs theory; shortest path problem; fuzzy set theory
