Professional Documents
Culture Documents
Heptagonal Fuzzy Numbers by Max Min Method
Heptagonal Fuzzy Numbers by Max Min Method
Heptagonal Fuzzy Numbers by Max Min 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)
x ℜ with ( 0)=1
making decisions for real-life multi-objective
objective functions, etc. 1. ( 0) is piecewise continuous
are seeking a solution by the transportation problem. In 2. There exist at least one x0∈
real-life problems, Zadeh (9) and (10) had introduced the 3. A must be regular &convex
uncertainty theory, which is very useful for copying a large
A Triangular fuzzy number ̅ is denoted by 3 – tuples
number of data. 3.3. TRIANGULAR FUZZY NUMBER [TFN]:
x %
# % &'(
is written as follows, Introduction to the concepts were
4
" "
given in section 1.Some basic concepts in section 2, An
! 0 '*+,(-./,
,(-./, 3
algorithm is proposed in section 3, A numerical example is
illustrated in section 4,finally conclusion in section 5
Let X be a nonempty set. A fuzzy set ̅ of Xis defined A trapezoidal Fuzzy number is denoted by 4 tuples ̅ =
II. FUZZY SET : 3.4. TRAPEZOIDAL FUZZY NUMBER [TRFN]:
" % "
" % &'( "
Range Technique:
" "
1 &'(
The range is defined as the difference between the
x %
# 4
maximum value and minimum value.
0
" 0 % "
Range = Maximum amount – Minimum amount.
" &'( "
" 8% "
0 III. MAX-MIN ALGORITHM
" &'( 0 8"
" 8 % 0 "
Step (1)
! 0 &'( 3
Construct the transportation table we examine whether
8
total demand equals total supply then go to step 2
( , , , 0 , 8 , : . Where , , , 0 , 8 : are
By using range technique, we convert the fuzzy cost can be
0 8 : with
converted into crisp values to the given transportation
real numbers and problem
membership function is given below,
1 %
Step (3)
$ &'( 5
For the row-wise difference between maximum and
" 2 % "
minimum of each row, and it is divided by the number of
"1 1 % "
"2 2+ &'( "
columns of the cost matrix.
%
" "
1 &'(
Step (4)
x 0
1 %
For the column-wise difference between maximum and
#1 % 0
&'( 0 4
minimum of each column, and it is divided by the number
" 2 8 % 0 8
"
" 1 :% "
of rows of the cost matrix.
( , , , 0 , 8 , : , = .
anyone.
0 8 :
Step (6)
= with membership Repeated procedures 1 to 5 until all the allocations are
function is given below, completed.
IV. NUMERICAL EXAMPLE
Consider the Balanced fuzzy transportation problem Product is produced by three warehouses Warehouse1,
Warehouse2,Warehouse3.Production capacity of the Three Warehouse are 12,10 and 32 units, respectively. The product is
supplied to Four stores Store1, Store2, Store3, and Store 4 the requirements of Demands, which are 10,13,16 and 15
respectively. Here Unit costs of fuzzy transportation are represented as fuzzy heptagonal numbers are given below. Find
the fuzzy transportation plan such that the total production and transportation cost is minimum.
Destination
Store 1 Store 2 Store 3 Store 4 Capacity
Source
Warehouse 1 (1,2,3,4,5,6,8) (1,4,5,6,7,8,9) (1,3,5,7,8,9,10) (2,3,4,5,6,7,8) 12
Warehouse 2 (3,4,6,8,9,10,12) (1,2,3,5,7,9,11) (0,2,3,4,5,7,8) (2,6,7,9,10,11,13) 10
Warehouse 3 (2,7,9,10,12,14,15) (4,7,9,10,12,14,16) (6,8,10,12,14,16,20) (4,5,7,9,10,11,13) 32
Demand 10 13 16 15 54
By using Range technique, we have to convert fuzzy Heptagonal numbers into a crisp value.
@ IJTSRD | Unique Paper ID – IJTSRD38280 | Volume – 5 | Issue – 3 | March-April 2021 Page 910
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
TABLE: 1
Destination
Store 1 Store 2 Store 3 Store 4 Capacity
Source
Warehouse 1 7 8 9 6 12
Warehouse 2 9 10 8 11 10
Warehouse 3 13 12 14 9 32
Demand 10 13 16 15 54
ABC % DEF
G
Destination
Store 1 Store 2 Store 3 Store 4 Capacity
3
Source
0.75
4
[10] 12
Warehouse 1 8 9 6
3
7 [2]
0.75
4
Warehouse 2 9 10 8 11 10
5
1.25
4
Warehouse 3 13 12 14 9 32
M % N. 6 4 6 5
Demand 10 13 16 15
2 1.33 2 1.66
3 3 3 3 3
ABC % DEF
TABLE: 2
P
Destination
Store 1 Store 2 Store 3 Store 4 Capacity
Source
1
[10]
Warehouse 1 8 9 12[2]
7 6
1
5
Warehouse 2 9 10 8 [10] 11 10
1.66
3
Warehouse 3 13 12 14 9 32
M % N. 6 4 6 5
Demand 10 13 16[6] 15
2 1.33 2 1.66
3 3 3 3 3
@ IJTSRD | Unique Paper ID – IJTSRD38280 | Volume – 5 | Issue – 3 | March-April 2021 Page 911
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
Cost
560
555
550
545
540
535
530
525
520
515
510
505
500
North-West LCM VAM MAX-MIN
@ IJTSRD | Unique Paper ID – IJTSRD38280 | Volume – 5 | Issue – 3 | March-April 2021 Page 912