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

2008 ◽  
Vol 32 (12) ◽  
pp. 2490-2508 ◽  
Author(s):  
Mehdi Ghatee ◽  
S. Mehdi Hashemi
Keyword(s):  
Flow Problem ◽  
Network Planning ◽  
Planning Problem ◽  
Minimal Cost ◽  
Cost Flow ◽  
Bus Network ◽  
Minimal Cost Flow

Fuzzy Fractional Minimal Cost Flow Problem

2017 ◽  
Vol 20 (1) ◽  
pp. 174-186 ◽  
Author(s):  
Ali Mahmoodirad ◽  
Sadegh Niroomand ◽  
Nima Mirzaei ◽  
Abbas Shoja
Keyword(s):  
Flow Problem ◽  
Minimal Cost ◽  
Cost Flow ◽  
Minimal Cost Flow

The fractional minimal cost flow problem on network

2010 ◽  
Vol 5 (2) ◽  
pp. 307-317 ◽  
Author(s):  
Cheng Xu ◽  
Xiao-ming Xu ◽  
Hai-feng Wang
Keyword(s):  
Flow Problem ◽  
Minimal Cost ◽  
Cost Flow ◽  
Minimal Cost Flow

An Effective Solution Approach Based on Extension Principle for Fuzzy Minimal Cost Flow Problem

2018 ◽  
Vol 26 (06) ◽  
pp. 997-1015
Author(s):  
Sadegh Niroomand ◽  
Ali Mahmoodirad ◽  
Esmaeil Keshavarz
Keyword(s):  
Flow Problem ◽  
Extension Principle ◽  
Minimal Cost ◽  
Solution Approach ◽  
Real World Applications ◽  
Cost Flow ◽  
Fuzzy Cost ◽  
High Degree ◽  
Solution Methodology ◽  
Minimal Cost Flow

A well-known version of minimal cost flow problem with fuzzy arc costs is focused in this study. The fuzzy arc costs is applied as in most of real-world applications, the parameters have high degree of uncertainty. The goal of this problem is to determine the minimum fuzzy cost of sending and passing a specified flow value in to and from a network. A decomposition-based solution methodology is introduced to tackle this problem. The methodology applies Zadeh’s extension principle to decompose the problem to two upper bound and lower bound problems. These problems are capable of being solved for different α-cut values to construct the fuzzy cost flow value as the objective function value. The efficiency of the proposed solution methodology is studied over some well-known examples of the minimal cost flow problem. The obtained results and the procedure applied to obtain them prove the superiority of the proposed approach comparing to the previous approaches of the literature.

Two new algorithms for minimal cost flow problems

Computing ◽  
1973 ◽  
Vol 11 (3) ◽  
pp. 275-285 ◽  
Author(s):  
W. Domschke
Keyword(s):  
Minimal Cost ◽  
Flow Problems ◽  
Cost Flow ◽  
New Algorithms ◽  
Minimal Cost Flow
Sign in / Sign up

Export Citation Format

Share Document