International Journal of Mathematics and

Computer Applications Research (IJMCAR)

ISSN(P): 2249-6955; ISSN(E): 2249- 8060
Vol. 5, Issue 5, Oct 2015, 81-90
TJPRC Pvt. Ltd

AN ITERATIVE METHOD FOR FUZZY TRANSPORTATION PROBLEMS

THANGARAJ BEAULA1 & M. PRIYADHARSINI2
1
2

Department of Mathematics, TBML College, Porayar, Tamil Nadu, India

Departments of Mathematics, Bharathiyar College of Engineering and Technology,

Thiruvettakudi, Tamil Nadu, India

ABSTRACT
A transportation problem basically deals with the problem, which aims to find the best way to fulfill the demand
of n demand points using the capacities of m supply points. In this paper we discuss the solution of a fuzzy transportation
problem, with fuzzy quantities; also we described the algorithms to find initial basic feasible and optimal solutions. Finally,
a numerical example was presented to a rigorous understanding of the algorithms.

KEYWORDS: Fuzzy Transportation Problem, Trapezoidal Fuzzy Numbers, Optimal Solution and Iterative Method
AMS Classification: 90C08, 90C29

1 INTRODUCTION
Transportation problems aim at minimizing the cost of transportation of similar goods from different origins to
different destinations. In todays highly competitive market, the pressure on organizations to find better ways to create and
deliver value to customers becomes stronger. How and when to send the products to the customers in the quantities, that
too in a cost-effective manner, has became more challenging. Transportation models provide a powerful framework to meet
this challenge. Fuzzy numbers play an important role in many applications such as fuzzy control, decision making,
approximate reasoning and optimization. A fuzzy number is the fuzzy subset of the real line, where the highest membership
values are clustered around given real numbers. Although are variety of fuzzy numbers, the focus will be more towards
trapezoidal fuzzy numbers.
In the literature, many papers of transportation problem come with new and modified ideas to improve the cost
efficiency of transportation. The idea of fuzzy set was introduced by Zadeh12 in 1965. Bellmann and Zadeh2 proposed the
concept of decision making in fuzzy environment. After this pioneering work, several authors such as Shiang -Tai Liu and
Chiang Kao Chanas et al3, Pandian et al9, Liu and Kao7 etc., proposed different methods for the solution of Fuzzy
transportation problems. Chanas and Kuchta3 proposed the concept of the optimal solution for the transportation with fuzzy
coefficient expressed as fuzzy numbers. Liu and Kao7 described a method to solve a fuzzy transportation problem based on
extension principle. Lin introduced a genetic algorithm to solve transportation with fuzzy objective functions. Nagoor Gani
and Abdul Razak5 obtained a fuzzy solution for a two stage cost minimizing fuzzy transportation problem in which
supplies and demands are trapezoidal fuzzy numbers. Nagoor Gani, Edward Samuel and Anuratha4 used Arshamkhans
algorithm to solve a fuzzy transportation problem. Pandian and Natarajan8 proposed a fuzzy zero point method to find the
fuzzy optimal solution of fuzzy transportation problems. We can get an initial basic feasible solution for the transportation
by using the North-West corner rule, Row Minima, Column Minima, Matrix Minima or the Vogels Approximation
Method. To get an optimal solution for the transportation problem, we use the MODI method (Modified Distribution
www.tjprc.org

editor@tjprc.org

82

Thangaraj Beaula & M. Priyadharsini

Method). Charnes and Cooper developed the stepping stone Method, which provides an alternative way of determining the
optimal solution. Many authors considered various types of the fuzzy linear programming problems and proposed several
approaches for solving these problems. Usually, most of the methods are based on the concepts of comparison of fuzzy
numbers by the use of ranking function.
In this paper, we propose a new algorithm to find the initial fuzzy feasible solution to a fuzzy transportation
without converting to a Classical transportation problem. It is important to note that the proposed algorithm avoid
degeneracy and provides the fuzzy optimal solution quickly for the given fuzzy transportation problem.
The rest of the paper is organized as follows. In section 2, we recall the basic concepts and the results of
trapezoidal fuzzy numbers and their arithmetic operations. In section 3, we introduce the fuzzy transportation problems and
related results. In section 4, we propose a new algorithm to find an initial basic fuzzy feasible solution for the given fuzzy
transportation problem and also proposed an iterative method to obtain the fuzzy optimal solution. In section 5, a numerical
example is also provided to illustrate the theory developed in this paper.

2 PRELIMINARIES
The aim of this section is to present some notations, notions and results which are of useful in our further
considerations.
2.1 Fuzzy Set
A fuzzy set is characterized by a membership function mapping element of a domain, space or universe of
discourse

to the unit interval [0,1] . . ,

membership function of the fuzzy set

and

( )/

.Here

[0,1] is a mapping called the degree of

( ) is called the membership value of in the fuzzy set . These

membership grades are often represented by real numbers ranging from 0 to1.
2.2 Fuzzy Number
A fuzzy number is a fuzzy subset of the set of real numbers

must be a normal fuzzy subset of .

Each -cut of must be a closed interval for every

The support of

/
+

( )

(0,1].

must be bounded.

2.3 -Cut
Given a fuzzy set

which satisfies the following properties:

in

and any real number

.The strong -cut, denoted by +

( )

[0,1], then the -cut of , denoted by

is the crisp set

is the crisp set

2.4 Support
The Support of a fuzzy set
Supp ( ) =

Impact Factor (JCC): 4.6257

defined on

( )>0 .

is a crisp set defined as

NAAS Rating: 3.80

83

An Iterative Method for Fuzzy Transportation Problems

2.5 Normal
A fuzzy number is a convex normalized fuzzy set of the real line

whose membership function is piecewise

continuous.
2.6 Trapezoidal Fuzzy Numbers
A Trapezoidal fuzzy number

is a fuzzy fully specified by 4-tuples ( ,

!,

",

# ) such

that

"

with membership function defined as

,
. *
)%- +%,
' 1 . ! "
= *+%/ . 7
"
#
(%0+%/
'
0 12 45 6
&

*+%

2.7 Arithmetic Operations

In this section, some arithmetic operations between trapezoidal fuzzy numbers. Consider two trapezoidal fuzzy
numbers

=( ,

+ 8> = ( ,
+8 ,
,

Where

and 8 = (8 , 8! , 8" , 8# )

#)

",

+ 8! ,

",

#, 8

!,

",

",

#, 8

"

+ (8 , 8! , 8" , 8# )

+ 8" ,

+ 8# )

, 8! , 8" , ?@ 8# are real numbers.

! 8!, " 8" ,

!,

#)

(8 , 8! , 8" , 8# )

# 8# )

, 8! , 8" , ?@ 8# are real numbers.

< = (;C , ;D , ;E , ;F ) where ;F , ;E , ;D , 9GH ;C are real Numbers.

;
<
: and ;
Subtraction of 9
8> = ( ,

=(

!,

!,

8> = ( ,

Where

#)

<
: and ;
Multiplication of 9

=( 8 ,

",

<
: and ;
Addition of 9

=(

!,

8# ,

Where

!,

Where

!,

!,

",

8" ,

",

#, 8

",

#, 8

#)
"

(8 , 8! , 8" , 8# )

8! ,

8 )

, 8! , 8" , ?@ 8# are real numbers.

18> = 8> + = ( 18# , 18" , 18! , 18 )

www.tjprc.org

, 8! , 8" , ?@ 8# are non-zero positive real numbers.

editor@tjprc.org

84

Thangaraj Beaula & M. Priyadharsini

<
: and ;
Division of 9

8> = (( ,

= ( 8 ,
,

Where

!,

! 8"

!,

",

",

# )/(8

" 8!

#, 8

, 8! , 8" , 8# )

# 8

, 8! , 8" , ?@ 8# are non-zero positive real numbers.

For any Real Number J,

K = K( ,
(K
= L
(K

,K
#, K

!,

",

#)

! , K " , K # )
", K

!, K

. K 07
) . K < 0

2.8 Types of Trapezoidal Fuzzy Number

=( ,

Trapezoidal fuzzy number

"

0,

Non Negative Trapezoidal Fuzzy Number

0

Zero Trapezoidal Fuzzy Number

Trapezoidal fuzzy number

= 0,

= 0,

"

=0

=( ,

Equal Trapezodial Fuzzy Number

Two Trapezoidal fuzzy numbers

only if

=8 ,

= 8! ,

"

= 8" ,

= 8#

!,

",

# )

!,

",

# )

=( ,

!,

is said to be non negative trapezoidal fuzzy number if and only if

is said to be zero trapezoidal fuzzy number if and only if

",

# )

and 8> = (8 , 8! , 8" , 8# ) are said to be equal is.,

= 8>, if and

3 FUZZY TRANSPORTATION PROBLEM

The mathematical description of the transportation problem is given below:
S P
Minimize N = U
QT RT QR

QR

Subject to,
SRT

U
QT
QR

QR
QR

6Q , = 1,2, . . . W.
@R , X = 1,2, . . . ?

0, , X

where 6Q units are supplied by a supply node and @R units are requested by a demand node X and PQR is a unit
stepping cost for the transportation and

QR

denotes the number of units to be transported from supply to demand X.

Clearly, if any of the parameters PQR , 6Q or @R is fuzzy, the total transportation cost N is fuzzy, the total transportation cost N
is fuzzy as well. The conventional transportation problem defined above then turns into fuzzy transportation problem.

Impact Factor (JCC): 4.6257

NAAS Rating: 3.80

85

An Iterative Method for Fuzzy Transportation Problems

Here,

Z\] ,

P`a: = b(PQR ,

@a = b(@R ,

^ \ ,

and

_>]

denote their membership function.So,the following form in obtained

Z QR (PQR ))/ PQR

_ R (@R ))/ @R

6(PQR )c, 6` = d(6Q ,

6(@fR )c

^ Q (6Q ))/ 6Q

6(6Q )e and

Where 6gPQR h, 6(6Q ) and 6(@fR ) are the supports of PQR , 6Q and @fR , which denote the universal sets of the unit
ij

shipping cost, the quantity supplied by

supplier and the quantity required by Xij customer, respectively.

The fuzzy transportation is written in the following form:

S
Minimize N = U
QT RT PQR

Subject to
S
RT

U
QT
QR

QR
QR

QR

6Q , = 1,2, . . . W

@fR , X = 1,2, . . . ?

0, , X

Where 6Q = ( ,

!,

",

f = (8 , 8! , 8" , 8# ) and PQR = gPQR , PQR , PQR , PQR h representing the uncertain supply

# ), @R

and demand for transportation problem.

4. PROPOSED ALGORITHMS
4.1 A New Algorithm to Find the IBFS to FTP
Step1: Construct the fuzzy transportation table from the given fuzzy transportation problem
Step 2: convert the transportation table into a fully fuzzy transportation Table, if it is not
Step 3: subtract each row entries of the fuzzy transportation table from the row minimum
Step 4: subtract each column entries of the resulting fuzzy transportation table after using the Step: 3 from the
column minimum
Step 5: Now there will be at least one zero in each row and column in the reduced cost matrix. Calculate penalties
by taking difference between the minimum and next to minimum unit transportation costs in each row and each column
Step 6: Encircle the largest row difference or column difference. Choose the cell with least penalty cost obtained
by taking the average of their corresponding fuzzy supply and fuzzy demand.
Step 7: Allocate the minimum of supply/demand for the selected cell with zero fuzzy cost. In the event of tie in
cells with fuzzy zero cost repeat the same argument as in cell with fuzzy zero cost.
Step 8: In case the allocation is made fully to a row (or column), ignore that row (or column) for further
consideration, by crossing it.
Step 10: check whether the resultant matrix possesses at least one zero in each row and in each column, if not
repeat the step 3 and step 4, and perform step 5 to step 9 for remaining allocations.

www.tjprc.org

editor@tjprc.org

86

Thangaraj Beaula & M. Priyadharsini

Step 11: Repeat the procedure until all possible allocations are made.
Step 12: This allotment yields a fuzzy initial basic feasible solution to the given fuzzy transportation problem

S P
i.e., Total fuzzy cost = U
QT RT QR

QR

4.2 Optimality Condition to a FTP (Iterative Method)

Step 1: First, find an IBFS by using the proposed algorithm.

Step 2: Write the reduced feasible plan (IBFS) table and compute kR where kR is the largest transportation cost

associated with the Xij feasible plan.

Step 3: After finding kR ,cross out all the non-basic cells for which PQR kR

Step 4: Now construct a loop for the basic cells corresponding to kR .The amount l is added to and subtracted

from the transition cells of the loop in such a manner that the availabilities and requirements remain satisfied.
Step 5: If no such closed path is possible, the solution under test is optimal, otherwise go to Step 2
Step 6: Repeat the procedure until an optimal solution is obtained
5 Numerical Example
Consider a balanced FTP in which all the decisions parameters are trapezoidal fuzzy numbers of the

form ( ,

!,

",

# ).

mnF

uv
(1,2,3,4)
uv!
(0,1,2,4)
(3,5,6,8)
uv"
u~NN
(5,7,8,10)
W ?@

mnE

(1,3,4,6)
(1,0,1,2)
(5,8,9,12)
(1,5,6,10)

Table 1

mnD

mnC

(1,3,4,6)

(1,2,3,4)

(9,11,12,14) (5,7,8,11)
(5,6,7,8)
(0,1,2,3)
(12,15,16,19) (7,9,10,12)

moppq
rosstq
(1,6,7,12)
(0,1,2,3)
(5,10,12,17)

For Initial Basic Feasible Solution

Using the Step 3 to Step 8 of the proposed algorithm for finding IBFS, we have the following reduced fuzzy

transportation table with penalties.

uv

uv!

uv"
u~NN
W ?@
k1~W?
? 2 6

Table 2
D

(4,1,5,10)

0>

(3,0,2,5)

0>

(3,2,4,9)

(5,2,6,13)

0>
(, F, E, D)
(5,1,5,11)

(1.25)

(1)

(3)

(3)

(2,0,2,5)
(5,7,8,10)

Impact Factor (JCC): 4.6257

0>

(1,5,6,10)

0>

(1,3,4,6)

(3,2,6,12)

(1,2,3,4)

(1,6,7,12)
(0,1,2,3)

(1)

(5,10,12,17)

(1.25)
(3)

NAAS Rating: 3.80

87

An Iterative Method for Fuzzy Transportation Problems

Now, again using the Step 3 to Step 8, we have the reduced fuzzy transportation table with penalties.

uv

mnF
0>

uv"
0>
u~NN
(5,7,8,10)
W ?@
k1~W?
(0)
? 2 6

mnE

Table 3

mnD

0>
(F, , , F)
(12, 4,0,8)

(17, 5,3,15)

(2)

(1)

(1,5,6,10)

mnC

0>

(17, 5,3,14)

(1,3,4,6)

(1,2,3,4)

0>

moppq
rosstq

(1,6,7,12)

(5,10,12,17)

G9t
(1.25)
(1)

(1.25)

Similarly perform Step 5 to Step 9 for remaining allocations and there exists a fuzzy initial basic feasible solution.
Table 4

Since, the number of occupied cells having (

1) allocations and are also independent, there exists a non-

degenerate fuzzy basic feasible solution. Therefore the initial minimum transportation cost is < = ( 199, 66, 184, 636)
and the crisp value of the optimum fuzzy transportation cost for the problem,

is

. 171.75

To Find the Optimal Solution

Applying the fuzzy modified distribution method (MODI), we determine the set of numbers

www.tjprc.org

editor@tjprc.org

88

Thangaraj Beaula & M. Priyadharsini

Next we find the net evaluation for all the non-basic cells.
Table 5

Here cell value in (2, 3) is most negative, so the initial basic feasible solution is not optimal and allocated cells
form a closed loop as above. Now again we compute

and

for all basic cells as above. Next we find the net

evaluation for all the non-basic cells.

Table 6

Here cell value in (1, 3) is negative, so the initial basic feasible solution is not optimal and allocated cells form a
closed loop as above. Similarly we compute the same for all the basic cells, we have the net evaluations are all positive.
Therefore the optimal transportation problem is
Table 7

Here, < 12 = (1,5,6,10), < 13 = (9,0,2,11), < 23 = (0,1,2,3)

= (15,5,10,30), < 33 = (13, 1,3,15), < 34 = (2,1,4,7)

with

the

fuzzy

< = (295, 40, 210, 847) and the crispvalue of the optimum fuzzy transportation cost for the problem,
31

objective
is

value

. 200.5

Now this same problem is described by our proposed method to check the optimal solution.
By using iterative method, we have the reduced feasible plan (IBFS) table as follows.
First Iteration:
Table 8

Impact Factor (JCC): 4.6257

NAAS Rating: 3.80

89

An Iterative Method for Fuzzy Transportation Problems

Here Cj = (12,15,16,19) and the closed path (loop) for the cell (3,3).It is evident from the above table that only 3
units can be shifted around.
Second Iteration:
The revised feasible plan is shown below
Table 9

Here Cj = (12,15,16,19).
In the above two iterations Cj is same, hence we cannot form any closed loop from Cj .Therefore the feasible plan
at this stage is optimal.

Here, x12 = (1,5,6,10), x13 = (9,0,2,11), x23 = (0,1,2,3)

x
: 31 = (5,7,8,10), x33 = (13, 1,3,15), x34 = (2,1,4,7) with the fuzzy objective value

N = (235, 50, 198, 687) and the crisp value of the optimum fuzzy transportation cost for the problem, z is
Rs. 175.00

6 CONCLUSIONS
An optimal solution is obtained for a fuzzy transportation problem with trapezoidal fuzzy numbers. Also a new
approach named as Iterative Method to find the initial basic feasible solution as well as optimal solution are discussed.
These methods indicates the procedure which is a systematic one, and easy to understand and to apply. The concept takes
into account the fact that all physical phenomena in the universe have a degree of inherent uncertainty. It can serve as a
important tool involved in the concept of morphic computing, conceptual field and statistics, computer programming as
well as in decision making (law,business,etc.,). These studies are also be utilized in future studies of Operations Research.

7 REFERENCES
1.

Arun Patil and S.B. Chandgude, Fuzzy Hungarian Approach for transportation model, International Journal of
Mechanical and industrial Engineering, 2(1) (2012), 77 80.

2.

Bellmann and L.A.Zadeh, Decision making in a fuzzy environment, Management science, 17(1970), 141 164.

3.

Chanas . S, D. Kuchta, A concept of optimal solution of the transportation with fuzzy cost coefficient, Fuzzy sets
and systems, 82 (9) (1996), 299 - 305.

4.

Edward Samuel.A and A.Nagoor Gani, Simplex type algorithm for solving fuzzy transportation problem, Tamsui
oxford journal of information and mathematical sciences, 27 (1) (2011), 89 98.

5.

A.Nagoor Gani, K. A. Razak, Two stage fuzzy transportation problem, Journal of Physical Sciences, 10 (2006), 63
69.

www.tjprc.org

editor@tjprc.org

90

Thangaraj Beaula & M. Priyadharsini

6.

Nuran Guzel, Fuzzy transportation problem with the fuzzy amounts and the fuzzy costs, World Applied Sciences
Journal, 8 (5) (2010), 543 549.

7.

Liu S.T, C.Kao, Solving fuzzy transportation problem based on extension principle, European Journal of
Operations Research, 153 (2004), 661 674.

8.

Pandian and Natarajan, A new algorithm for finding a fuzzy optimal solution for fuzzy transportation problem,
Applied Mathematics Sciences, 4 (2) (2010), 79 90.

9.

Shanmugasundari.M and K. Ganesan, A novel approach for the fuzzy optimal solution of fuzzy transportation
problem, (3) (1) (2013), 1416 1424.

10. Yager.R.R, A characterization of the extension principle, Fuzzy Sets and Systems, 18 (1986), 205 217.
11. Zadeh L.A, Fuzzy sets as a basis for a theory of possibility, Fuzzy Sets and Systems, 1 (1978), 3- 28.
12. Zadeh L.A, Fuzzy sets, Information and Computation, 8 (1965), 338 353.

Impact Factor (JCC): 4.6257

NAAS Rating: 3.80