Minimum Cost Flow Problem with Fuzzy Parameters

The Minimum Cost Flow (MCF) problem is the most fundamental of all network flow problems. In this paper the MCF problem with fuzzy parameters isconsidered. Based on integer solution property of the problem, the Yager ranking indices can be calculated for fuzzy arc costs to change the fuzzy arc costs to crisp ones. Consequently the problem can be converted to a MCF problem with fuzzy arc capacities and fuzzysupplydemands. Then by defining the fuzzy residualnetwork, the MCF algorithms are developed to solve this problem efficiently

Keywords:

Network flows , minimum cost flow , fuzzy networks