Int. J. Fuzzy Log. Intell. Syst. 2016; 16(4): 225-237
Published online December 25, 2016
https://doi.org/10.5391/IJFIS.2016.16.4.225
© The Korean Institute of Intelligent Systems
P. Senthil Kumar
PG and Research Department of Mathematics, Jamal Mohamed College (Autonomous), Tiruchirappalli, Tamil Nadu, India
Correspondence to :
P. Senthil Kumar, (senthilsoft_5760@yahoo.com)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/ by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer’s over time work, unexpected failures in machine, seasonal changes and many more. To counter these problems, depending on the nature of the parameters, the TP is classified into two categories namely type-2 and type-4 fuzzy transportation problems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992) is used to transform the type-2 and type-4 FTPs into a crisp one so that the conventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.
Keywords: Fuzzy set, Trapezoidal fuzzy number, Type-2 fuzzy transportation problem, Type-4 fuzzy transportation problem, PSK method, Optimal solution
The transportation problem is a special kind of linear programming problem that deals with shipping a homogenous product from any group of sources (Factories) to any group of destinations (Warehouses). The objective of the transportation problem is to determine the shipping schedule that minimizes the total transportation cost (or maximizes the total transportation profit) while satisfying supply and demand limits.
In literature, Hitchcock [1] originally developed the basic transportation problem. Arsham and Kahn [2] proposed a simplex type algorithm for general transportation problems. Charnes and Cooper [3] developed the stepping stone method which provides an alternative way of determining the simplex method information. Appa [4] discussed several variations of the transportation problem. An introduction to operations research Taha [5] deals the transportation problem.
In today’s real world problems such as in corporate or in industry many of the distribution problems are imprecise in nature due to variations in the parameters. To deal quantitatively with imprecise information in making decision, Zadeh [6] introduced the fuzzy set theory and has applied it successfully in various fields. The use of fuzzy set theory becomes very rapid in the field of optimization after the pioneering work done by Bellman and Zadeh [7]. The fuzzy set deals with the degree of membership (belongingness) of an element in the set. In a fuzzy set the membership value (level of acceptance or level of satisfaction) lies between 0 and 1 where as in crisp set the element belongs to the set represent 1 and the element not belongs to the set represent 0.
Due to the applications of fuzzy set theory, Dinagar and Palanivel [8] investigated the transportation problem in fuzzy environment using trapezoidal fuzzy numbers (TrFN). Pandian and Natarajan [9] proposed a new algorithm for finding a fuzzy optimal solution for fuzzy transportation Problem (FTP) where all the parameters are TrFNs. Mohideen and Kumar [10] did a comparative study on transportation problem in fuzzy environment. Gani and Razak [11] obtained a fuzzy solution for a two stage cost minimizing FTP in which availabilities and requirements are TrFNs using a parametric approach. Sudhakar and Kumar [12] proposed a different approach for solving two stage FTPs in which supplies and demands are TrFNs. Rani et al. [13] presented a method for unbalanced transportation problems in fuzzy environment taking all the parameters are TrFNs. Gani et al. [14] presented simplex type algorithm for solving FTP where all the parameters are triangular fuzzy numbers. Solaiappan and Jeyaraman [15] did a new optimal solution method for trapezoidal FTP. Basirzadeh [16] discussed an approach for solving FTP where all the parameters are TrFNs.
OhEigeartaigh [17] presented an algorithm for solving transportation problems where the availabilities and requirements are fuzzy sets with linear or triangular membership functions. Chanas et al. [18] presented a fuzzy linear programming model for solving transportation problems with fuzzy supply, fuzzy demand and crisp costs. Saad and Abass [19] proposed an algorithm for solving the transportation problems under fuzzy environment. Das and Baruah [20] discussed Vogel’s approximation method to find the fuzzy initial basic feasible solution of FTP in which all the parameters (supply, demand and cost) are represented by triangular fuzzy numbers. De and Yadav [21] modified the existing method (Kikuchi [22]) by using TrFNs instead of triangular fuzzy numbers. Chanas et al. [23] formulated the FTPs in three different situations and proposed method for solving the FTPs. Chanas and Kuchta [24] proposed the concept of the optimal solution for the transportation problem with fuzzy coefficients expressed as fuzzy numbers, and developed an algorithm for obtaining the optimal solution.
Chanas and Kuchta [25] developed a new method for solving fuzzy integer transportation problem by representing the supply and demand parameters as L-R type fuzzy numbers. Chiang [26] proposed a method to find the optimal solution of transportation problems with fuzzy requirements and fuzzy availabilities. Li et al. [27] proposed a new method based on goal programming approach for solving FTPs with fuzzy costs. Chen et al. [28] proposed the methods for solving transportation problems on a fuzzy network. Lin [29] used genetic algorithm for solving transportation problems with fuzzy coefficients. Kumar [30] formulated the FTPs in two different situations and proposed method namely PSK method for solving the formulated FTPs. Chen and Hsieh [31] discussed “Graded mean integration representation of generalized fuzzy numbers” which is used to compare any two TrFNs. Therefore, the number of authors has solved FTPs. To the best of our knowledge, some of the authors discussed a simple method for solving FTP but none of them proved mathematically the solution obtained by simple method for solving FTP is optimal. In addition to that all the existing literature deals with conversion of FTP into crisp TP and it finds only the occupied cells but they couldn’t find out how to allot the maximum possible value (supply or demand) to the occupied cells. So, the existing literature offers solution for limited number of sources and destinations only through inspection. But in our real life there is always a fair chance to have large number of sources and destinations. To counter this difficulty, in this paper proposed a solution by using PSK method.
In this paper, a new method called PSK method is proposed to find the optimal objective value of type-2 and type-4 FTP in single stage. The existing ranking procedure of Liou and Wang [32] is used to transform the type-2 and type-4 FTP into a crisp one so that the conventional method may be applied to solve the transportation problem. The occupied cells of crisp TP that we obtained are as same as the occupied cells of type-2 and type-4 FTP, but the value of occupied cells for type-2 and type-4 FTP is the maximum possible value of supply (or fuzzy supply) and demand (or fuzzy demand). On the basis of this idea the solution procedure differs from TP to FTP in allocation step only. Therefore, the new method called PSK method and new multiplication operation on TrFN is proposed to find the optimal solution in terms of TrFNs. The necessary theorems are proved for the solution obtained by PSK method for solving a type-2 and type-4 FTP with equality constraints is an optimal solution (or fuzzy optimal solution) for the FTP. The optimum object value obtained by proposed method is always positive i.e., all entries of the objective value is in positive. It is much easier to apply the proposed method when compared to all the existing methods.
Rest of the paper is organized as follows: Section 2 deals with some terminology and new multiplication operation, Section 3 consists of ranking procedure and ordering principles of TrFN. Section 4 provides the definition of type-2 and type-4 FTP and its mathematical formulation, Section 5 consists of the PSK method, Section 6 provides the numerical example, results and discussion, finally the conclusion is given in Section 7.
In this section, some basic definitions and new multiplication operation is given.
Let A be a classical set
A normal fuzzy set is one whose membership function has at least one element X in the universe whose membership value is unity. i.e., there exists an
A fuzzy set
The fuzzy number
i)
ii)
iii)
A real fuzzy number
i)
ii)
iii)
iv)
v)
vi)
We define a ranking function
Defuzzification is the conversion of a fuzzy quantity into crisp quantity.
Let
If
It is denoted by
If
Let
a) Addition:
b) Subtraction:
c) New multiplication:
Scalar multiplication:
The following definitions are used to compare any two TrFNs.
A trapezoidal fuzzy number
A trapezoidal fuzzy number
Two trapezoidal fuzzy numbers
A ranking function is a function ℜ :
Let
Let
ℜ(
ℜ(
ℜ(
where
The ranking function ℜ :
Let
We know that (Wkt)
Wkt
Since
Similarly it can be proved for
The following basic terminologies used in this article are defined in this section.
If the transportation problem has at least one of the parameter (cost) or two of the parameters (supply and demand) or all of the parameters (supply, demand and cost) are in fuzzy numbers then the problem is called FTP.
Further, FTP can be classified into four categories. They are
Type-1 FTP
Type-2 FTP
Type-3 FTP (mixed FTP)
Type-4 FTP (fully FTP)
A transportation problem having fuzzy availabilities and fuzzy demands but crisp costs is termed as fuzzy transportation problem of type-1.
A transportation problem having crisp availabilities and crisp demands but fuzzy costs is termed as fuzzy transportation problem of type-2.
The transportation problem is said to be the type-3 fuzzy transportation problem or mixed fuzzy transportation problem if all the parameters of the transportation problem (such as supplies, demands and costs) must be in the mixture of crisp numbers, triangular fuzzy numbers and trapezoidal fuzzy numbers.
The transportation problem is said to be the type-4 fuzzy transportation problem or fully fuzzy transportation problem if all the parameters of the transportation problem (such as supplies, demands and costs) must be in fuzzy numbers.
The transportation problem is said to be balanced fuzzy transportation problem if total fuzzy supply is equal to total fuzzy demand.
That is,
The transportation problem is said to be an unbalanced fuzzy transportation problem if total fuzzy supply is not equal to total fuzzy demand.
That is,
A set of fuzzy non negative allocations
Any feasible solution is a fuzzy basic feasible solution if the number of non negative allocations is at most (
If the fuzzy basic feasible solution contains less than (
Any fuzzy feasible solution to a transportation problem containing
The fuzzy basic feasible solution is said to be fuzzy optimal solution if it minimizes the total fuzzy transportation cost (or) it maximizes the total fuzzy transportation profit.
Consider the transportation problem with
Mathematically fully fuzzy transportation problem can be stated as (FFTP)
(P) Minimize
Subject to,
where
When the supplies, demands and costs are fuzzy numbers, then the total cost becomes the fuzzy number.
Consider the transportation problem with
(P*) Minimize
Subject to,
Since ℜ(
where,
The above FFTP and its equivalent crisp TP can be stated in the below tabular form in Tables 1 and 2.
This proposed method is used for finding the optimal basic feasible solution in fuzzy environment and the following step by step procedure is utilized to find out the same.
Consider the TP having all the parameters such as supply, demand and costs must be in fuzzy numbers (This situation is known as FFTP).
Examine whether the total fuzzy supply equals total fuzzy demand. If not, introduce a dummy row/column having all its cost elements as fuzzy zero and fuzzy supply/fuzzy demand as the positive difference of fuzzy supply and fuzzy demand.
After using Step 2, transform the FFTP into its equivalent crisp TP using the ranking procedure as mentioned in Section 3.
Now, the crisp TP having all the entries of supply, demand and costs are integers then kept as it is. Otherwise at least one or all of the supply, demand and costs are not in integers then rewrite its nearest integer value.
After using Step 4 of the proposed method, now solve the crisp TP by using any one of the existing methods (MODI, Zero Point Method) or software packages such as TORA, LINGO and so on. This step yields the optimal allocation and optimal objective value of the crisp TP (The optimal allotted cell in crisp transportation table is referred as occupied cells. The remaining cells are called unoccupied cells. The numbers of occupied cells in crisp TP which are exactly
After using Step 5 of the proposed method, now we check the allotment table if one or more rows/columns having exactly one occupied cell (fuzzy zero) then allot the maximum possible value to that cell and adjust the corresponding supply or demand with a positive difference of supply and demand. Otherwise, if all the rows/columns having more than one occupied cells then select a cell in the
Allot the maximum possible value to the occupied cells in type-2 and type-4 FTP which is the most preferable row/column having exactly one occupied cell.
From the MODI method, we conclude that the TP have exactly
From the zero point method, we can make exactly
From Remark 5.2 and Remark 5.3, we can directly replace the fuzzy zeros instead of original costs in the occupied cells in the original FTP. This modification does not affect the originality of the problem
Now, we prove the following theorems which are used to derive the solution to a fuzzy transportation problem obtained by the PSK method is a fuzzy optimal solution to the FFTP.
Any optimal solution to the fully fuzzy transportation (P1) where
(P1) Minimize
Subject to (
(P) Minimize
Subject to (
Let
Now,
Since
If {
Let {
Now, we prove that the solution to the FFTP obtained by the PSK method is a fully fuzzy optimal solution to the FFTP.
A solution obtained by the PSK method for a FFTP with equality constraints (P) is a fully fuzzy optimal solution for the fully fuzzy transportation problem (P).
Let us, now describe the PSK method in detail.
We construct the fully fuzzy transportation table [
Now, the crisp TP having all the entries of supply, demand and costs are integers then kept as it is. Otherwise at least one or all of the supply, demand and costs are not in integers then rewrite its nearest integer value because decimal values in transportation problem has no physical meaning (such a transportation problem referred as crisp TP).
Now, solve the crisp TP by using any one of the existing methods (MODI, Zero Point Method) or software packages such as TORA, LINGO and so on. This process will yield the optimal allotment and optimal objective value of the crisp TP (The optimal allotted cells in crisp transportation table is referred to as occupied cells which are exactly
By the definitions, occupied cells in crisp TP is same as that of occupied cells in FFTP but the value of occupied cells for FFTP is the maximum possible value of fuzzy supply and fuzzy demand. Therefore, we need not further investigate the occupied cells in FFTP. But only we claim that how much quantity (fuzzy supply, fuzzy demand) to allot the occupied cells subject to (
Now, we check the allotment table if one or more rows/columns having exactly one occupied cell then allot the maximum possible value to that cell and adjust the corresponding supply or demand with a positive difference of supply and demand. Otherwise, if all the rows/columns having more than one occupied cells then select a cell in the
Clearly, the above process satisfies all the rim requirements (row and column sum restriction). If all the rim requirements are satisfied then automatically it satisfies, total fuzzy supply is equal to total fuzzy demand i.e., the necessary and sufficient condition for a FFTP is satisfied.
Finally, we have a solution {
Therefore, the minimum
The proposed method is illustrated by the following numerical examples.
A firm has three factories
Find the optimal allocation which minimizes total fuzzy transportation cost.
Solution by proposed method:
Now using Step 2 we get,
Now, using Step 3 of proposed method, in conformation to Model (
Since in transportation problems supplies, demands and costs are not in decimal values because no physical meaning of fractional value. Therefore whenever the rank values occur in the form of decimal then we convert it into its nearest integer value. Otherwise, all the rank values of the FFTP is in integers then kept as it is.
After using Step 5 of the proposed method, the optimal allotment of the above problem is
The optimum solution is
The minimum objective value
After using Step 5 of the proposed method, now using Step 6, we get the optimal allotment directly for the FFTP is shown in the following table.
The fuzzy optimal solution in terms of trapezoidal fuzzy number is
Hence, the total fuzzy transportation cost is
There are three sources (rows) and four destinations (columns), all the sources are connected to all the destinations by roads and the goods are transported by trucks. The supply and demand of goods are well known crisp quantities but the transportation cost is not known exactly (due to variations in rates of petrol, traffic jams, weather in hilly areas etc). Hence crisp supply, crisp demand and unit transportation cost (given in terms of TrFNs) are given in the following table. Find the optimal allocation which minimizes total fuzzy transportation cost.
Solution by proposed method:
Now using Step 2, we get,
Now, using Step 3 and Step 4 of the proposed method, we get the following crisp TP (P).
After using Step 4 of the proposed method, now using Step 5 we have
The optimal solution is
The total transportation cost Min
Now, construct the new transportation table (P*) whose occupied cells costs are zeros and the remaining cells costs are its original cost. Subtract each row entries for the current table from the row minimum. Next subtract each column entries of the reduced table from the column minimum. Clearly, each row and each column of the resulting table has at least one fuzzy zero. The current resulting table is the allotment table.
Now using Step 6 of the proposed method we get
The total transportation cost Min
Therefore, Any optimal solution of problem (P*) (subject to all the constraints are satisfied) is also an optimal solution of problem (P) (subject to all the constraints are satisfied).
Hence the solution obtained by PSK method for solving FTP is always optimal. The optimal allotment is
(We could not minimize fuzzy cost below fuzzy zero).
Hence, the optimal solution is
The total fuzzy transportation cost is
The minimum total fuzzy transportation cost (Rupees in hundreds) of problem 1 is
The result in (
(a) Transportation cost (Rupees in hundreds) lies in [12, 117].
(b) 100% expect are in favour that the transportation cost (Rupees in hundreds) is [55, 88] as
(c) Assuming that
Values of
By using the proposed method a decision maker has the following advantages:
The optimum objective value of the type-2 and type-4 FTP is non-negative TrFN i.e., there is no negative part in the obtained TrFN.
The proposed method is computationally very simple and easy to understand. The solution obtained by PSK method for solving FTP is always optimal. Hence we need not check optimality criteria.
On the basis of the present study, it can be concluded that the FTP and FFTP which can be solved by the existing methods (Pandian and Natarajan [9], Dinagar and Palanivel [8], Rani et al. [13], Basirzadeh [16], Gani and Razak [11]) can also be solved by the proposed method. However, it is much easier to apply the proposed method as compared to all the existing methods. Also, new method and new multiplication operation on TrFN is proposed to compute the optimal objective values in terms of TrFN which are very simple and easy to understand and it can be easily applied by decision maker to solve type-2 and type-4 FTP. The solution obtained by this method the objective value of the FFTP remains always positive i.e., there is no negative part in the TrFN. Hence the proposed method is physically meaningful and computationally very simple when compared to all the existing methods.
The author would like to thank to the Editor-in-Chief “Professor Keon-Myung Lee” and the anonymous reviewers for their suggestions which have led to an improvement in both the quality and clarity of the paper.
No potential conflict of interest relevant to this article was reported.
Table 1. Tabular representation of FFTP.
Source | Destination | Fuzzy availability | |||
---|---|---|---|---|---|
· · · | |||||
· · · | |||||
· · · | |||||
⋮ | ⋮ | ⋮ | · · · | ⋮ | ⋮ |
· · · | |||||
Fuzzy demand | · · · |
Table 2. Tabular representation of crisp TP.
Source | Destination | Availability ( | |||
---|---|---|---|---|---|
· · · | |||||
ℜ( | ℜ( | · · · | ℜ( | ℜ( | |
ℜ( | ℜ( | · · · | ℜ( | ℜ( | |
⋮ | ⋮ | ⋮ | · · · | ⋮ | ⋮ |
ℜ( | ℜ( | · · · | ℜ( | ℜ( | |
Demand ℜ( | ℜ( | ℜ( | · · · | ℜ( |
Table 3. Type-4 FTP.
Factories | Warehouses | Fuzzy Availability | |||
---|---|---|---|---|---|
[0, 1, 3, 4] | [0, 1, 3, 4] | [0, 1, 3, 4] | [0, 0, 2, 2] | [0, 2, 4, 6] | |
[4, 8, 12, 16] | [4, 7, 9, 12] | [2, 4, 6, 8] | [1, 3, 5, 7] | [2, 4, 9, 13] | |
[2, 4, 9, 13] | [0, 6, 8, 10] | [0, 6, 8, 10] | [4, 7, 9, 12] | [2,4, 6, 8] | |
Fuzzy Demand | [1, 3, 5, 7] | [0, 2, 4, 6] | [1, 3, 5, 7] | [1, 3, 5, 7] |
Table 4. Crisp version of type-4 FTP.
Factories | Warehouses | Availability | |||
---|---|---|---|---|---|
2 | 2 | 2 | 1 | 3 | |
10 | 8 | 5 | 4 | 7 | |
7 | 6 | 6 | 8 | 5 | |
Demand | 4 | 3 | 4 | 4 |
Table 5. Crisp optimum table of type-4 FTP.
Factories | Warehouses | Availability | |||
---|---|---|---|---|---|
0 | 2 | 2 | 1 | 3 | |
10 | 8 | 0 | 0 | 7 | |
0 | 0 | 0 | 8 | 5 | |
Demand | 4 | 3 | 4 | 4 |
Table 6. Fuzzy optimum table of type-4 FTP.
Factories | Warehouses | Fuzzy Availability | |||
---|---|---|---|---|---|
[0, 2, 4, 6] | |||||
[−2, −1, 1, 2] | [0, 1, 3, 4] | [0, 1, 3, 4] | [0, 0, 2, 2] | ||
[2, 4, 9, 13] | |||||
[4, 8, 12, 16] | [4, 7, 9, 12] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | ||
[2, 4, 6, 8] | |||||
[−2, −1, 1, 2] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | [4, 7, 9, 12] | ||
Fuzzy demand | [1, 3, 5, 7] | [0, 2, 4, 6] | [1, 3, 5, 7] | [1, 3, 5, 7] |
Table 7. Type-2 FTP.
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
[1, 2, 4, 5] | [1, 4, 6, 9] | [3, 6, 10, 13] | [5, 8, 16, 19] | 3 | |
[0, 2, 4, 6] | [2, 4, 10, 12] | [7, 10, 12, 15] | [1, 4, 8, 11] | 5 | |
[2, 4, 6, 8] | [4, 6, 10, 12] | [0, 10, 20, 30] | [4, 8, 12, 16] | 12 | |
5 | 4 | 3 | 8 |
Table 8. Crisp version of type-2 FTP (P).
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
3 | 5 | 8 | 12 | 3 | |
3 | 7 | 11 | 6 | 5 | |
5 | 8 | 15 | 10 | 12 | |
5 | 4 | 3 | 8 |
Table 9. Crisp optimum table of type-2 FTP (P*).
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
3 | 5 | 0 | 12 | 3 | |
3 | 7 | 11 | 0 | 5 | |
0 | 0 | 0 | 0 | 12 | |
5 | 4 | 3 | 8 |
Table 10. Crisp optimum allocation table of type-2 FTP.
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
3 | 5 | 0 | 12 | 3 | |
3 | 7 | 11 | 0 | 5 | |
0 | 0 | 0 | 0 | 12 | |
5 | 4 | 3 | 8 |
Table 11. Fuzzy optimum table of type-2 FTP.
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
[1, 2, 4, 5] | [1, 4, 6, 9] | [5, 8, 16, 19] | 3 | ||
[−2, −1, 1, 2] | |||||
[0, 2, 4, 6] | [2, 4, 10, 12] | [7, 10, 12, 15] | 5 | ||
[−2, −1, 1, 2] | |||||
12 | |||||
[−2, −1, 1, 2] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | ||
5 | 4 | 3 | 8 |
Table 12. Comparative study.
Problem Number | Ranking method | Solution methods | |||||
---|---|---|---|---|---|---|---|
Liou and Wang [32] | VAM | MODI | Zero Point Method | Fuzzy Zero Point Method | Fuzzy Modified Distribution Method | PSK Method | |
1 | 68 (Rupees in hundreds) | 68 (Rupees in hundreds) | 68 (Rupees in hundreds) | [12,55,88,117] | [12,55,88,117] | [12,55,88,117] | |
2 | 141 | 141 | 141 | [52,106,176,230] 141 | [52,106,176,230] 141 | [52,106,176,230] 141 |
Mobile: +91-9047398494
E-mails: senthilsoft 5760@yahoo.com, senthilsoft1985@gmail.com
Int. J. Fuzzy Log. Intell. Syst. 2016; 16(4): 225-237
Published online December 25, 2016 https://doi.org/10.5391/IJFIS.2016.16.4.225
Copyright © The Korean Institute of Intelligent Systems.
P. Senthil Kumar
PG and Research Department of Mathematics, Jamal Mohamed College (Autonomous), Tiruchirappalli, Tamil Nadu, India
Correspondence to:P. Senthil Kumar, (senthilsoft_5760@yahoo.com)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/ by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer’s over time work, unexpected failures in machine, seasonal changes and many more. To counter these problems, depending on the nature of the parameters, the TP is classified into two categories namely type-2 and type-4 fuzzy transportation problems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992) is used to transform the type-2 and type-4 FTPs into a crisp one so that the conventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.
Keywords: Fuzzy set, Trapezoidal fuzzy number, Type-2 fuzzy transportation problem, Type-4 fuzzy transportation problem, PSK method, Optimal solution
The transportation problem is a special kind of linear programming problem that deals with shipping a homogenous product from any group of sources (Factories) to any group of destinations (Warehouses). The objective of the transportation problem is to determine the shipping schedule that minimizes the total transportation cost (or maximizes the total transportation profit) while satisfying supply and demand limits.
In literature, Hitchcock [1] originally developed the basic transportation problem. Arsham and Kahn [2] proposed a simplex type algorithm for general transportation problems. Charnes and Cooper [3] developed the stepping stone method which provides an alternative way of determining the simplex method information. Appa [4] discussed several variations of the transportation problem. An introduction to operations research Taha [5] deals the transportation problem.
In today’s real world problems such as in corporate or in industry many of the distribution problems are imprecise in nature due to variations in the parameters. To deal quantitatively with imprecise information in making decision, Zadeh [6] introduced the fuzzy set theory and has applied it successfully in various fields. The use of fuzzy set theory becomes very rapid in the field of optimization after the pioneering work done by Bellman and Zadeh [7]. The fuzzy set deals with the degree of membership (belongingness) of an element in the set. In a fuzzy set the membership value (level of acceptance or level of satisfaction) lies between 0 and 1 where as in crisp set the element belongs to the set represent 1 and the element not belongs to the set represent 0.
Due to the applications of fuzzy set theory, Dinagar and Palanivel [8] investigated the transportation problem in fuzzy environment using trapezoidal fuzzy numbers (TrFN). Pandian and Natarajan [9] proposed a new algorithm for finding a fuzzy optimal solution for fuzzy transportation Problem (FTP) where all the parameters are TrFNs. Mohideen and Kumar [10] did a comparative study on transportation problem in fuzzy environment. Gani and Razak [11] obtained a fuzzy solution for a two stage cost minimizing FTP in which availabilities and requirements are TrFNs using a parametric approach. Sudhakar and Kumar [12] proposed a different approach for solving two stage FTPs in which supplies and demands are TrFNs. Rani et al. [13] presented a method for unbalanced transportation problems in fuzzy environment taking all the parameters are TrFNs. Gani et al. [14] presented simplex type algorithm for solving FTP where all the parameters are triangular fuzzy numbers. Solaiappan and Jeyaraman [15] did a new optimal solution method for trapezoidal FTP. Basirzadeh [16] discussed an approach for solving FTP where all the parameters are TrFNs.
OhEigeartaigh [17] presented an algorithm for solving transportation problems where the availabilities and requirements are fuzzy sets with linear or triangular membership functions. Chanas et al. [18] presented a fuzzy linear programming model for solving transportation problems with fuzzy supply, fuzzy demand and crisp costs. Saad and Abass [19] proposed an algorithm for solving the transportation problems under fuzzy environment. Das and Baruah [20] discussed Vogel’s approximation method to find the fuzzy initial basic feasible solution of FTP in which all the parameters (supply, demand and cost) are represented by triangular fuzzy numbers. De and Yadav [21] modified the existing method (Kikuchi [22]) by using TrFNs instead of triangular fuzzy numbers. Chanas et al. [23] formulated the FTPs in three different situations and proposed method for solving the FTPs. Chanas and Kuchta [24] proposed the concept of the optimal solution for the transportation problem with fuzzy coefficients expressed as fuzzy numbers, and developed an algorithm for obtaining the optimal solution.
Chanas and Kuchta [25] developed a new method for solving fuzzy integer transportation problem by representing the supply and demand parameters as L-R type fuzzy numbers. Chiang [26] proposed a method to find the optimal solution of transportation problems with fuzzy requirements and fuzzy availabilities. Li et al. [27] proposed a new method based on goal programming approach for solving FTPs with fuzzy costs. Chen et al. [28] proposed the methods for solving transportation problems on a fuzzy network. Lin [29] used genetic algorithm for solving transportation problems with fuzzy coefficients. Kumar [30] formulated the FTPs in two different situations and proposed method namely PSK method for solving the formulated FTPs. Chen and Hsieh [31] discussed “Graded mean integration representation of generalized fuzzy numbers” which is used to compare any two TrFNs. Therefore, the number of authors has solved FTPs. To the best of our knowledge, some of the authors discussed a simple method for solving FTP but none of them proved mathematically the solution obtained by simple method for solving FTP is optimal. In addition to that all the existing literature deals with conversion of FTP into crisp TP and it finds only the occupied cells but they couldn’t find out how to allot the maximum possible value (supply or demand) to the occupied cells. So, the existing literature offers solution for limited number of sources and destinations only through inspection. But in our real life there is always a fair chance to have large number of sources and destinations. To counter this difficulty, in this paper proposed a solution by using PSK method.
In this paper, a new method called PSK method is proposed to find the optimal objective value of type-2 and type-4 FTP in single stage. The existing ranking procedure of Liou and Wang [32] is used to transform the type-2 and type-4 FTP into a crisp one so that the conventional method may be applied to solve the transportation problem. The occupied cells of crisp TP that we obtained are as same as the occupied cells of type-2 and type-4 FTP, but the value of occupied cells for type-2 and type-4 FTP is the maximum possible value of supply (or fuzzy supply) and demand (or fuzzy demand). On the basis of this idea the solution procedure differs from TP to FTP in allocation step only. Therefore, the new method called PSK method and new multiplication operation on TrFN is proposed to find the optimal solution in terms of TrFNs. The necessary theorems are proved for the solution obtained by PSK method for solving a type-2 and type-4 FTP with equality constraints is an optimal solution (or fuzzy optimal solution) for the FTP. The optimum object value obtained by proposed method is always positive i.e., all entries of the objective value is in positive. It is much easier to apply the proposed method when compared to all the existing methods.
Rest of the paper is organized as follows: Section 2 deals with some terminology and new multiplication operation, Section 3 consists of ranking procedure and ordering principles of TrFN. Section 4 provides the definition of type-2 and type-4 FTP and its mathematical formulation, Section 5 consists of the PSK method, Section 6 provides the numerical example, results and discussion, finally the conclusion is given in Section 7.
In this section, some basic definitions and new multiplication operation is given.
Let A be a classical set
A normal fuzzy set is one whose membership function has at least one element X in the universe whose membership value is unity. i.e., there exists an
A fuzzy set
The fuzzy number
i)
ii)
iii)
A real fuzzy number
i)
ii)
iii)
iv)
v)
vi)
We define a ranking function
Defuzzification is the conversion of a fuzzy quantity into crisp quantity.
Let
If
It is denoted by
If
Let
a) Addition:
b) Subtraction:
c) New multiplication:
Scalar multiplication:
The following definitions are used to compare any two TrFNs.
A trapezoidal fuzzy number
A trapezoidal fuzzy number
Two trapezoidal fuzzy numbers
A ranking function is a function ℜ :
Let
Let
ℜ(
ℜ(
ℜ(
where
The ranking function ℜ :
Let
We know that (Wkt)
Wkt
Since
Similarly it can be proved for
The following basic terminologies used in this article are defined in this section.
If the transportation problem has at least one of the parameter (cost) or two of the parameters (supply and demand) or all of the parameters (supply, demand and cost) are in fuzzy numbers then the problem is called FTP.
Further, FTP can be classified into four categories. They are
Type-1 FTP
Type-2 FTP
Type-3 FTP (mixed FTP)
Type-4 FTP (fully FTP)
A transportation problem having fuzzy availabilities and fuzzy demands but crisp costs is termed as fuzzy transportation problem of type-1.
A transportation problem having crisp availabilities and crisp demands but fuzzy costs is termed as fuzzy transportation problem of type-2.
The transportation problem is said to be the type-3 fuzzy transportation problem or mixed fuzzy transportation problem if all the parameters of the transportation problem (such as supplies, demands and costs) must be in the mixture of crisp numbers, triangular fuzzy numbers and trapezoidal fuzzy numbers.
The transportation problem is said to be the type-4 fuzzy transportation problem or fully fuzzy transportation problem if all the parameters of the transportation problem (such as supplies, demands and costs) must be in fuzzy numbers.
The transportation problem is said to be balanced fuzzy transportation problem if total fuzzy supply is equal to total fuzzy demand.
That is,
The transportation problem is said to be an unbalanced fuzzy transportation problem if total fuzzy supply is not equal to total fuzzy demand.
That is,
A set of fuzzy non negative allocations
Any feasible solution is a fuzzy basic feasible solution if the number of non negative allocations is at most (
If the fuzzy basic feasible solution contains less than (
Any fuzzy feasible solution to a transportation problem containing
The fuzzy basic feasible solution is said to be fuzzy optimal solution if it minimizes the total fuzzy transportation cost (or) it maximizes the total fuzzy transportation profit.
Consider the transportation problem with
Mathematically fully fuzzy transportation problem can be stated as (FFTP)
(P) Minimize
Subject to,
where
When the supplies, demands and costs are fuzzy numbers, then the total cost becomes the fuzzy number.
Consider the transportation problem with
(P*) Minimize
Subject to,
Since ℜ(
where,
The above FFTP and its equivalent crisp TP can be stated in the below tabular form in Tables 1 and 2.
This proposed method is used for finding the optimal basic feasible solution in fuzzy environment and the following step by step procedure is utilized to find out the same.
Consider the TP having all the parameters such as supply, demand and costs must be in fuzzy numbers (This situation is known as FFTP).
Examine whether the total fuzzy supply equals total fuzzy demand. If not, introduce a dummy row/column having all its cost elements as fuzzy zero and fuzzy supply/fuzzy demand as the positive difference of fuzzy supply and fuzzy demand.
After using Step 2, transform the FFTP into its equivalent crisp TP using the ranking procedure as mentioned in Section 3.
Now, the crisp TP having all the entries of supply, demand and costs are integers then kept as it is. Otherwise at least one or all of the supply, demand and costs are not in integers then rewrite its nearest integer value.
After using Step 4 of the proposed method, now solve the crisp TP by using any one of the existing methods (MODI, Zero Point Method) or software packages such as TORA, LINGO and so on. This step yields the optimal allocation and optimal objective value of the crisp TP (The optimal allotted cell in crisp transportation table is referred as occupied cells. The remaining cells are called unoccupied cells. The numbers of occupied cells in crisp TP which are exactly
After using Step 5 of the proposed method, now we check the allotment table if one or more rows/columns having exactly one occupied cell (fuzzy zero) then allot the maximum possible value to that cell and adjust the corresponding supply or demand with a positive difference of supply and demand. Otherwise, if all the rows/columns having more than one occupied cells then select a cell in the
Allot the maximum possible value to the occupied cells in type-2 and type-4 FTP which is the most preferable row/column having exactly one occupied cell.
From the MODI method, we conclude that the TP have exactly
From the zero point method, we can make exactly
From Remark 5.2 and Remark 5.3, we can directly replace the fuzzy zeros instead of original costs in the occupied cells in the original FTP. This modification does not affect the originality of the problem
Now, we prove the following theorems which are used to derive the solution to a fuzzy transportation problem obtained by the PSK method is a fuzzy optimal solution to the FFTP.
Any optimal solution to the fully fuzzy transportation (P1) where
(P1) Minimize
Subject to (
(P) Minimize
Subject to (
Let
Now,
Since
If {
Let {
Now, we prove that the solution to the FFTP obtained by the PSK method is a fully fuzzy optimal solution to the FFTP.
A solution obtained by the PSK method for a FFTP with equality constraints (P) is a fully fuzzy optimal solution for the fully fuzzy transportation problem (P).
Let us, now describe the PSK method in detail.
We construct the fully fuzzy transportation table [
Now, the crisp TP having all the entries of supply, demand and costs are integers then kept as it is. Otherwise at least one or all of the supply, demand and costs are not in integers then rewrite its nearest integer value because decimal values in transportation problem has no physical meaning (such a transportation problem referred as crisp TP).
Now, solve the crisp TP by using any one of the existing methods (MODI, Zero Point Method) or software packages such as TORA, LINGO and so on. This process will yield the optimal allotment and optimal objective value of the crisp TP (The optimal allotted cells in crisp transportation table is referred to as occupied cells which are exactly
By the definitions, occupied cells in crisp TP is same as that of occupied cells in FFTP but the value of occupied cells for FFTP is the maximum possible value of fuzzy supply and fuzzy demand. Therefore, we need not further investigate the occupied cells in FFTP. But only we claim that how much quantity (fuzzy supply, fuzzy demand) to allot the occupied cells subject to (
Now, we check the allotment table if one or more rows/columns having exactly one occupied cell then allot the maximum possible value to that cell and adjust the corresponding supply or demand with a positive difference of supply and demand. Otherwise, if all the rows/columns having more than one occupied cells then select a cell in the
Clearly, the above process satisfies all the rim requirements (row and column sum restriction). If all the rim requirements are satisfied then automatically it satisfies, total fuzzy supply is equal to total fuzzy demand i.e., the necessary and sufficient condition for a FFTP is satisfied.
Finally, we have a solution {
Therefore, the minimum
The proposed method is illustrated by the following numerical examples.
A firm has three factories
Find the optimal allocation which minimizes total fuzzy transportation cost.
Solution by proposed method:
Now using Step 2 we get,
Now, using Step 3 of proposed method, in conformation to Model (
Since in transportation problems supplies, demands and costs are not in decimal values because no physical meaning of fractional value. Therefore whenever the rank values occur in the form of decimal then we convert it into its nearest integer value. Otherwise, all the rank values of the FFTP is in integers then kept as it is.
After using Step 5 of the proposed method, the optimal allotment of the above problem is
The optimum solution is
The minimum objective value
After using Step 5 of the proposed method, now using Step 6, we get the optimal allotment directly for the FFTP is shown in the following table.
The fuzzy optimal solution in terms of trapezoidal fuzzy number is
Hence, the total fuzzy transportation cost is
There are three sources (rows) and four destinations (columns), all the sources are connected to all the destinations by roads and the goods are transported by trucks. The supply and demand of goods are well known crisp quantities but the transportation cost is not known exactly (due to variations in rates of petrol, traffic jams, weather in hilly areas etc). Hence crisp supply, crisp demand and unit transportation cost (given in terms of TrFNs) are given in the following table. Find the optimal allocation which minimizes total fuzzy transportation cost.
Solution by proposed method:
Now using Step 2, we get,
Now, using Step 3 and Step 4 of the proposed method, we get the following crisp TP (P).
After using Step 4 of the proposed method, now using Step 5 we have
The optimal solution is
The total transportation cost Min
Now, construct the new transportation table (P*) whose occupied cells costs are zeros and the remaining cells costs are its original cost. Subtract each row entries for the current table from the row minimum. Next subtract each column entries of the reduced table from the column minimum. Clearly, each row and each column of the resulting table has at least one fuzzy zero. The current resulting table is the allotment table.
Now using Step 6 of the proposed method we get
The total transportation cost Min
Therefore, Any optimal solution of problem (P*) (subject to all the constraints are satisfied) is also an optimal solution of problem (P) (subject to all the constraints are satisfied).
Hence the solution obtained by PSK method for solving FTP is always optimal. The optimal allotment is
(We could not minimize fuzzy cost below fuzzy zero).
Hence, the optimal solution is
The total fuzzy transportation cost is
The minimum total fuzzy transportation cost (Rupees in hundreds) of problem 1 is
The result in (
(a) Transportation cost (Rupees in hundreds) lies in [12, 117].
(b) 100% expect are in favour that the transportation cost (Rupees in hundreds) is [55, 88] as
(c) Assuming that
Values of
By using the proposed method a decision maker has the following advantages:
The optimum objective value of the type-2 and type-4 FTP is non-negative TrFN i.e., there is no negative part in the obtained TrFN.
The proposed method is computationally very simple and easy to understand. The solution obtained by PSK method for solving FTP is always optimal. Hence we need not check optimality criteria.
On the basis of the present study, it can be concluded that the FTP and FFTP which can be solved by the existing methods (Pandian and Natarajan [9], Dinagar and Palanivel [8], Rani et al. [13], Basirzadeh [16], Gani and Razak [11]) can also be solved by the proposed method. However, it is much easier to apply the proposed method as compared to all the existing methods. Also, new method and new multiplication operation on TrFN is proposed to compute the optimal objective values in terms of TrFN which are very simple and easy to understand and it can be easily applied by decision maker to solve type-2 and type-4 FTP. The solution obtained by this method the objective value of the FFTP remains always positive i.e., there is no negative part in the TrFN. Hence the proposed method is physically meaningful and computationally very simple when compared to all the existing methods.
The author would like to thank to the Editor-in-Chief “Professor Keon-Myung Lee” and the anonymous reviewers for their suggestions which have led to an improvement in both the quality and clarity of the paper.
Graphical representation of type-4 fuzzy transportation cost.
Table 1 . Tabular representation of FFTP.
Source | Destination | Fuzzy availability | |||
---|---|---|---|---|---|
· · · | |||||
· · · | |||||
· · · | |||||
⋮ | ⋮ | ⋮ | · · · | ⋮ | ⋮ |
· · · | |||||
Fuzzy demand | · · · |
Table 2 . Tabular representation of crisp TP.
Source | Destination | Availability ( | |||
---|---|---|---|---|---|
· · · | |||||
ℜ( | ℜ( | · · · | ℜ( | ℜ( | |
ℜ( | ℜ( | · · · | ℜ( | ℜ( | |
⋮ | ⋮ | ⋮ | · · · | ⋮ | ⋮ |
ℜ( | ℜ( | · · · | ℜ( | ℜ( | |
Demand ℜ( | ℜ( | ℜ( | · · · | ℜ( |
Table 3 . Type-4 FTP.
Factories | Warehouses | Fuzzy Availability | |||
---|---|---|---|---|---|
[0, 1, 3, 4] | [0, 1, 3, 4] | [0, 1, 3, 4] | [0, 0, 2, 2] | [0, 2, 4, 6] | |
[4, 8, 12, 16] | [4, 7, 9, 12] | [2, 4, 6, 8] | [1, 3, 5, 7] | [2, 4, 9, 13] | |
[2, 4, 9, 13] | [0, 6, 8, 10] | [0, 6, 8, 10] | [4, 7, 9, 12] | [2,4, 6, 8] | |
Fuzzy Demand | [1, 3, 5, 7] | [0, 2, 4, 6] | [1, 3, 5, 7] | [1, 3, 5, 7] |
Table 4 . Crisp version of type-4 FTP.
Factories | Warehouses | Availability | |||
---|---|---|---|---|---|
2 | 2 | 2 | 1 | 3 | |
10 | 8 | 5 | 4 | 7 | |
7 | 6 | 6 | 8 | 5 | |
Demand | 4 | 3 | 4 | 4 |
Table 5 . Crisp optimum table of type-4 FTP.
Factories | Warehouses | Availability | |||
---|---|---|---|---|---|
0 | 2 | 2 | 1 | 3 | |
10 | 8 | 0 | 0 | 7 | |
0 | 0 | 0 | 8 | 5 | |
Demand | 4 | 3 | 4 | 4 |
Table 6 . Fuzzy optimum table of type-4 FTP.
Factories | Warehouses | Fuzzy Availability | |||
---|---|---|---|---|---|
[0, 2, 4, 6] | |||||
[−2, −1, 1, 2] | [0, 1, 3, 4] | [0, 1, 3, 4] | [0, 0, 2, 2] | ||
[2, 4, 9, 13] | |||||
[4, 8, 12, 16] | [4, 7, 9, 12] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | ||
[2, 4, 6, 8] | |||||
[−2, −1, 1, 2] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | [4, 7, 9, 12] | ||
Fuzzy demand | [1, 3, 5, 7] | [0, 2, 4, 6] | [1, 3, 5, 7] | [1, 3, 5, 7] |
Table 7 . Type-2 FTP.
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
[1, 2, 4, 5] | [1, 4, 6, 9] | [3, 6, 10, 13] | [5, 8, 16, 19] | 3 | |
[0, 2, 4, 6] | [2, 4, 10, 12] | [7, 10, 12, 15] | [1, 4, 8, 11] | 5 | |
[2, 4, 6, 8] | [4, 6, 10, 12] | [0, 10, 20, 30] | [4, 8, 12, 16] | 12 | |
5 | 4 | 3 | 8 |
Table 8 . Crisp version of type-2 FTP (P).
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
3 | 5 | 8 | 12 | 3 | |
3 | 7 | 11 | 6 | 5 | |
5 | 8 | 15 | 10 | 12 | |
5 | 4 | 3 | 8 |
Table 9 . Crisp optimum table of type-2 FTP (P*).
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
3 | 5 | 0 | 12 | 3 | |
3 | 7 | 11 | 0 | 5 | |
0 | 0 | 0 | 0 | 12 | |
5 | 4 | 3 | 8 |
Table 10 . Crisp optimum allocation table of type-2 FTP.
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
3 | 5 | 0 | 12 | 3 | |
3 | 7 | 11 | 0 | 5 | |
0 | 0 | 0 | 0 | 12 | |
5 | 4 | 3 | 8 |
Table 11 . Fuzzy optimum table of type-2 FTP.
D1 | D2 | D3 | D4 | Availability | |
---|---|---|---|---|---|
[1, 2, 4, 5] | [1, 4, 6, 9] | [5, 8, 16, 19] | 3 | ||
[−2, −1, 1, 2] | |||||
[0, 2, 4, 6] | [2, 4, 10, 12] | [7, 10, 12, 15] | 5 | ||
[−2, −1, 1, 2] | |||||
12 | |||||
[−2, −1, 1, 2] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | [−2, −1, 1, 2] | ||
5 | 4 | 3 | 8 |
Table 12 . Comparative study.
Problem Number | Ranking method | Solution methods | |||||
---|---|---|---|---|---|---|---|
Liou and Wang [32] | VAM | MODI | Zero Point Method | Fuzzy Zero Point Method | Fuzzy Modified Distribution Method | PSK Method | |
1 | 68 (Rupees in hundreds) | 68 (Rupees in hundreds) | 68 (Rupees in hundreds) | [12,55,88,117] | [12,55,88,117] | [12,55,88,117] | |
2 | 141 | 141 | 141 | [52,106,176,230] 141 | [52,106,176,230] 141 | [52,106,176,230] 141 |
Yousef Al-Qudah, Khaleed Alhazaymeh, Nasruddin Hassan, Hamza Qoqazeh, Mohammad Almousa, and Mohammad Alaroud
International Journal of Fuzzy Logic and Intelligent Systems 2022; 22(1): 59-68 https://doi.org/10.5391/IJFIS.2022.22.1.59V. Padmapriya, M. Kaliyappan, and A. Manivannan
International Journal of Fuzzy Logic and Intelligent Systems 2020; 20(3): 247-254 https://doi.org/10.5391/IJFIS.2020.20.3.247Il Kyu Kim, Woo-Joo Lee, Jin Hee Yoon, and Seung Hoe Choi
Int. J. Fuzzy Log. Intell. Syst. 2016; 16(1): 72-80 https://doi.org/10.5391/IJFIS.2016.16.1.72Graphical representation of type-4 fuzzy transportation cost.