Generalized minimal cost flow problem in fuzzy nature: An application in bus network planning problem

The aim of minimal cost flow problem (MCFP) in fuzzy nature, which is denoted with FMCFP, is to find the least cost of the shipment of a commodity through a capacitated network in order to satisfy imprecise concepts in supply or demand of network nodes and capacity or cost of network links. Fuzzy supply–demand may arise in real problems, where incomplete statistical data or simulation results are used. Also, variation in the cost or capacity of links is commonly happening. In the present paper, after defining a total order on LR type fuzzy numbers, three models are studied; MCFP with fuzzy costs, MCFP with fuzzy supply–demand and a combination of two cases. For the first model, scaling negative cycle cancelling algorithm, which is a polynomial time algorithm, is proposed. For the second model, “nominal flow” is introduced which provides an efficient scheme for finding fuzzy flow. For the third model, we present an exact and some heuristic methods. Numerical examples are illustrated to demonstrate the efficiency of the proposed schemes. Finally, an application of this viewpoint in bus network planning problem is provided.