XXXX

Indian Journal of Science and Technology Vol. x No. x (xxx. 201x) ISSN: 0974- 6846

Fuzzy Hungarian Method for Solving Assignment Problem
involving trapezoidal fuzzy numbers

K. Prabakaran and K. Ganesan
Department of Mathematics, Faculty of Engineering and Technology,
SRM University, Kattankulathur, Chennai - 603203, INDIA.
Email: ganesan.k@ktr.srmuniv.ac.in, gansan_k@yahoo.com, prabakar1987@gmail.com

Abstract
In this paper we propose a new approach for the fuzzy optimal solution of assignment problems whose decision
parameters are trapezoidal fuzzy numbers. We develop a fuzzy version of Hungarian algorithm for the solution
of fuzzy assignment problems involving trapezoidal fuzzy numbers without converting them to classical
assignment problems. The proposed method is easy to understand and to apply for finding solution of fuzzy
assignment problems occurring in real life situations. To illustrate the proposed method numerical examples are
provided and the obtained results are discussed.

Keywords: Fuzzy numbers, Trapezoidal Fuzzy numbers, Fuzzy Assignment Problem, Fuzzy Hungarian Method.


1. INTRODUCTION

An assignment problem is a special type of linear programming problem which deals with assigning various
activities (jobs or tasks or sources) to an equal number of service facilities (men, machine, laborers etc) on one
to one basis in such a way so that the total time or total cost involved is minimized and total sale or total profit is
maximized or the total satisfaction of the group is maximized. It is well known that Assignment problems play
major role in various areas such as science, engineering and technology, social sciences and many others.
Examples of these types of problems may be the case of assigning men to machines, men to offices, drivers and
conductors to buses, trucks to delivery routes etc. In order to solve an assignment problem, the decision
parameters of the model must be fixed at crisp values. But to model real-life problems and perform
computations we must deal with uncertainty and inexactness. These uncertainty and inexactness are due to
measurement inaccuracy, simplification of physical models, variations of the parameters of the system,
computational errors etc. Also the decision parameters like time / cost for doing an activity by a service facility
(machine / person) might vary due to different reasons. Consequently, we cannot successfully use traditional
classical assignment problems and hence the use of fuzzy assignment problems is more appropriate.

In 1965 Zadeh [28] introduced the concept of fuzzy sets to deal with imprecision, vagueness in real life
situations. In 1970 Bellman and Zadeh [4] proposed the concept of decision making under fuzzy environments.
Since then, tremendous development of numerous methodologies and their applications to various decision
problems under fuzzy environment have been proposed. Assignment problems with fuzzy parameters have
been studied by several authors, such as Balinski and Gomory [3], Chanas et al [5], Chi-Jen Lin and Ue-pyng
Wen [8], Dubois and Fortemps [10], Chen [7], Ganesan and Veeramani [11], Kuhn [12], Liu and Gao [15],
Manimaran and Ananthanarayanan [16], Majumdar and Bhunia [17], Pandian and Natarajan [19],
Shanmugasundari and Ganesan [23], Sathi Mukherjee and Kajla Basu [22] etc. Chen [7] proved some
theorems and proposed a fuzzy assignment model that considers all individuals to have same skills. Wang [25]
solved a fuzzy assignment model using graph theory. Lin and Wen [13] investigated a fuzzy assignment problem
in which the cost depends on the quality of the job. Mukherjee and Basu [18] proposed a new method for
solving fuzzy assignment problems. Amit Kumar and Anila Gupta [2] proposed two new methods for solving
fuzzy assignment problems and fuzzy travelling salesman problems. Dubois and Fortemps [10] proposed a
flexible assignment problem, which combines with fuzzy theory, multiple criteria decision-making and
constraint-directed methodology. Long sheng Huang and Guang-hui Xu [14] proposed a solution procedure for
the assignment problems with restriction of qualification. In general, they have transformed the fuzzy
assignment problems into one or a series of classical assignment problems and then obtained an optimal
solution. But in this paper, we develop a Hungarian like fuzzy algorithm for solving fuzzy assignment problems
without converting them to classical assignment problems.


The rest of this paper is organized as follows: In section 2, we recall the definition of a new type of arithmetic
operations, a linear order relation on trapezoidal fuzzy numbers and some related results. In section 3, we define
fuzzy assignment problem as an extension of the classical assignment problem and propose fuzzy Hungarian
algorithm. In section 4, numerical examples are provided and the obtained results are discussed.

2. PRELIMINARIES

The aim of this section is to present some notations, notions and results which are of useful in our further study.

Definition 2.1 A fuzzy set a defined on the set of real numbers R is said to be a fuzzy number if its
membership function a : R [0,1] has the following
(i) a is convex, that is { } { }
1 2 1 2 1 2
a x +(1-)x =min a(x ),a(x ) , for all x , x R and [0,1]
(ii) a is normal i.e. there exists an x R such that ( ) a x 1 =
(iii) a is piecewise continuous.
Definition 2.2 A fuzzy number a in R is said to be a trapezoidal fuzzy number if its membership function
a
: X [0,1]

has the following characteristics:

( )
1
1 2
2 1
2 3
a
4
4
4 3
x - a
, a x a
a - a
1, a x a
x
a - x
, a x a
3
a - a
0, otherwise

We denote this trapezoidal fuzzy number by ( )
1 2 3 4
a = a , a , a , a . We use F(R) to denote the set of all
trapezoidal fuzzy numbers.












2.1 Arithmetic Operations on trapezoidal fuzzy numbers
For any two trapezoidal fuzzy numbers
( ) ( )
1 2 3 4 2 3 1 1
a a , a , a , a (coreof (a), left spreadof (a), right spreadof (a)) [a , a ], , = = = and
( ) ( )
1 2 3 4 2 3 2 2
b b , b , b , b (core(b), left spreadof (b), right spreadof (b)) [b , b ], , = = =

and for { } , , , , = +
the arithmetic operations on a and b

are defined as
( )
{ }
( ) { }
1 2 1 2
2 3 2 3 1 2 1 2 2 3 2 3
a b core(a) core(b), max{ , }, max{ , } : core(a) a andcore(b) b
[a , a ] [b , b ] , max{ , }, max{ , } : [a , a ] a and [b , b ] b
=
=

In particular,
( ) ( )
( )
1 2 1 2 2 3 2 3 1 2 1 2
2 2 3 3 1 2 1 2
a b core(a) core( b), max{ , }, max{ , } [a , a ] [b , b ] , max{ , }, max{ , }
[a b , a b ], max{ , }, max{ , }
+ = + = +
= + +
(i) Addition :



( ) ( )
( )
1 2 1 2 2 3 2 3 1 2 1 2
2 2 3 3 1 2 1 2
a b core(a) core(b), max{ , }, max{ , } [a , a ] [b , b ] , max{ , }, max{ , }
[a b , a b ], max{ , }, max{ , }
= =
=
(ii) Subtraction :


1 2 3 4
a a a a
Figure. 1 Trapezoidal Fuzzy Number
( )
a
x

1 1
1 1
( core(a), , ), 0
a
( core(a), , ), 0

=

<

(iii) Scalar Multiplication :

2.2 Ranking of trapezoidal Fuzzy Numbers

Many different approaches for the ranking of fuzzy numbers have been proposed in the literature. An efficient
approach for comparing the trapezoidal fuzzy numbers is by the use of a ranking function based on the
magnitude of the trapezoidal fuzzy number. Hence for any trapezoidal fuzzy number ( )
1 2 3 4
a a , a , a , a = define
the ranking function Mag (.): F(R) R, by
1 2 3 4
(a 5a 5a a )
Mag(a)
12
+ + +
= , where F(R) is a set of trapezoidal
fuzzy numbers defined on set of real numbers, which maps each fuzzy number into the real line, where a natural
order exists. The magnitude of a trapezoidal fuzzy number a synthetically reflects the information on every
membership degree, and meaning of this magnitude is visual and natural. Mag ( a ) is used to rank fuzzy
numbers. The larger Mag( a ), the larger fuzzy number.
For any two trapezoidal fuzzy numbers ( )
1 2 3 4
a a , a , a , a = and ( )
1 2 3 4
b b , b , b , b =

in F(R) , we define the

ranking of a and b

by comparing their magnitudes on R as follows:

(i) a b

if and only if Mag(a) Mag(b)


(ii) a b

if and only if Mag(a) Mag(b)


(iii) a b

if and only if Mag(a) Mag(b) =


Definition 2.3 A trapezoidal fuzzy number ( ) ( )
1 2 3 4 2 3 1 1
a a , a , a , a [a , a ], , = = is said to be symmetric if and
only if
1 1
. =

Definition 2.4 A trapezoidal fuzzy number ( ) ( )
1 2 3 4 2 3 1 1
a a , a , a , a [a , a ], , = = is said to be non-negative if and
only if Mag ( a ) 0 and is denoted by a 0.

If Mag ( a ) > 0, then ( ) ( )

1 2 3 4 2 3 1 1
a a , a , a , a [a , a ], , = = is
said to be a positive trapezoidal fuzzy number and is denoted by a 0

. Further if Mag(a) 0, = then a is said to

be a zero trapezoidal fuzzy number and is denoted by a 0.



Definition 2.5 Two trapezoidal fuzzy numbers ( ) ( )
1 2 3 4 2 3 1 1
a a , a , a , a [a , a ], , = = and
( ) ( )
1 2 3 4 2 3 2 2
b b , b , b , b [b , b ], , = =

in F(R) are said to be equivalent if and only if Mag ( a ) = Mag ( b

). That
is a b

if and only if Mag(a) = Mag(b).

Two trapezoidal fuzzy numbers ( ) ( )

1 2 3 4 2 3 1 1
a a , a , a , a [a , a ], , = =
and ( ) ( )
1 2 3 4 2 3 2 2
b b , b , b , b [b , b ], , = =

in F(R) are said to be equal if and only if core(a) core(b), =

1 2 1 2
, = = or
2 3 2 3
[a , a ] [b , b ], =
1 2 1 2
, = = and is denoted by a b. =

Note that
2 3
[a , a ] [0, 0], =
1 1
0, 0 = = if and only if a 0 [0, 0, 0, 0]. = =

Definition 2.6 Let
i
{a , i 1, 2,..., n} = be a set of trapezoidal fuzzy numbers. If
k i
Mag(a ) Mag(a ) , for all i,
then the fuzzy number
k
a is the minimum of
i
{a , i 1, 2,..., n}. =

Definition 2.7 Let
i
{a , i 1, 2,..., n} = be a set of trapezoidal fuzzy numbers. If
t i
Mag(a ) Mag(a ) , for all i, then
the fuzzy number
t
a is the minimum of
i
{a , i 1, 2,..., n}. =

3. MAIN RESULTS

Suppose there are n activities (jobs or tasks or sources) to be performed and n service facilities (men, machine,
laborers etc) are available for doing these activities. Assume that each service facility can perform one
activity at a time. The objective of the problem is to assign these activities to the service facilities on one to
one basis in such a way so that the total time or total cost involved is minimized and total sale or total profit is
maximized or the total satisfaction of the group is maximized.

3.1 Mathematical Model of Fuzzy Assignment Problem
Let the i
th
person is assigned to the j
th
job and is denoted by
ij
x and
ij
c be the corresponding fuzzy cost of
assigning the i
th
person to the j
th
job. Since the objective is to minimize the overall fuzzy cost for
performing all jobs, the mathematical model of this fuzzy assignment problem is as follows:
n n
ij ij
i =1 j=1
n
ij
i =1
n
ij
j=1
ij
Minimize z = c x
subject to x 1, j = 1, 2, ..., n
x 1, i =1, 2, ..., n
x 0 or 1, j = 1, 2, ..., n

th th
ij
th th
1, if the i person is assigned to j job
where x
0, if the i person is not assigned to j job

This fuzzy Assignment problem can be stated in the form of (n n) fuzzy cost matrix
ij
[c ] of real numbers as
given in the following table:

Table 1: Fuzzy cost matrix of fuzzy assignment problem












The cost or time
ij
c are fuzzy numbers
(1) (2) (3) (4)
ij ij ij ij ij
c [c , c , c , c ], = is the cost of assigning the jth job to the
ith person.

3.2 Fuzzy Hungarian method

We, now introduce a new algorithm called the fuzzy Hungarian method for finding a fuzzy optimal assignment
for fuzzy assignment problem.

Step 1: Determine the fuzzy cost table from the given problem. If the number of sources is equal to the number
of destinations go to step 3. If the number of sources is not equal to the number of destinations go to step 2.

Step 2: Add a dummy source or dummy destination, so that the fuzzy cost table becomes a fuzzy square matrix.
The fuzzy cost entries of dummy source/destinations are always fuzzy zero.

Step 3: Subtract the row minimum from each row entry of that row.

Step 4: Subtract the column minimum of the resulting fuzzy Assignment problem after using step 3 from each
column entry of that column.
Each column and row now has at least one fuzzy zero.

Step 5: In the modified fuzzy assignment table obtained in step 4, search for fuzzy optimal assignment as
follows.
(a) Examine the rows successively until a row with a single fuzzy zero is found. Assign the fuzzy zero and
cross off all other fuzzy zeros in its column. Continue this for all the rows.
Jobs
persons
1 2 3 - j - n
1
11
c

12
c

13
c


1j
c


1n
c

2
21
c

22
c

23
c


2j
c


2n
c


i
i1
c
i2
c
i3
c
ij
c
in
c

n
n1
c

n2
c

n3
c


nj
c


nn
c

(b) Repeat the procedure for each column of reduced fuzzy assignment table.
(c) If a row and / or column have two or more fuzzy zeros assign arbitrary any one of these fuzzy zeros and
cross off all other fuzzy zeros of that row/column. Repeat (a) through (c) above successively until the chain
of assigning or cross ends.

Step 6: If the number of assignments is equal to n, the order of the fuzzy cost matrix, fuzzy optimal solution is
reached. If the number of assignments is less than n, the order of the fuzzy zeros of the fuzzy cost matrix, go to
the step 7.

Step 7: Draw the minimum number of horizontal and / or vertical lines to cover all the fuzzy zeros of the
reduced fuzzy assignment matrix. This can be done by using the following:
(i) Mark rows that do not have any assigned fuzzy zero.
(ii) Mark columns that have fuzzy zeros in the marked rows.
(iii) Mark rows that do have assigned fuzzy zeros in the marked columns.
(iv) Repeat ii) and iii) above until the chain of marking is completed. Draw lines through all the unmarked
rows and marked columns. This gives the desired minimum number of lines.

Step 8: Develop the new revised reduced fuzzy cost matrix as follows:
Find the smallest entry of the reduced fuzzy cost matrix not covered by any of the lines. Subtract this entry from
all the uncovered entries and add the same to all the entries lying at the intersection of any two lines.

Step 9: Repeat step 6 to step 8 until fuzzy optimal solution to the given fuzzy assignment problem is attained.

4. NUMERICAL EXAMPLES

Example 4.1 Consider a fuzzy assignment problem with rows representing three persons P
1
, P
2
, P
3
and columns
representing the three jobs J
1
, J
2
, J
3
discussed in [21]. The cost matrix
ij
C (

is given whose elements are

trapezoidal fuzzy numbers. The problem is to find the optimal assignment so that the total cost of job
assignment becomes minimum.

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

(
(



The given problem is a balanced one. Since Mag(1,2,3,4), Mag(-1,0,1,2) and Mag(3,5,6,8) is minimum in the 1
st
,
2
nd
and 3
rd
row respectively, using step 3 of the fuzzy Hungarian method we obtain

( ) ( )
( ) ( )
( ) ( )
(0) [1, 2], 2,1 [9, 9], 2, 2
[0,1],1, 2 (0) [6, 6],1,1
(0) [3, 3], 3, 3 [10,10], 3, 3
(
(
(
(
(

Using step 4 of the fuzzy Hungarian method we obtain the following modified fuzzy assignment matrix.

( ) ( )
( )
( ) ( )
(0) [1, 2], 2,1 [3, 3], 2, 2
[0,1],1, 2 (0) (0)
(0) [3, 3], 3, 3 [4, 4], 3, 3
(
(
(
(
(

Now using step 5 to step 7 of the fuzzy Hungarian method, we have the following fuzzy assignment matrix.

( ) ( )
( )
( ) ( )
[ (0) ] [1, 2], 2,1 [3, 3], 2, 2
[0,1],1, 2 [ (0) ] ( 0)
( 0) [3, 3], 3, 3 [4, 4], 3, 3
(
(
(
(
(

Now using the step 8 of the fuzzy Hungarian method and repeating the procedure, we have the following fuzzy
optimal assignment matrix.
( )
( )
( ) ( )
( 0) [ (0) ] [2,1], 2, 2
[1, 3], 2, 2 ( 0) [ (0) ]
[ (0) ] [2,1], 3, 3 [3, 2], 3, 3
(
(
(
(
(

Therefore, the fuzzy optimal assignment for the given fuzzy assignment problem is
1 2 2 3 3 1
P J , P J , P J .

The fuzzy optimal total cost is calculated as = ([3,5],2,1)+([6,7],1,1)+([5,6],2,2)
= (12, 14, 18, 20) Cost units.

Example 4. 2 Consider a fuzzy assignment problem with rows representing 4 persons P
1
, P
2
, P
3
, P
4
and columns
representing the 4 jobs J
1
, J
2
, J
3
, J
4
discussed in [16]. The cost matrix is given whose elements are trapezoidal
fuzzy numbers. The problem is to find the optimal assignment so that the total number of job assignment
becomes minimum.

(3, 5, 6, 7) (5, 8,11,15) (9,10,11,15) (5,8,10,11)
(7, 8,10,11) (3, 5, 6, 7) (6, 8,10,12) (5, 8, 9,10)
(2, 4, 5, 6) (5, 7,10,11) (8,11,13,15) (4, 6, 7,10)
(6, 8,10,12) (2, 5, 6, 7) (5, 7,10,11) (2, 4, 5, 7)
(
(
(
(
(



The given problem is a balanced one. Since Mag(3,5,6,7), Mag(3,5,6,7), Mag(2,4,5,6) and Mag(2,4,5,7) is
minimum in the 1
st
, 2
nd
, 3
rd
and 4
rd
row respectively, using step 3 of the fuzzy Hungarian method, we obtain

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

Using step 4 of the fuzzy Hungarian method we obtain the following modified fuzzy assignment matrix.

( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
(0) [3, 5], 3,1 [2,1], 2, 4 [3, 4], 3,1
[3, 4], 2,1 (0) (0) [3, 3], 3,1
(0) [3, 5], 2,1 [4, 4], 3, 2 [2, 2], 2, 3
[4, 5], 2, 2 [1,1], 3, 2 [0,1], 2, 2 (0)
(
(
(
(
(
(

Now using step 5 to step 7 of the fuzzy Hungarian method, we have the following fuzzy assignment matrix.
( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
(0) [3, 5], 3,1 [2,1], 2, 4 [3, 4], 3,1
[3, 4], 2,1 (0) ( 0) [3, 3], 3,1
( 0) [3, 5], 2,1 [4, 4], 3, 2 [2, 2], 2, 3
[4, 5], 2, 2 [1,1], 3, 2 [0,1], 2, 2 (0)
( (

(
(
(

(
(
(
(
(

Now using the step 8 of the fuzzy Hungarian method and repeating the procedure, we have the following fuzzy
optimal assignment matrix.
( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( 0) [1, 4], 3, 4 (0) [1, 3], 3, 4
[5, 5], 2, 4 (0) ( 0) [3, 3], 3,1
(0) [1, 4], 2, 4 [2, 3], 3, 4 [0,1], 2, 4
[6, 6], 2, 4 [1,1], 3, 2 [0,1], 2, 2 (0)
( (

(
(
(

(
(
(

(
(
(
(

Therefore, the fuzzy optimal assignment for the given fuzzy assignment problem is
1 2 2 3 3 1 4 4
, , , . P J P J P J P J
The fuzzy optimal total cost is calculated as = ([10,11],1,4) + ([5,6],1,1) + ([4,5],2,1) + ([4,5],2,2)
= (21, 23, 27, 31) cost units.

5. CONCLUSION
We have thus obtained an optimal assignment schedule for a fuzzy assignment problem using trapezoidal fuzzy
number by the proposed new algorithm called fuzzy Hungarian method. It can be seen that the fuzzy optimal
solution to the assignment problem given in example 4.1 is (12, 14, 18, 20) Cost units by the proposed fuzzy
Hungarian method, where as Sagaya Roseline et.al [21] got the fuzzy optimal total cost as (09, 14, 17, 22).
Also the fuzzy optimal solution to the assignment problem given in example 4. 2 is (21, 23, 27, 31) Cost units
by the proposed fuzzy Hungarian method, where as Manimaran et.al [16] got the fuzzy optimal total cost as
(16, 23, 27, 35). From these we see that the proposed fuzzy Hungarian method in this paper gives very sharp
results.
ACKNOWLEDGMENT
The authors would like to thank the anonymous reviewers and Editors for their critical comments and valuable
suggestions.
REFERENCES
[1] S. Abbasbandy and T. Hajjari (2009), A New Approach for Ranking of Trapezoidal Fuzzy Numbers,
Computers and Mathematics with Applications, 57, 413-419.
[2] Amit Kumar and Anila Gupta (2012), Assignment and Travelling Salesman Problems with Coefficients
as LR Fuzzy Parameters, International Journal of Applied Science and Engineering, 10, 3, 155-170
[3] M.L. Balinski, R.E. Gomory (1964), A primal method for the assignment and transportation problems,
Management Sci., 10, 578593.
[4] R. E. Bellman, L.A. Zadeh (1970), Decision making in a fuzzy environment, Management Sci., 17 (4)
141164.
[5] S. Chanas and D. Kuchta (1996), A concept of the optimal solution of the transportation problem with
fuzzy cost, Fuzzy Sets and Systems, 82, 299305.
[6] S. Chanas, W. Kolodziejczyk and A. Machaj (1984), A fuzzy approach to the transportation problem,
Fuzzy Sets and Systems, 13, 211221.
[7] M.S .Chen (1985), On a fuzzy assignment problem, Tamkang Journal of Mathematics, 22, 407-411.
[8] Chi-Jen Lin and Ue-pyng Wen (2004), A labeling algorithm for the fuzzy assignment problem, Fuzzy
Sets and Systems, 142, 373-39.
[9] D. Dubois and H. Prade (1980), Fuzzy Sets and Systems: Theory and Applications, Academic Press,
New York,.
[10] D. Dubois and P. Fortemps (1999), Computing improved optimal solutions to max-min flexible
constraint satisfaction problems, European J. Operations Research, 118, 95-126.
[11] K. Ganesan and P Veeramani (2006), Fuzzy Linear Programs with Trapezoidal Fuzzy Numbers, Annals
of Operations Research, 143, 305 315.
[12] H. W. Kuhn (1955), The Hungarian method for the assignment problem. Naval Research Logistics
Quarterly, 2, 83-97.
[13] C.J. Lin and U.P. Wen (2004), The labeling algorithm for the fuzzy assignment problem, Fuzzy Sets and
Systems, 142, 373391.
[14] Long-sheng Huang and Guang-hui Xu (2005), Solution of assignment problem of restriction of
qualification, Operations Research and Management Science, 14, 28-31.
[15] L. Liu and X. Gao (2009), Fuzzy weighted equilibrium multi-job assignment problem and genetic
algorithm. Applied Mathematical Modelling, 33, 3926-3935.
[16] S. Manimaran and M. Ananthanarayanan (2012), A study on comparison between fuzzy assignment
problems using trapezoidal fuzzy numbers with average method, Indian Journal of Science and
Technology, Vol. 5, No. 4, 2610-2613.
[17] J. Majumdar and A. K. Bhunia (2007), Elitist genetic algorithm for assignment problem with imprecise
goal. European Journal of Operational Research, 177, 684-692.
[18] Mukherjee S. and Basu. K (2010), Application of fuzzy ranking method for solving assignment
problems with fuzzy costs. International Journal of Computational and Applied Mathematics, 5,359-368.
[19] P. Pandian and G. Natarajan (2010), A New Algorithm for Finding a Fuzzy Optimal Solution for
Fuzzy Transportation Problems, Applied Mathematical Sciences, Vol.4, No.2,pp. 79-90.
[20] P. Pandian and G. Natarajan (2010), An Optimal More-for-Less Solution to Fuzzy Transportation
Problems with Mixed Constraints, Applied Mathematical Sciences, Vol.4, No.29, 1405-1415.
[21] S. Sagaya Roseline and E. C. Henry Amirtharaj (2012), Fuzzy Hungarian method for solving
assignment problem with fuzzy cost, Proceedings of the Heber international conference on applications
of mathematics and statistics, 411 - 416.
[22] Sathi Mukherjee and Kajla Basu (2010), A More Realistic Assignment Problem with Fuzzy Costs and
Fuzzy Restrictions, Advances in Fuzzy Mathematics, 5 (3), 395-404.
[23] M. Shanmugasundari and K. Ganesan 2012, Fuzzy Assignment Problem: A New Solution Approach,
CiiT International Journal of Artificial Intelligent Systems and Machine Learning, Vol.4, No.2.
[24] D. Stephen Dinagar and K. Palanivel (2009), On Trapezoidal Membership Functions in Solving
Transportation Problem under Fuzzy Environment, International Journal of Computational Physical
Science, Vol.1, No.1, pp. 1-12
[25] X. Wang (1987), Fuzzy optimal assignment problem, Fuzzy Math. 3, 101108.
[26] R. R. Yager (1981) , A procedure for ordering fuzzy subsets of the unit interval, Information Sciences,
24, 143-161
[27] X. Ye and J. Xua (2008), Fuzzy vehicle routing assignment model with connection network based on
priority-based genetic algorithm. World Journal of Modelling and Simulation, 4, 257-268.
[28] L. A. Zadeh (1965), Fuzzy sets, Information and Control, 8, 338-353.
[29] H. J. Zimmermann (1998), Fuzzy set theory and its applications, Fourth Edition, Kluwer Academic
publishers.