On Intuitionistic Fuzzy Transportation Problem Using Pentagonal Intuitionistic Fuzzy Numbers Solved by Modi Method
On Intuitionistic Fuzzy Transportation Problem Using Pentagonal Intuitionistic Fuzzy Numbers Solved by Modi Method
Copyright © 2021
20 by author (s) and
International Journal of Trend in
Scientific Research and Development
Journal. This is an Open Access article
distributed under
the terms of the
Creative Commons
Attribution License (CC BY 4.0)
(http://creativecommons
//creativecommons.org/licenses/by/4.0)
1. INTRODUCTION
In general, transportation problems are solved with fuzzy numbers, in section 3, introduce int Pentagonal
assumptions that the cost, supply and demand are Intuitionistic Fuzzy Definition and proposed algorithm
specified in precise manner. However, in many cases the followed by a Numerical example using Modi method and
decision maker has no precise information about the in section 4, finally the paper is concluded.
coefficient belonging to the transportation problem.
2. PRELIMINARIES
Intuitionistic fuzzy set is a powerful tool to deal with such
Let X be a nonempty set. A fuzzy set ̅ of Xis defined
2.1. Definition (Fuzzy set )[10]
vagueness.
The concept of Intuitionistic Fuzzy Sets (IFSs), proposed
pr as ̅= , x / ∈ . Where (x) is called
by Atanassov in [2], has been found to be highly useful to membership function, which maps each element of X to a
deal with vagueness. Many authors discussed the solutions value between 0 and 1.
of Fuzzy Transportation Problem (FTP) using various
2.2. Definition (Fuzzy Number )[10]
techniques. In 1982, O’heigeartaigh [9] proposed an
A fuzzy number is a generalization of a regular real
algorithm to solve Fuzzy Transportation
nsportation Problem with
number and which does not refer to a single value but
triangular membership function. In 2013, NagoorGani.A
rather to a connected a set of possible values, where each
and Abbas. S [8], introduced a new method for solving in
possible value has its weight between 0 and 1. The weight
Fuzzy Transportation Problem. In 2015, A. Thamaraiselvi
is called the membership function.
functio
A fuzzy number ̅ is a convex normalized fuzzy set on the
and R. Santhi [3] introduced Hexagonal Intuitionistic
Fuzzy Numbers. In 2015,ThangarajBeaula
ThangarajBeaula – M.
Priyadharshini [4] proposed. A New Algorithm for Finding real line R such that
There exists at least one x ∈R x = 1.
a Fuzzy Optimal Solution.
R with
x x is piecewise continuous.
The paper is organized as follows, in section 2,
introduction with some basic concepts of Intuitionistic
+
3.2. GRAPHICAL REPRESENTATION OF PENTAGONAL
such that 0≤ ̅ ̅ (x) ≤1 for all x∈ . INTUITIONISTIC FUZZY NUMBERS
1
The membership and non- membership functions of
̅ are in the following form
0.9
0 *+, − ∞ ≤ .
0.8
( 4
& * *+, ≤ ≤ /&
0.7
.
1 *+, = /
'0 *+, ≤ ≤ 3
̅
0.6
=
& / 1&
% 0 *+, 1 ≤ ∞ 2
0.5
0.4
1 *+, − ∞ ≤ .′
( 4
0.3
0 *+, = /
'0′ *+, ≤ ≤ ′3
̅
0.1
(x) =
& / 1 &
% 1 *+, 1 ′ ≤ ∞ 2
0
0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
a2 a1 b2 b1 c1 c2 d1 d2 e1 e2
Where*,* ′ ,0, 0′ are functions from R → [0,1] .* and 0′ are µ A (x) ------ Membership Function
strictly increasing functions and 0 and * ′ are strictly
I
1 , :. + :1 / + ; , 8/ + 8; , 9/ + 9; , / + ; , :/ +
function V A I (x ) are given by
0 for x < a1 :;
̅5 − 675 = . − :1 , 8. − 1 , 9. − 91 , . − 81 , :. −
x − a1 B. Subtraction:
for a1 ≤ x ≤ b1
/ − :; , 8/ − ; , 9/ − 9; , / − ; , :/ − ;
b1 − a1 1
x − b1
c −b for b1 ≤ c ≤ c1 3.4. RANKING OF PIFN BASED ON ACCURACY
FUNCTION
1 1
µ A I ( x) = 1 for x = c1 Accuracy function of a pentagonal intuitionistic fuzzy
d1 − x ~ I
@ IJTSRD | Unique Paper ID – IJTSRD41094 | Volume – 5 | Issue – 3 | March-April 2021 Page 1073
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
3.5. MODI METHOD considerably. Then complete the calculation of <= ’s
and>? ’s for other rows and columns by using the
relation.@=? = <= + >A for all occupied cells (i,j)
There are many methods to find the basic feasible
solution, Modi method is heuristic method. The advantage
of this method is that it gives an initial solution which is
nearer to an optimal solution. Here in this paper Modi Step – 3: For unoccupied cells, calculate opportunity cost
by using the relationship
= @=? - (<= + >A for all iand j.
method is suitably modified and used to solving
=?
Intuitionistic Fuzzy transportation problem.
=? .
PROPOSED ALGORITHM Step – 4: Examine sign of each
Step –1: In Octagonal Intuitionistic Fuzzy transportation
problem (OIFN) the quantities are reduced into an integer 1. If =? >0, then current basic feasible solution is
using the ranking method called accuracy function. optimal.
2. If =? = 0, then current basic feasible solution will
occupied cells, calculate <= and >? for rows and columns.
Step – 2: For an initial basic feasible solution with m + n -1
remain unaffected but an alternative solution exists.
The initial solution can be obtained by any of the three If one or more =? <0, then an improved solutions can be
methods discussed earlier. obtained by entering unoccupied cell (i,j) in the basis. An
To start with, any of<= ’s or>? ’sis assigned the value zero. unoccupied cell having the largest negative value of =? is
It is better to assign zero for a particular <= or> ? . Where chosen for entering into the solution mix (new
transportation schedule).
there are maximum numbers of allocations in a row or
column respectively, as it will reduce arithmetic work
B1 B2 B3 B4 Supply
(4,9,12,15,17) (2,4,8,13,15) (9,10,13,14,15) (3,4,5,10,12)
A1 (6,9,13,14,16) (1,3,8,12,14) (8,11,12,16,17) (1,2,6,9,13)
11
(3,6,9,12,15) (4,7,9,12,15) (2,4,7,10,12) (10,11,13,15,17)
A2 (2,5,8,11,14) (3,6,9,11,14) (3,5,7,9,11) (12,14,15,16,17)
13
(13,14,15,16,17) (9,10,13,14,16) (4,7,9,12,15) (16,18,20,22,24)
A3 19
(15,16,17,18,19) (11,14,15,16,17) (3,6,9,11,14) (17,19,21,23,25)
Demand 6 10 12 15
Step – 5:Construct a closed path (or loop) for the Table 1 –Reduced Table
unoccupied cell with largest negative opportunity cost. B1 B2 B3 B4 Supply
Start the closed path with the selected unoccupied cell and
mark a plus sign (+) in this cell, trace a path along the rows A1 21 16 25 13 11
(or columns) to an occupied cell, mark the corner with
A2 17 18 14 28 13
minus sign (-) and continue down the column (or row) to
an occupied cell and mark the corner with plus sign (+) A3 32 27 18 41 19
and minus sign (-) alternatively, close the path back to the Demand 6 10 12 15 43
selected unoccupied cell.
ΣDemand = Σ Supply
Step – 6: Select the smallest quantity amongst the cells
Table 2–VAM Method
marked with minus sign on the corners of closed loop.
Allocate this value to the selected unoccupied cell and add B1 B2 B3 B4 Supply
it to other occupied cells marked with plus signs and A1 21 16 25 [11] 13 11
subtract it from the occupied cells marked with minus
signs. A2 [6] 17 [3] 18 14 [4] 28 13
Step – 7: Obtain a new improved solution by allocating A3 32 [7] 27 [12] 18 41 19
units to the unoccupied cell according to step – 6 and Demand 6 10 12 15 43
calculate the new total transportation cost.
=? ≥ 0, for
Step – 8: Test the revised solution further for optimality. The problem is a balanced transportation problem, using
The procedure terminates when all the proposed algorithm; the solution of the problem is as
unoccupied cells. follows
HA ( )
~I = (4+9+12+15+17+6+9+13+14+16)/5 = 21
p
@ IJTSRD | Unique Paper ID – IJTSRD41094 | Volume – 5 | Issue – 3 | March-April 2021 Page 1074
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
Similarly applying for all the values, we have the following Since all d ij > 0 the solution in optimum and unique. The
reduced table.
solution is given by
Applying VAM method, Table corresponding to initial
basic feasible solution is x14 = 11, x21 = 6, x22 = 3, x24 = 4, x32 = 7, x33 = 12
The optimal solution is = 11× 13 + 6 × 17 + 3 × 18 +
4 × 28 + 7 × 27 + 12 × 18
Since the number of occupied cell m+n-1= 6 and are also
independent. There exists a non- negative basic feasible
solution.
= Rs. 816.
The initial transportation cost = (11×13) + (6×17) +
(3×18) + (4×28) + (7×27) + (12×18) = Rs 816. 4. CONCLUSION:
In this paper, we discussed finding optimal solution for
To find the optimal solution: pentagonal intuitionistic transportation problem. We have
Applying the Modi method- u i + v j = cij used accuracy function ranking method and Modi method
to find the optimal solution. Modi method has easily to
We get number u1 = 0 . The remaining number can be understand and the solution is very nearer to optimum
solution. In future research we propose generalized
obtained as given below
pentagonal intuitionist fuzzy numbers to deal problems
u i + v j = ci j u1 = 0 and handling real life transportation problem having
intuitionistic fuzzy numbers.
c14 = u1 + v4 ⇒ 13 = 0 + v4 ⇒ v4 = 13 REFERENCES:
[1] Fuzzy sets and K.Atanassov.1989. More on
c21 = u2 + v1 ⇒ 17 = 15 + v1 ⇒ v1 = 2 Intuitionistic Fuzzy sets, Fuzzy sets and systems, 33,
pp.37-46.
c22 = u 2 + v2 ⇒ 18 = 15 + v2 ⇒ v2 = 3
[2] Atanassov. K. T. “Intuitionistic Fuzzy Sets”, Fuzzy
c24 = u 2 + v4 ⇒ 28 = u 2 + 18 ⇒ u 2 = 15 sets and systems, Vol.20 (1), pp: 87-96,(1986)
[3] A. Thamaraiselvi and R. Santhi, “On Intuitionistic
c32 = u3 + v2 ⇒ 27 = u3 + 3 ⇒ u3 = 24 Fuzzy Transportation Problem Using Hexagonal
Intuitionistic Fuzzy Numbers”, International Journal
c33 = u3 + v2 ⇒ 18 = 24 + v3 ⇒ v3 = −6 of Fuzzy Logic systems (IJFLS) Vol.5, No.1, January
2015.
Z11 − C11 = u1 + v1 − c11 = 0 + 2 − 21 = −19 [4] ThangarajBeaula – M. Priyadharshini, “A New
Algorithm for Finding a Fuzzy Optimal Solution for
Z12 − C12 = u1 + v2 − c12 = 0 + 3 − 16 = −13 Intuitionistic Fuzzy Transportation Problems,
International Journal of Applications of Fuzzy Sets
Z13 − C13 = u1 + v3 − c13 = 0 + (−6) − 25 = −31 and Artificial Intelligence (ISSN 2241-1240),
Vol.5(2015),183- 192.
C23 − C23 = u 2 + v3 − c23 = 15 + (−6) − 14 = −15
[5] M. R. Seikh, P.K. Nayak and M. Pal., Notes on
Z 31 − C31 = u3 + v1 − c31 = 24 + 2 − 32 = −6 triangular intuitionistic fuzzy numbers,
International Journal of Mathematics in Operational
Z 34 − C34 = u3 + v4 − c34 = 24 + 13 − 41 = −4 Research, to appear
[6] P. Burillo, H. Bustince and V. Mohedano.(1994)
d ij = cij − (u i + v j ) For each empty cell and enter at the Some definition of intuitionistic fuzzy number,
bottom right corner of the cell. Fuzzy based
Applying MODI method, table corresponding to [7] Dr. M. S. Annie Christi Int. “Transportation Problem
optimal solution is with Pentagonal Intuitionistic Fuzzy Numbers
Table 3 - MODI Method Solved Using Ranking Technique and Russell’s
Method, Journal of Engineering Research and
B1 B2 B3 B4 Supply Applications, ISSN: 2248 – 9622, Vol.6.Issue 2,
[-19] [-13] [-31] [11] (part-4), Feb 2016, pp.82-86.
A1 21 16 25 13 11
[8] NagoorGani. A, Abbas. S, (2013) “A New method for
[6] [3] [-5] [4]
A2 17 18 14 28 13
solving in Fuzzy Transportation Problem”, Applied
Mathematics Sciences, vol.7, No.28, pp.1357 – 1365.
[-6] [7] [12] [-4]
A3 [9] O’heigeartaigh. H,(1982) “A Fuzzy Transportation
32 27 18 41 19
Algorithm” Fuzzy Sets and Systems, pp.235-243.
Demand
6 10 12 15 43 [10] L. A. Zadeh, “Fuzzy sets, Information and Control”, 8,
338-353, 1965.
@ IJTSRD | Unique Paper ID – IJTSRD41094 | Volume – 5 | Issue – 3 | March-April 2021 Page 1075