Ford-Fulkerson Method via Linear Ranking Function for Solving Fuzzy Maximum Flow Problems

Abstract

In this study ,we will study the generic technique that can resolve any network flow issues is the Ford-Fulkerson Method. The   Edmonds-Karp algorithm, which employs the BFS process rather than the DFS to discover an augmenting path, is an improvement on the Ford Fulkerson algorithm. Each and every one of the parameters in the Ford-Fulkerson approach are represent by triangular fuzzy numbers. The Ford-Fulkerson approach makes it simple in order to discover the fuzzy optimal solution to the fuzzy maximum flow problems. Using a numerical example, the Ford-Fulkerson Method is shown, and the findings discuss.