CHAPTER2

Fuzzy Transportation Problem

Using TMF

Abstract

In this chapter, we propose a new method for solving a transportation

problem with Fuzzy parameters. These parameters are considered as FTNs, We

develop Fuzzy version of Vogel's algorithm for finding fuzzy basic feasible

solution and Fuzzy version of MODI algorithm for finding fuzzy optimal solution

of a fuzzy transportation problem and compare the results with some different

ranking functions.

Abbreviations:

FTP - Fuzzy Transportation Problem

TFN - Triangular Fuzzy Number

TMF - Triangular membership Function

FMDM - Fuzzy Modified distribution Method

a~i -The fuzzy availability of the product at the ith origin

~
b j -The fuzzy demand of the product of the jth destination

22
~
C ij -The fuzzy transportation cost for one unit quantity of the product from the ith source to

jth destination
~ -The fuzzy quantity of the product that should be transported from the i th source to jth
X ij
destination,

2.1 Introduction

The classical Transportation Problem (TP) is an important network

structured linear programming problem, first developed by Hitchcock [51].This

model has wide practical applications in the transportation systems, the supply

chain management, the production planning, etc.[46]. This typical transportation

technique is applied to determine an optimal solution of the problem of delivering

an available amount of supply to satisfy demands in which the total transportation

cost (or time) is minimized or the total transportation profit is maximized [4, 6,

20, 98, 77] . Efficient algorithms have been developed for solving the classical

transportation problem when the cost coefficients and supply and demand

quantities are exactly known [40]. There are effective algorithms for solving the

transportation problems when all the decision parameters, ie the supply available

at each source, the demand required at each destination as well as the unit

transportation costs are given in a precise way. But in real life, there are many

diverse situations due to uncertainty in one or more decision parameters and

hencethey may not be expressed in a precise way. This is due to measurement

inaccuracy, lack of evidence, computational errors, high information cost,

whether conditions etc. Hence we cannot apply the traditional classical methods

23
to solve the transportation problems successfully.In such cases, to use fuzzy

numbers for modeling the problem is quite appropriate as seen in [112]. Bellman

and Zadeh [10] were the first to consider the application of the fuzzy set theory in

solving optimization problems. Zimmermann [113] applied the fuzzy set theory to

the linear programming and multi-criteria decision making problems, and his

fuzzy model was soon developed into fuzzy optimization models. Since the

transportation problem is essentially a linear programming problem, one

straightforward idea is to apply the existing fuzzy linear programming techniques

to the Fuzzy Transportation Problem (FTP). Chanas and Kuchta [20] discussed

the type of transportation problems with fuzzy cost coefficients and developed an

algorithm for obtaining the optimal solution. Gupta and Mellawat [46] developed

a fuzzy transportation problem select a new type of goal based on cost

coefficients. Chanas and Kuchta [22] described an algorithm for solving the

integer FTP. Liu and Kao [64] developed a procedure to derive the extension

principle of fuzzy objective value of the FTP, in which the cost coefficients and

the supply and demand quantities were fuzzy numbers.

Therefore use of Fuzzy transportation problems is more appropriate to

model and solve the real world problems.Edward et.al [39] proposed the simplex

type algorithm for the solving the Fuzzy transportation problems. Chanas,

Kolodziejckzy, Machaj [18] presented a Fuzzy linear programming model for

solving Transportation problem. Li and Fang [41] introduced a genetic algorithm

solving the fuzzy relation with liner objective functions. NagoorGani and Abdul

Razak [72] obtained a fuzzy solution for a two stage cost minimizing fuzzy

24
transportation problem in which supplies and demands are trapezoidal fuzzy

numbers. Amit Kumar et al, [3] presented a Bi-criteria fixed charge transportation

problem using a linear ranking function, without converting it into crisp

environment and the solutions derived are fuzzy numbers.NagoorGani,

C.Duraisamy[73] developed a fuzzy linear programming problem where all the

parameters and variables are triangular L-R fuzzy number. Amit Kumar and

Amarpeetkau[1] proposed a new approach for solving fuzzy transportation

problem using generalized fuzzy number .Stephan Dinagar [93] proposed a new

algorithm for finding a fuzzy optimal solution for fuzzy transportation problem

where all parameters are trapezoidal fuzzy numbers.Several authors are obtained

the fuzzy optimal cost of fuzzy transportation problem using trapezoidal fuzzy

numbers. In general, most of the existing techniques provide only crisp solutions

for the fuzzy transportation problem. In this chapter proposed a new method for

the solution of fuzzy transportation problem without converting them into

classical transportation problem where all parameters are triangular fuzzy

numbers.

The idea is apply to the Zadeh’s extension principle [5, 17].A pair of two-

level mathematical programs is formulated to calculate the lower and upper

bounds of the a -cut of the objective value. Using the triangular membership

function in fuzzy optimal value is derived numerically by enumeration different

value of a and verified the triangular membership function and compare the

results some different ranking functions. A numerical example is illustrated.

25
2.2 Transportation Problem:

It is based on supply and demand of commodities transported from several

sources to the different destinations. The sources from which we need to transport

refer the supply while the destination where commodities arrive referred the

demand. It has been seen that on many occasion, the decision problem can also be

formatting as TP. In general we try to minimize total transportation cost for the

commodities transporting from source to destination. There are two types of

Transportation Problem namely (i) Balanced Transportation Problem (ii)

Unbalanced Transportation Problem.

2.2.1 Mathematical Formation of TP

The classical transportation problem can be stated mathematically as

follows:

m n
Max / Min Z = åå cij xij
i =1 j =1
n
Subject to åx
j =1
ij = ai

åx
i =1
ij = b j , "xij ³ 0

ai- Denotes quantity of product available at origin i,

bj- Denotes quantity of product required at destination j,

Cij-Denotes the cost of transporting one unit of product from Source/origini to

destination j

xij- Denotes the quantity transported from origin i to destination j.

26
2.2.2 Uncertainty in Transportation Problem:

In real world applications, all these parameters of the transportation

problems may not be known precisely due to natural calamities

(i) Uncertainty of the oil price due to uncertain stock market.

(ii) The Roads are damaged in the raining days, that stage the amount of

transportation costs are not fixed , etc.,

(iii) Uncertainty about the availability of product. To deal with such situations,

fuzzy set theory is applied in literature to solve the transportation

problems.

2.3 Fuzzy Transportation Problem

When a decision maker is uncertain about the precise value of the

transportation cost, availability and demand,The Transportation Problem may be

formulated into Fuzzy Transportation Problem. The mathematical formulation of

Fuzzy Transportation Problem is:

~ m n ~ ~
min / max Z » åå C ij X ij
i =1 j =1
m
~ ~
Subject to åX
i =1
ij »bj j - 1,2,.....n
n
~
åX j =1
ij » a~i i = 1,2......m

m n
~
å a~ = å b
i =1
i
j =1
j i = 1,2....m & j = 1,2....n
~
for all X ij ³ 0

~
Where X ij - Represents the fuzzy variables

~ ~
Cij , a~i and b j - Represents the Fuzzy Constants.

27
Table 1: Represents the tabular form of the fuzzy transportation problem

Destinatio n ( j ) ® 1 2 … … N Fuzzy
Source (i) ¯ availability
1 ~ ~ … … ~ ~
C11 C12 C1n a1

~ ~ ~
2 C 21 C 22 … … C2n a~2

. . . . . .
. . . . .

M ~ ~ ~ a~m
Cm1 Cm2 C mn

Fuzzy ~ ~ ~ m n
b1 b2 bm ~
å a~ = å b
i =1
i
j =1
j
Demand(bj)

~ ~
C ij = [ cij , cij , cij ] , X~ ij = [ xij , xij , xij ] , a~i = [ ai , ai , ai ] b j = [ b j , b j , b j ]

Remark:

m n
~
If å a~i =
i =1
åb
j =1
j then the fuzzy transportation problem is said to be balanced

fuzzy transportation problem otherwise it is called unbalanced fuzzy

transportation problem.

2.3.1 Definition: [9]A fuzzy feasible solution to a fuzzy transportation problem

with m sources and n destinations is said to be a fuzzy basic feasible solution if

the number of positive allocations (m+n-1).

28
2.3.2 Definition: [9]If the number of positive allocations in a fuzzy basic

feasible solution is less than (m+n-1), it is called a fuzzy degenerate feasible

solution.

2.3.3 Definition: [9]A fuzzy feasible solution is said to be a fuzzy optimal

solution if it minimizes the total fuzzy transportation cost.

2.4 Basic Theorems: (Existence of a Fuzzy Feasible Solution)

Theorem: 1 The necessary and sufficient condition for the existence of a fuzzy

feasible solution to the fuzzy transportation problem is

m n
~
å a~ = å b
i =1
i
j =1
j
(Total Supply = Total Demand)

Proof: Necessary Condition:

Let there exists a fuzzy feasible solution to the fuzzy transportation problem

~ m n ~ ~
min / max Z » åå C ij X ij
i =1 j =1
m
~ ~
Subject to åX
i =1
ij »bj j - 1,2,.....n
n
~
åX j =1
ij » a~i i = 1,2......m

m n
~
å a~i =
i =1
åb
j =1
j i = 1,2....m & j = 1,2....n
~
for all X ij ³ 0
m n m n
~ ~ ~
From , we haveå X ij » a~i j = 1,2....n ------ (2)
i =1
åå X ij »
j =1 i =1
åb
j =1
j

n
~ ~ m n m
From, we haveå X ij » b j i = 1,2....m ------ (3) ~
åå X ij » å a~ i
j =1 i =1 j =1 i =1

29
 m n
~
From the equation 2 and 3 å a~i =
i =1
åb
j =1
j

Sufficient Condition:

Since all ai and b j are positive, xij must be all positive. Therefore the

balanced fuzzy transportation problem (sufficient condition) yields a fuzzy

feasible solution.

2.5 Proposed Algorithms:

The solution of fuzzy transportation problem can be obtained two stages,

namely the fuzzy initial feasible solution and fuzzy optimal solution. For finding

the fuzzy initial feasible solution using the fuzzy transportation problem there are

numerous methods but fuzzy Vogel’s approximation method is preferred over the

other methods. Since the initial fuzzy basic feasible solution obtained by this

method is either optimal or very close to the optimal. We discuss fuzzy Vogel’s

approximation method and verify its solution in the nature of fuzzy triangular

membership function.

Triangular Fuzzy Vogel's approximation Method (TrFVAM)

The various steps of Vogel’s approximation method are:

2.5.1: Determination of the Initial fuzzy Basic Feasible solution

Step: 1 Find the Ranks of all the Fuzzy Costs, represented by fuzzy triangular

number.

30
Step: 2 Find the Penalty cost for each row and each column;

(i.e) It is the difference between the smallest rank and the next smallest ranks.

Step: 3Choosea row or column having maximum penalty cost.

Step: 4Allocate as much as possible in the lowest rank cell of the row or column

chosen in step (3)

Step: 5In case the allocation is made fully to a row or columns ignore that row

or column for further consideration.

Step: 6Repeat the procedure for step (2) to Step (5) until all the demands are

satisfied. The feasible solution thus obtained is the initial basic fuzzy feasible

solution.

Fuzzy optimality test can be conducted to any fuzzy initial basic feasible

solution of a fuzzy transportation problem provided such allocation has exactly an

(m + n-1) non-negative allocation, where “m” is the number of fuzzy origins and

“n” is the number of fuzzy destinations. Also these allocations must the

independent positions- which is the optimality finding procedure that is given

below

2.5.2: Determination of Optimal Solution (FMDM)

Step: 1Find out the set of fuzzy triangular numbers u)i = [ui , ui , ui ] and

vi = [v , vi , vi ] for each row and column satisfying [u i , u i , u i ] + [v , vi , vi ] =

)

[cij , cij , cij ] for each occupied cells (i,j) received allocations

31
 Step: 2To start with zero triangular fuzzy number to any row (or) column

havingmaximum number of allocations. If the maximum number of allocations is

more than one, and then choose any one arbitrary

Step: 3For each unoccupied cell (i, j), find u i and v j

) )

Step: 4Calculate the net evaluation zˆ ij = { uˆ i + vˆ j - cˆij } where zˆij = [ z ij , z ij , z ij ]

and cˆij = [cij , cij , cij ] for each cell (i, j) Then find the rank Rij of the net evaluation

ẑ ij , this step gives the optimality conclusion is:

(i) If Rij < 0 for all (i, j), then the optimal allocation is made as it is a unique

optimal solution.

(ii) If Rij > 0 foratleast one (i, j), then the solution is optimal but an alternate

optimal solution exists.

(iii) If Rij = 0 for all (i, j), then the solution is not optimal.

Step: 5Select the un occupied cell having the most positive value of Rij . From

this cell draw a closed loop path consists of successive horizontal and vertical

segments whose corner cells are occupied cell which starts and ends at the

designated unoccupied cell.

This loop is unique and this process is summarized by positive and

negative signs in the appropriate corners; this change will keep the supply and

demand restrictions satisfied.

Step: 6The above step yield a better solution by making one (or) more basic cell

as unoccupied cell. For the new set of fuzzy basic feasible allocation, repeat the

32
 above procedure from case (ii) step 1, until a fuzzy basic feasible solution

obtained.

2.6 NUMERICAL EXAMPLE:

A Fuzzy Transportation problem is solved by using the method proposed

in the section 2.5.

Consider the Fuzzy Transportation Problem with all parameters are

Triangular Fuzzy Number:

Table: 1 The Fuzzy Transportation Problem:

Destinatio n ( j ) ® D1 D2 D3 D4 Fuzzy capacity

Source (i ) ¯

O1 [-2,0,2] [0,1,2] [0,2,4] [3,5,7] [0,1,2]

O2 [4,8,12] [4,7,10] [2,4,6] [1,3,5] [2,4,6]

O3 [2,4,6] [4,6,8] [4,6,8] [4,7,10] [4,6,8]

Fuzzy demand [1,3,5] [0,2,4] [1,3,5] [1,3,5]

m n

åa = åb
) )
Since i j = 33.The problem is balanced fuzzy transportation problem.
i =1 j =1

2.6.1 Determination of Initial Fuzzy Basic Feasible Solution:

Table: 2The Rank of Fuzzy costs are calculated. Then a penalty cost for each row

is calculated, and first allocation is made.

33
 Destinatio n ( j ) ® D1 D2 D3 D4 Fuzzy capacity
Source (i ) ¯

O1 0 1(0,1,2) 0 0 [0,1,2] (0)

O2 8 7 4 3 [2,4,6] (1)

O3 4 6 6 7 [4,6,8] (2)

Fuzzy demand [1,3,5] [0,2,4] [1,3,5] [1,3,5]

(4) (5) (4) (3)

Since the allocate made is incomplete, step 1 to 4 in 2.5.1 are repeated

Table: 3 The Rank of Fuzzy costs are calculated. Then a penalty cost for each row

is calculated and second allocation is made.

Destinatio n ( j ) ® D1 D2 D3 D4 Fuzzy capacity

Source (i ) ¯

O2 8 7 4 3 [2,4,6] (1)

O3 4(1,3,5) 6 6 7 [4,6,8] (0)

Fuzzy demand [1,3,5] [-2,1,4] [1,3,5] [1,3,5]

(4) (1) (2) (4)

Since the allocate made is incomplete, steps 1 to 4 in 2.5.1 are repeated

Table: 4 The Rank of Fuzzy costs are calculated. Then a penalty cost for each row

is calculated and third allocation is made.

34
 Destinatio n ( j ) ® D2 D3 D4 Fuzzy capacity
Source (i ) ¯

O2 7 4 3(1,3,5) [2,4,6] (1)

O3 6 6 7 [-1,3,7] (0)

Fuzzy demand [-2,1,4] [1,3,5] [1,3,5]

(1) (2) (4)

Since theallocate made is incomplete, steps 1 to 4 in 2.5.1 are repeated

Table: 5 The Rank of Fuzzy costs are calculated. Then a penalty cost for each

row is calculated and fourth allocation is made.

Destinatio n ( j ) ® D2 D3 Fuzzy capacity

Source (i ) ¯

O2 7 4(1,3,5) [-3,1,5] (3)

O3 6 6 [-1,3,7] (0)

Fuzzy demand [-2,1,4] [1,3,5]

(1) (2)

Since theallocate made is incomplete, steps 1 to 4 in 2.5.1 are repeated

Table: 6To find the Rank of Fuzzy Numbers and find the Penalty cost and the

fifth and sixth allocation

Destinatio n ( j ) ® D2 D3 Fuzzy
Source (i ) ¯ capacity

O3 6(-2,1,4) 6 [-1,3,7]

Fuzzy demand [-2,1,4] [-4,2,6]

35
Since the allocate made is incomplete, steps 1 to 4 in 2.5.1 are repeated

Destinatio n ( j ) ® D3 Fuzzy capacity

Source (i ) ¯

O3 6(-4,2,6) [-5,2,9]

Fuzzy demand [-4,2,6]

Allocation are made fully to 6 cells (m+n-1=4+3-1=6).The process is stopped

Table:7 The Initial Fuzzy Basic Feasible Solution obtained is:

Destinatio n ( j ) ® D1 D2 D3 D4 Fuzzy capacity

Source (i ) ¯

O1 [0,2,4] [0,1,2] [0,2,4] [3,5,7] [0,1,2]

[0,1,2]

O2 [4,8,12] [4,7,10] [2,4,6] [1,3,5] [2,4,6]

[-3,1,5] [1,3,5]

O3 [2,4,6] [4,6,8] [4,6,8] [4,7,10] [4,6,8]

[1,3,5] [-2,1,4] [-4,2,6]

Fuzzy Demand [1,3,5] [0,2,4] [1,3,5] [1,3,5]

The Fuzzy Basic Feasible Solution is:

x12 = [0, 1, 2], x 23 = [-3, 1, 5], x24 = [1, 3, 5],

) ) )

x31 = [1, 3, 5], x32 = [-2, 1, 4], x33 = [-4, 2, 6]

) ) )

The Number of cells have been allocated is 6 = 3+4-1, so, the solution is non-

degenerate fuzzy basic feasible solution.

36
 The fuzzy transportation cost associated with the Fuzzy basic feasible

solution is (Using Arithmetic operation (1.16))

zij = [0 ,1, 2][0,1,2] + [2,4,6][-3,1,5] + [1,3,5][1,3,5] + [2, 4, 6][1, 3, 5]+

)

[4, 6, 8][-2, 1, 4] + [4, 6, 8] [-4, 0, 6]

= [0,1,4] +[-6,4,30]+[1,9,25]+[2,12,30]+[-8,6,32]+[-16,0,48]

= [-27, 32, 166]

R=1 (50.75
zij )
)

The fuzzy transportation cost associated with the form basic feasible solution

is (Using Arithmetic operation (1.17))

zij =[0 ,1, 2][0,1,2]+[2,4,6][-3,1,5]+[1,3,5][1,3,5]+[2, 4, 6][1, 3, 5]+

)

[4, 6, 8][-2, 1, 4] + [4, 6, 8] [-4, 0, 6]

= [0,1,4]+[-10,4,26]+[6,9,30]+[10,12,38]+[-8,6,32]+[-24,0,36]

= [-26, 32,166]

R1 ( zij ) = 51
)

2.6.2 Determination of Fuzzy Optimal Solution:

By step 1 of 2.5.2, a set of triangular fuzzy numbers u i and v j are computed such
) )

that uˆi + vˆ j = cˆij .

The 3rd row has maximum number of allocated cells, we start with the third row:

Let u3 = [-1, 0, 1]. The remaining values can be obtained as given below:
)

[ c31 , c31 , c31 ] = [ u3 , u3, u3 ] + [ v1 , v1, v1 ] (i.e) cij = u i + v j

) ) )

[c31 , c31 , c31 ] = [u3 , u3 , u3 ] + [v1 , v1 , v1 ]

[2, 4, 6] = [-1, 0, 1] + [v1 , v1 , v1 ]

37
 v1 = [3, 4, 5]
)

v2 = [3, 6, 9],
)
Similarly, v3 = [3, 6, 9],
)

v4 = [-6, 5, 12]
)
u1 = [-9,-4, 1] u2 = [-7, - 2, 3]
) )

Step 2 to step 5 of case (ii) are proceeded, and reallocations are made

R11 = {u1 + v1 - c11 }= (-9,-5,-1) + (1, 4, 7) - (-2, 0, 2)

) ) ) )

= (-8,-1, 6) – (-2, 0, 2) = (-10,-1, 8)< 0

R13 = {u1 + v3 - c13 } = (-6, 1, 8) – (0, 2, 4) = (-10,-1, 8) < 0

) ) ) )

R14 = {u1 + v4 - c14 }= (-11, 0, 11) – (3, 5, 7) = (-18,-5, 8) < 0

) ) ) )

R21 = {u 2 + v1 - c21 } = (-6, 2, 0) – (2, 4, 6) = (-12,-2, 8) < 0

) ) ) )

R22 = {u2 + v2 - c22 }= (-4, 4, 12) – (4, 7, 10) = (-14,-3, 8) < 0

) ) ) )

R34 = {u3 + v4 - c34 }= (-3, 5, 13) – (4, 7, 10) = (-13,-2, 9) < 0

) ) ) )

Table: 8 Fuzzy optimal Solution Table is:

Destinatio n ( j ) ® D1 D2 D3 D4 Fuzzy capacity

Source (i ) ¯

O1 [-2,0,2] [0,1,2] [0,2,4] [3,5,7] [0,1,2]

[-10,-1,8] *[0,1,2] [-10,-1,8] [-18,-5,8]

O2 [2,4,6] [4,7,10] [2,4,6] [1,3,5] [,2,4,6]

[-12,-2,8] [-14,-3,8] *[-3,1,5] *[1,3,5]

O3 [2,4,6] [4,6,8] [4,6,8] [4,7,10] [4,6,8]

* [1,3,5] *[-2,1,4] *[-4,2,6] [-13,-2,9]

Fuzzy demand [1,3,5] [0,2,4] [1,3,5] [1,3,5]

* Denotes the occupied cells, [ zij , zij , zij ] = { [u , u , u ] + [v , v , v ] - [c , c , c ]}< 0

i i i j j j ij ij ij

38
Since the rank of these net evaluations unoccupied cells are negative, the initial

fuzzy basic feasible solution is optimal.

2.6.3 Determination of a - cut of Optimal Fuzzy Transportation

cost:a- cut Fuzzy Transportation cost and fuzzy allocation are computed from

their membership functions as follows:

ìx -0 ü ìx -0 ü
ïï 0 £ x £ 1ï 0 £ x £ 1ï
mC12 ( x) = í 1 - 0
ï ïï ï
ý m X 12 ( x) = í 1 - 0 ý
ïx -2 1 £ x £ 2ïï ïx -2 1 £ x £ 2ïï
ïî 2 - 1 þ ïî 2 - 1 þ

ca 12 · xa 12 = [a 2 , (a + 2) 2 -----------
] (A)

Similarly, ca 23 · xa 23 = [8a 2 + 2a - 6 , 8a 2 - 34a + 30

----] (B)

ca 24 · xa 24 = [4a + 4a + 1 , 4a - 20a + 25
2 2
----
] (c)

ca 31 · xa 31 = [4a 2 + 6a + 2 , 4a 2 - 22a + 30 ] (D)

-----

ca 32 · xa=32 [6a 2 + 8a - 8 , 6a 2 - 32a +-----

32] (E)

ca 33 · xa =
33 [12a 2 + 16a - 16 , 8a 2 + 44a + 48 ] (F)
----

a- Cut of the Fuzzy Transportation cost is z = A + B + C + D + E + F

)

z = [35a 2 + 36a - 27 , 31a 2 - 62a + 169]

)

The varing of fuzzy transportation cost due to the degree of certainity is illustrated

in the table:

39
 a - Degree of Rang of the Fuzzy Transportation Roubst Ranking

Certain cost using a - cut value of the FTP Technique R(a)

0 [-27, 169] 71

0.1 [-23.05, 163.32] 70.135

0.2 [-18.4, 158.28] 69.94

0.3 [-13.05, 153.88] 70.41

0.4 [-7, 150.12] 71.56

0.5 [-0.25, 147] 73.375

0.6 [7.2, 144.52] 75.86

0.7 [15.3, 142.68] 78.99

0.8 [24.2, 141.48] 82.84

0.9 [33.75, 140.52] 87.135

1.0 [44, 138] 91

Weighted Interval Transportation Cost:

W ( zij ) = 0 + ( 0.1 ´ 70.135) + ( 0.2 ´ 69.94) + ( 0.3 ´ 70.41) + ( 0.4 ´ 71.56) +

)

( 0.5 ´ 73.375) + ( 0.6 ´ 75.86) + ( 0.7 ´ 78.99) + ( 0.8 ´ 82.84) +

( 0.9 ´ 87.135) + (1.0 ´ 91)

= 7.0135 + 13.988 + 21.123 + 28.624 + 36.687 + 45.516 +

55.293 + 66.272 + 78.421 + 91

= 443.6375

Average weighted Mean W ( zij ) = 40.33

)

The average Minimum Fuzzy Interval Transportation Cost is

(842.245 / 11) = 76.56

40
The Range of certainitygraphical repesentation is Fig (i) given below:

B
95

90

85

Y Axis Title
80

75

70

0.0 0.2 0.4 0.6 0.8 1.0

X Axis Title

Fig (i):Range of certainity

From the graph, we conclude that the optimal fuzzy transportationcost is

minimized in the range [0.1, 0.3]. The value of the cost os 69.94

Conclusion:

Here we have proposed a new method for solving fuzzy transportation

problem in which the transportation costs are considered as imprecise numbers

described by triangular fuzzy numbers which are more realistic and general in

nature. We Solved the FTP without converting them to classical transportation

problems and obtained the fuzzy optimal cost. Ranges of transportation cost of

FTP are summarized with the degree of certainty.

41