A New Algorithm to Shortest Path Problem with Fuzzy Arc Lengths

Network flow problem is prevalent in engineering and management. In real life the parameters between nodes are not certain. Many authors try to proposed the solution method in different types of this problem. This paper proposes the simple method to compute the fuzzy shortest path (fuzzy shortest distance) between source node and destination node in network flow problem. This algorithm only considered the nodes that need to reach destination node and doesn’t involve all nodes, so it has expended less time. The goal is to reach destination node and find the shortest path, so it’s not important which nodes will be past through.