Documente Academic
Documente Profesional
Documente Cultură
Abstract
Introduction
The fuzzy transportation problem (FTP) is one of the special kinds of fuzzy linear
programming problems. A fuzzy transportation problem is a transportation problem in
which the transportation costs, supply and demand quantities are fuzzy quantities. To
deal quantitatively with imprecise information in making decisions, Bellman and
Zadeh [1] and Zadeh [7] introduced the notion of fuzziness.
Fuzzy transportation is the transportation of fuzzy quantity from the fuzzy origin
to fuzzy destination in such a way that the total fuzzy transportation cost is minimum.
The objective of the fuzzy transportation problem is to determine the shipping
schedule that minimizes the total fuzzy transportation cost, while satisfying fuzzy
supply and demand limits. Here we use the existing fuzzy modified distribution
method(FMDM) [5] and fuzzy zero point method(FZPM) [4] with the multiplication
used by Stephen Dinegar.D & Palanivel.K [5].The paper is organized as follows:
152 S. Ismail Mohideen and P. Senthil Kumar
Section 2 deals with some basic terminology, section 3 provides the mathematical
formulation of Fuzzy transportation problem, section 4 deals with the numerical
example based on fuzzy modified distribution method and its rank, section 4.2 deals
with the same numerical example based on Fuzzy zero point method and its rank with
new multiplication operation, finally conclusion is given.
Terminology
Definition
Let A be a classical set A(x) be a function from A to [0, 1]. A fuzzy set A* with the
membership function A(x) is defined by, A* = {(x, A(x)) : x A and A(x) [0,
1]}.
Definition
A real fuzzy number = (a1, a2, a3, a4) is a fuzzy subset from the real line R with the
membership function (a) satisfying the following conditions.
(a) is a continuous mapping from R to the closed interval [0, 1]
(a) = 0 for every a (-, a1]
(a) is strictly increasing and continuous on [a1, a2].
(a) = 1 for every a [a2, a3]
(a) is strictly decreasing and continuous on [a3, a4]
(a) = 0 for every a [a4, + )
Arithmetic Operations
Let = [a1, a2, a3, a4] and b = [b1, b2, b3, b4] are two trapezoidal fuzzy numbers then
the arithmetic operations [3,6] on and b are as follows.
Addition : + b = (a1 + b1, a2 + b2, a3 + b3, a4 + b4)
Subtraction : - b = (a1 - b4, a2 - b3, a3 - b2, a4 - b1)
Multiplication used by Stephen Dinegar.D & Palanivel.K [5]:
a a a a
b = ( 1 (b1+b2+ b3+b4), 2 (b1+b2+b3 + b4), 3 (b1+b2+ b3+ b4), 4 (b1+ b2+
4 4 4 4
b3+ b4)), if R () > 0.
a a a a
= ( 4 (b1+b2+b3+ b4), 3 (b1+ b2+ b3+ b4), 2 (b1+ b2+ b3+ b4), 1 (b1+b2+ b3+ b4)),
4 4 4 4
if R () < 0.
(1)
ai
, ai(2) , ai(3) , ai(4) be the quantity of commodity available at fuzzy origin i. Let
(1)
bj = b j
, b (2)
j , b (3)
j , b (4)
j be the quantity of commodity needed at fuzzy
destination j. Let xij = xij(1) , xij(2) , xij(3) , xij(4) be the quantity transported from ith
fuzzy origin to jth fuzzy destination, so as to minimize the fuzzy transportation cost.
The linear programming model representing the fuzzy transportation problem is
given by.
m n
Min Z = Cij
(1)
, Cij(2) , Cij(3) , Cij(4) xij(1) , xij(2) , xij(3) , xij(4)
i=1 j=1
Subject to the constraints
n
xij
(1)
, xij(2) , xij(3) , xij(4) = (1)
ai
, ai(2) , ai(3) , ai(4) for i = 1, 2, ,m
j=1
(Row sum)
m
xij
(1)
, xij(2) , xij(3) , xij(4) = (1)
b j
, b (2)
j , b (3)
j , b (4)
j for j = 1, 2, ,n
i=1
(Column sum)
xij , xij , xij , xij 0
(1) (2) (3) (4)
Numerical Example
Ranking Technique - I
Here the algorithm of Pandian.P & Natarajan.G [4] and Stephen Dinegar.D &
The initial fuzzy transportation cost is Z = [-55.5, 93, 154, 302.5] and the crisp
value of Z = (-55.5+93+154+302.5)/4 = 123.5
Stage II
The fuzzy optimal solution using FMDM in terms of trapezoidal fuzzy
numbers, x12(1) , x12(2) , x12(3) , x12(4) =[1,5,6,10], x31
(1) (2)
, x31 (3)
, x31 (4)
, x31 =[-
15,5,10,30], x13(1) , x13(2) , x13(3) , x13(4) =[-9,0,2,11], x33
(1) (2)
, x33 (3)
, x33 (4)
, x33 =[-13,-
(1) (2) (3) (4) (1) (2) (3) (4)
1,3,15], x23 , x23 , x23 , x23 = [0,1,2,3], x34 , x34 , x34 , x34 = [-2,1, 4,7]
The corresponding total fuzzy transportation cost is Z = [-403, 45.5, 196.5, 645]
and the crisp value of Z = (-403+45.5+196.5+645)/4 = 121
The total fuzzy transportation cost is Z = [-202.5, 66, 176, 444.5] and the crisp
value of Z = (-202.5+66+176+444.5)/4 = 121
D1 D2 D3 D4 Supply
O1 2.5 3.5 11.5 7.75 6.5
O2 1.75 0.5 6.5 1.5 1.5
O3 5.5 8.5 15.5 9.5 11
Demand 7.5 5.5 3.5 2.5 19
Stage II
The optimum solution using modified distribution method is
x12 = 5.5, x13 = 1, x23 = 1.5, x31 = 7.5, x33 = 1, x34 = 2.5
Comparative Study
Ranking Technique II
Here also the algorithm of Pandian.P & Natarajan.G [4] and Stephen Dinegar.D &
Palanivel.K [5] is used with different ranking[2] technique
The initial fuzzy transportation cost is Z = [-55.5, 93, 154, 302.5] and the crisp
value of Z = (-55.5+2(93)+2(154)+302.5)/6 = 123.5
156 S. Ismail Mohideen and P. Senthil Kumar
Stage II
The fuzzy optimal solution using FMDM in terms of trapezoidal fuzzy
numbers, x12(1) , x12(2) , x12(3) , x12(4) =[1,5,6,10], x31
(1) (2)
, x31 (3)
, x31 (4)
, x31 =[-
15,5,10,30], x13(1) , x13(2) , x13(3) , x13(4) =[-9,0,2,11], x33
(1) (2)
, x33 (3)
, x33 (4)
, x33 =[-13,-
(1) (2) (3) (4) (1) (2) (3) (4)
1,3,15], x23 , x23 , x23 , x23 = [0,1,2,3], x34 , x34 , x34 , x34 = [-2,1, 4,7]
The corresponding total fuzzy transportation cost is Z = [-403, 45.5, 196.5, 645]
and the crisp value of Z = (-403+2(45.5)+2(196.5)+645)/6 = 121
The total fuzzy transportation cost is Z = [-202.5, 66, 176, 444.5] and the crisp
value of Z = (-202.5+2(66)+2(176)+444.5)/6 = 121
D1 D2 D3 D4 Supply
O1 2.5 3.5 11.5 7.67 6.5
O2 1.67 0.5 6.5 1.5 1.5
O3 5.5 8.5 15.5 9.5 11
Demand 7.5 5.5 3.5 2.5
Stage II
The optimum solution using modified distribution method is
x12 = 5.5, x13 = 1, x23 = 1.5, x31 = 7.5, x33 = 1, x34 = 2.5
Comparative Study
Conclusion
Mathematical formulation of fuzzy transportation problem and procedure for finding a
fuzzy optimal solution in two stages are discussed with the numerical example. In the
first stage, initial basic fuzzy feasible solution using Fuzzy Vogels Approximation
method is determined. In second stage, fuzzy optimal solution using Fuzzy
modified distribution method is calculated.
A new algorithm called the fuzzy zero point method for finding a fuzzy optimal
solution of fuzzy transportation problem in single stage [4] with the multiplication
operation due to Stephen Dinegar.D & Palanivel.K [5] is discussed, with Numerical
example.
The same optimum solution is got using both the methods. But fuzzy zero point
method with new multiplication operation gives optimum solution in single stage.
Hence we conclude that fuzzy zero point method with new multiplication operation is
better when compared to fuzzy modified distribution method.
Reference
[1] R.E. Bellman and L.A. Zadeh, Decision making in a fuzzy environment,
Management Science, 17 (1970), B 141 B 164
[2] S. H. Chen and C. H. Hsieh, Graded mean integration representation of
generalized fuzzy numbers, Journal of Chiness Fuzzy systems, 5 (1999), 1
7.
[3] George J. Klir and Bo Yuan., Fuzzy sets and Fuzzy Logic: Theory and
application (Fifth Edition).
158 S. Ismail Mohideen and P. Senthil Kumar
[4] P. Pandian and G. Natarajan., A new Algorithm for finding a fuzzy Optimal
solution for Fuzzy Transportation problems. Applied mathematics sciences,
Vol. 4, 2010, no. 2, 79 90.
[5] Stephen Dinagar. D and Palanivel. K., The transportation problem in Fuzzy
Environment. International Journal of Algorithms, Computing and
Mathematics. Vol 2, Number 3, August 2009.
[6] H.J. Zimmermann, Fuzzy set theory and its applications, Kluwer Nijhoff,
Boston, 1996.
[7] L.A. Zadeh, fuzzy sets as a basis for a theory of possibility, Fuzzy sets and
systems, 1 (1978), 3 28.