© 2017 IJSRSET | Volume 3 | Issue 6 | Print ISSN: 2395-1990 | Online ISSN : 2394-4099

Themed Section: Engineering and Technology

Method for Solving Octagonal Fuzzy Assignment Problem

Using Magnitude Ranking Technique
S. Menakadevi, K. M. Manikandan
Department of Mathematics, Dr. SNS. Rajalakshmi College of Arts and Science, Coimbatore, Tamilnadu, India

ABSTRACT

In this paper, the octagonal fuzzy assignment problem using magnitude ranking technique and the Hungarian
method has been applied to find an optimal solution. The numerical examples show that the octagonal fuzzy ranking
magnitude ranking method offers an effective tool for handling the octagonal fuzzy assignment problem over
Robust Ranking Method.
Keywords: Octagonal Fuzzy Number, Fuzzy Set, Magnitude Ranking, Magnitude Ranking Method. Hungarian
Algorithm

I. INTRODUCTION A→[0,1] and A(x) is interpreted as the degree of

membership of element x in fuzzy A for each x X.
The assignment model is the special case of
transportation problem. In 1965, Lotfi Zadeh has The Value zero is used to represent complete non-
introduced fuzzy sets which provide as a new membership; the value one is used to represent complete
mathematical tool to deal with uncertainty of membership and values in between are used to represent
information. In this paper we provided a Hungarian and intermediate degrees of membership. The mapping A is
Magnitude ranking method to solve assignment problem also called the membership function of fuzzy set A.
with fuzzy cost. Lin and Wen solved the assignment
problem with fuzzy interval number cost by a labeling 1.2. Crisp set
algorithm [2004]. Chen proved some theorems are
proposed a fuzzy assignment model that con-siders all Crisp set is a special case of a fuzzy set, in which the
individuals to have same skills [1985]. Dominance of membership function only takes two values, commonly
fuzzy numbers can be explained by many ranking defined as 0 and 1.
methods. Robust ranking method satisfies the properties
of compensation, linearity and additivity. Zimmermann 1.3. Fuzzy number
showed that solutions are obtained by fuzzy linear
programming are always efficient [1978]. R.Nagarajan A fuzzy number ̃ is a fuzzy set on the real line R, must
and A. Solairaju [2010] presented an algorithm for satisfy the following conditions.
solving fuzzy assignment problems using Robust
ranking technique with fixed fuzzy numbers. In this (i) There exist atleast one x0 R with ̃ (x0) = 1
paper the octagonal fuzzy assignment problem has been (ii) ̃ (x) is piecewise continuous.
converted into crisp assignment problem using Method (iii) ̃ Must be normal and convex.
of Magnitude and Hungarian assignment has been
applied to find an optimal solution. 2. Octagonal fuzzy numbers
Definition 2.1.
1.1. Fuzzy Set An octagonal fuzzy number denoted by ̃ w is defined to
Let X be a non-empty set. A fuzzy set A in X is be the ordered quadruple
characterized by its membership function

IJSRSET1736185 | Received : 05 Oct 2017 | Accepted : 22 Oct 2017 | September-October-2017 [(3)6: 735-738] 735
 ̃ w = (l1(r), s1(t), s2(t), l2(r)) for r [0,k] and t [k,w] (̃ ) ∫ ( ( ) ( )) ∫ ( ( )
where ( )) where 0

1. l1(r) is a bounded left continuous non-decreasing

Definition 3.1. The magnitude of an octagonal fuzzy
function over [0,w1], [0 w1 k]
number is obtained by the average of the two fuzzy side
2. s1(t) is a bounded left continuous non-decreasing
areas, left side area and right side area, from
function over [k,w2], [k w2 w] membership function to axis.
3. s2(t) is a bounded left continuous non-increasing
function over [k,w2], [k w2 w]
3.2. Magnitude ranking of octagonal fuzzy numbers
4. l2(r) is a bounded left continuous non-increasing
function over [0,w1], [0 w1 k]
Let ̃ be a normal octagonal fuzzy number. The value
M0Oct( ̃ ) , called the magnitude of ̃ is calculated as
Definition 2.2.
follows:

A fuzzy number ̃ is a normal octagonal fuzzy number

denoted by (a1,a2,a3,a4,a5,a6,a7,a8) where ( ̃) = ∫ ( ( ) ( )) ∫ ( ( )
a1 a2 a3 a4 a5 a6 a7 a8 are real numbers and its ( )) where 0
membership function ̃ (x) is given below = [(a1+a2+a7+a8) k + (a3+a4+a5+a6) (1-k)]
where 0
̃( )
3.3 Algorithm to Solve octagonal Fuzzy Assignment
( ) Problem:

Step 1: First test whether the given fuzzy cost matrix of

( )( ) a octagonal fuzzy assignment problem is a balanced one
or not. If not change this unbalanced assignment
problem into balanced one by adding the number of
( )( ) dummy row(s) / column(s) and the values for the entries
are zero. If it is a balanced one (i.e. number of persons
are equal to the number of works) then go to step 2.
( )
Step 2: Defuzzify the fuzzy cost by using Magnitude
{ ranking method.
Where 0 < k < 1. Step 3: Apply Hungarian Algorithm to determine the
best combination to produce the lowest total costs,
2.3 -cut of an octagonal fuzzy number where each machine should be assigned to only one job
and each job requires only one machine.
The -cut of an octagonal fuzzy number ̃ =
(a1,a2,a3,a4,a5,a6,a7,a8) is III. Numerical Example:

Example1 : Here we are going to solve octagonal fuzzy

Assignment problem using Magnitude Ranking
Technique: To allocate 3 jobs to 3 different machines,
II. Ranking of octagonal fuzzy numbers the fuzzy assignment cost is given below:

A magnitude of fuzzy number ̃ w is a function :

(I) → R+ which assigns a nonnegative
real number ( ̃ ) that expresses the measure of ̃

Min Mag ( ) + Mag

( ) ( )
International Journal of Scientific Research in Science, Engineering and Technology (ijsrset.com)
736
 ( )
( ) ( )
( )
We solve it by using Hungarian methods to get the
( )
following optimal solution.
( ) ( )
Step 1: Row reduction. Subtract the minimum element
Subject to
of each row from all elements of that row

( )
Now we calculate Mag ( ) by applying Step 2: Column reduction. Subtract the minimum
method of magnitude. The membership function of the element of each column from all elements of that
octagonal fuzzy number ( ) is column
( )

( )
( )
Step 3: Making assignments
( )
( )( )
(( ) )
( )
( )( ) The fuzzy optimal total cost

= ( )
( ) +( ) +( )
{ = (-2,1,4,7,10,13,16,19)
Mag(-2,1,4,7,10,13,16,19) [(
( ̃) [(a1+a2+a7+a8) k + (a3+a4+a5+a6) (1-k)] )( ) ( )( )]
where 0 1 = [34(0.4)+34(0.6)]
( ) = = [ ]
[(2+4+9+11)(0.4)+(5+6+7+8)(1-0.4)] =
= [26(0.4)+26(0.6)] = Mag(-2,1,4,7,10,13,16,19 = 8.5
6.5
(2,3,4,5,6,7,8,9) = IV. CONCLUSION
[(2+3+8+9)(0.4)+(4+5+6+7)(1-0.4)]
= [22(0.4)+22(0.6)] = In this paper, a method of solving fuzzy assignment
problem using magnitude ranking of octagonal fuzzy
5.5
numbers has been considered. The parameter k can be
( ) = 2.5
modified suitably by the decision maker to get the
( ) = 2.5
desired suitably by the decision maker to get the desired
( ) = 0.5
result. We may get different fuzzy assignment value for
( ) = 7.5
different values of k for the same assignment problem.
( ) = 11.5
( ) = 3.5
( ) = 5.5
.
We replace these values for this corresponding . We
get a convenient assignment problem

International Journal of Scientific Research in Science, Engineering and Technology (ijsrset.com)

737
 V. REFERENCES

[1]. D. Selvi, R. Queen Mary, 2017, Method for solving

fuzzy assignment problem using magnitude ranking
technique, International Journal of Applied and
Advanced Scientific Research.
[2]. Dubois, D. & Fortempts, P. (1999), Computing
improved optimal solutions to max-min flexible
constraint satisfaction problems, European J. Op. R.
118, 95-126.
[3]. Gani, A.N. &Assarudeen, S.N.M. (2012), A new
operation on triangular fuzzy number for solving fuzzy
linear programming problem, Appl. Math. Sci. 6, 525-
532.
[4]. Hajjari T, Abbasbandy S. A promoter operator for
defuzzification methods. Australian Journal of Basic
and Applied Sciences. 2011; 5(10): 1096-1105.
[5]. Huang, L. & Xu, G. (2005), Solution of assignment
problem of restriction of qualification, Operations
Research and Management Science 14, 28-31.
[6]. Jatinder Pal Singh & Neha Ishesh Thakur (2015), A
Novel Method to Solve Assignment Problem in Fuzzy
Environment, Industrial Engineering Letters 1, ISSN
2224-6096 (Paper) ISSN 2225-0581 (online).

International Journal of Scientific Research in Science, Engineering and Technology (ijsrset.com)

738