Abstract
Picture fuzzy set (PFS) is an extension of intuitionistic fuzzy set, and it is capable to analyze the transportation problems that contain uncertain and vague information. PFSs are applicable in situations where human decisions demand more variety of responses: yes, abstain, no, and rejection which cannot be addressed in the traditional FSs and IFSs. In this paper, we propose a technique to solve fully picture fuzzy transportation problems (FPFTPs) which are based on picture fuzzy linear programming formulation. Fully picture fuzzy transportation problems are developed by considering all the variables and parameters as nonnegative trapezoidal picture fuzzy numbers. A ranking function is used to transform picture fuzzy numbers into crisp numbers. A model is presented to explain the suggested scheme. Finally, comparison analysis of fully picture fuzzy transportation model with fully intuitionistic fuzzy transportation model and fully fuzzy transportation model is presented with pictorial illustrations.
1. Introduction
Zadeh [1] proposed the notion of fuzzy set (FS) theory to tackle the problems involving vague information. Atanassov [2] introduced intuitionistic fuzzy set (IFS), which is characterized by a membership function as well as a nonmembership function. Although IFSs have vast applications in many fields, it cannot provide all the information. In the voting process, we can vote in favor of someone, abstain, against someone, and even refuse to cost the vote, which cannot be handled by IFSs. To tackle such type of situations, Cuong [3] gave the idea of PFS, which is generalized structure of FS and IFS and further examined their basic properties and laws. In PFSs theory, we study about positive, neutral, and negative membership degrees of each element belonging to set. In practical life, PFSs theory contribute a significant role in medical diagnosis, career selection, decision making (DM), engineering, and networking.
Dubois and Prade [4] discussed basic arithmetic operations related to fuzzy numbers. Bellman and Zadeh [5] proposed the idea of decision making in fuzzy environment. Tanaka et al. [6] presented fuzzy linear programming (FLP) problems. Zimmerman [7] analyzed multiobjective functions in FLP problems. Ganesan and Veeramani [8] studied FLP problems by using trapezoidal fuzzy numbers. Lotfi et al. [9] suggested the lexicography method to solve fully FLP problems and obtained approximate solutions. Allahviranloo et al. [10] solved fully fuzzy linear system and achieved the general solutions. Kaur and Kumar [11] proposed Mehar’s method to solve fully FLP problems by using fuzzy numbers. Pérez-Cañedo et al. [12] used lexicographical method and solved fully FLP problems having inequality constraints. Akram et al. [13] proposed Pythagorean FLP problems with equality constraints. Akram et al. [13] introduced -type Pythagorean fuzzy numbers and introduced a scheme to solve -type fully Pythagorean FLP problems with equality constraints. Mehmood et al. [14, 15] developed different techniques to find optimal solutions of fully bipolar FLP problems. Ahmed et al. [16] solved fully FLP problems in bipolar neutrosophic environment. Akram et al. [17] presented a scheme and obtained optimal solutions of fully FLP problems. For more information about FLP, the reader may study [18–20].
In real life, we have to minimize the transportation cost in transportation problems (TPs) because the companies have to deliver the products from different sources to numerous destinations [21]. Gani and Abbas [22] suggested a new technique to obtain optimal solution of TPs in intuitionistic fuzzy environment. TPs are being applied in many areas like networking [23], shipping [24], production [25], and shortest route problems [26]. Singh and Yadev [27] solved fuzzy transportation problems (FTPs) and obtained optimal solution by applying accuracy function. Kumar et al. [28] have proposed two algorithms to achieve initial basic solution and optimal cost of FTPs. Nagoorgani and Razak [29] developed a method to minimize the cost function by using trapezoidal fuzzy numbers (TrFNs). Kaur and Kumar [30] solved FTPs and determined optimal solution. Singh and Yadav [31] proposed a method to solve FTPs by using intuitionistic fuzzy numbers as supply and demand. Basirzadeh [32] worked on FTPs and presented three different kinds of problems. Kumar and Hussain [33] used a computational approach to tackle fully intuitionistic fuzzy real life TPs. Abhishekh and Nishad [34] solved LR-intuitionistic FTPs by using ranking approach. Kaur et al. [35] proposed different schemes to solve fully FTPs by using TrFNs. Wang et al. [36] introduced geometric operators in picture fuzzy environment and studied decision-making problems (DMPs).
PFSs are applied to handle real life TPs that involve uncertainty and have been effectively used in communication, management, and DM. Akram et al. [37] proposed the idea of complex PFS, which is generalized form of complex IFS and developed a DM model. Shit et al. [38] used harmonic operators with TrPFNs and showed its significance in multicriteria decision-making (MCDM) problems. Akram et al. [39] investigated shortest route problems by using trapezoidal picture fuzzy numbers (TrPFNs). Geetha and Selvakumari [40] solved picture fuzzy transportation problems and obtained minimum transportation cost. Mahmoodirad et al. [41] studied the existing shortcomings and proposed a method to handle TPs involving intuitionistic fuzzy numbers. Kane et al. [42] suggested a FLP scheme to solve TPs by using triangular fuzzy numbers. Veeramani et al. [43] proposed a technique regarding multiobjective fractional TP on the basis of NGP approach. Ali and Ansari [44] presented Fermatean fuzzy bipolar soft set (FFBSS) model and studied its basic properties. Tchier et al. [45] combined PFSs and soft expert sets and introduced a hybrid model which is used to analyze DMPs. Das [46] defined score function to get IBFS and solved neutrosophic TPs. Kané et al. [47] proposed two-step scheme to solve fully FTP by using all parameters as trapezoidal fuzzy numbers. Ali et al. [48] studied group DMPs and developed a hybrid model by considering bipolar soft expert sets. Ashraf et al. [49] explored MSM operator in the form of IVPFS and interpreted its applications. On the basis of CIVPFSs, Ali et al. [50] introduced Einstein operational laws by applying t-norm. Sahu et al. [51] analyzed student’s career selection in PFS environment. Yildirim and Yıldırım [52] used picture fuzzy VIKOR technique and evaluated satisfaction level of people regarding municipality services. The motivation of this manuscript is described as follows:(1)PFSs manage the problems involving uncertainty more expeditiously as compared with FSs and IFSs.(2)No one has yet introduced this particular concept of FPFTPs which is based on picture fuzzy linear programming (PFLP) formulation.
The main contributions of this article are depicted as follows:(1)We propose a scheme to solve FPFTPs based upon PFLP formulation(2)We apply suggested technique to solve FPFTPs by considering all the variables as nonnegative TrPFNs(3)We obtain picture fuzzy transportation cost/optimal value in the form of TrPFNs(4)The supremacy of the proposed scheme is investigated by comparative analysis with existing approaches
The rest of the article is arranged as follows. Introductory concepts are depicted in Section 2. The proposed scheme is elucidated in Section 3. A model regarding FPFTPs is considered in Section 4. Comparison analysis is discussed in Section 5, and conclusion is given in the last section.
2. Preliminaries
In this section, we review some preliminary concepts regarding PFSs.
Definition 1. (see [3]). A PFS on a universal set is an object of the form as follows:where denote positive, neutral, and negative membership degrees, respectively, of element with , , and is said to be refusal degree of in set .
Definition 2. (see [53]). A TrPFN is a PFS defined on , whose positive , neutral , and negative membership functions are, respectively, defined as follows:where and the values indicate maximum degree of , maximum degree of , and minimum degree of , respectively, such that , with .
Definition 3. (see [53]). A TrPFN is said to be nonnegative (respectively, nonpositive) if (respectively, ) and is unrestricted TrPFN if is any real number.
Definition 4. (see [53]). Let and be two TrPFNs and be real number, then(1)(2)(3)(4)(5)where
Definition 5. (see [53]). Two TrPFNs and
are said to be equal if , , , , , , , , , , and .
Definition 6. (see [53]). A TrPFN is said to be zero if , , , , , , , , , , and .
Definition 7 (see [53]). Let be a TrPFN, then ranking of is symbolized as and defined as
3. Fully Picture Fuzzy Transportation Problems
In this section, we present a scheme to solve FPFTPs based on PFLP formulation. The steps are explained as follows.
3.1. Steps to Find Picture Fuzzy Optimal Solution
Consider a FPFTP containing sources and destinations in which cost, supply, and demand are used as TrPFNs , , and , respectively.subject towhere , and are all nonnegative TrPFNs.
To solve FPFTP equation (1), we give a criterion for picture fuzzy optimal solution (PFOS).
Definition 8. A PFOS of the FPFTP equation (1) with TrPFNs will be TrPFNs if(i) are nonnegative TrPFNs.(ii), .(iii), .(iv)If there exists any TrPFNs satisfying the above three conditions, thenNow, we explain the steps to determine the PFOS of FPFTP as given in equation (2).
Step 1. Calculate total picture fuzzy supply and total picture fuzzy demand.
Ifit is a balanced FPFTP.
Ifit is an unbalanced FPFTP.
That is,Then, one of the following case arises: Case (a): Case (b): Case (c): when the above two cases do not hold, then there may exists infinitely many nonnegative TrPFNs: such that but we have to determine such nonnegative TrPFNs as which satisfy the following conditions.(i) and are nonnegative TrPFNs.(ii)It satisfies(iii)Further, if there exists two nonnegative TrPFNs, such that then
Step 2. Supposethen FPFTP equation (1) can be transformed as follows:subject towhere are nonnegative TrPFNs.
Step 3. By applying arithmetic operations as described in Section 2 and puttingthen the fully picture fuzzy linear programming problem (FPFLPP) equation (2) can be transformed as follows:subject towhere are nonnegative TrPFNs.
Step 4. Now, by applying Definitions 5 and 7, then the FPFLPP equation (3) can be transformed as follows:subject towhere are nonnegative TrPFNs.
Step 5. To obtain PFOS, solve the following crisp linear/nonlinear programming problem (LPP):subject to
Step 6. Solve crisp linear/non-LPP equation (28) to get optimal solution:
Step 7. Find the PFOS of the FPFTP (1) by putting values of , and in .
Step 8. Find picture fuzzy transportation cost/optimal value of FPFTP equation (1) by assigning values of , as obtained in Step (7), in .
4. Numerical Examples
In this section, to explain the proposed methodology, we present a model related to FPFTPs.
Example 1. (FPFTP based on PFLP formulation). A company containing two plants produces urea fertilizer with picture fuzzy availabilities of
Proof. and , respectively, and supply it to two cities. The picture fuzzy demand at two cities is and . The price per ton by delivering the urea fertilizer at the two cities is presented in Table 1.
Find the minimum picture fuzzy transportation cost.subject towhere , , , and are nonnegative TrPFNs.
Now, Total supply = Total demand = For an unbalanced FPFTP, we add dummy row and dummy column to make a balanced picture fuzzy TP. Dummy row = Dummy column = Therefore, by supposing picture fuzzy transportation cost of unit quantity of product from dummy source to all destinations and from all sources to dummy destination to be zero TrPFNs, then FPFLPP equation (31) can be transformed as follows:subject towhere , , , , , , , , and , are nonnegative TrPFNs.
By supposing,where , , , , , , , , and are nonnegative TrPFNs, then the FPFLPP equation (33) can be transformed as follows:subject toBy applying arithmetic operations as described in Section 2, the FPFLPP equation (37) can be transformed as follows:subject toBy applying Definition 7, the FPLPP equation (39) can be transformed as follows:subject toNow, we solve the following crisp LPP:subject toBy using Software Maple, we get optimal solution.The PFOS isThe picture fuzzy optimal value/transportation cost of FPFTP is
and is shown graphically in Figure 1.
Example 2. (fully intuitionistic fuzzy transportation problem (FIFTP) based on FLP formulation).subject towhere , , , , , , , , and , are nonnegative TrIFNs.
The intuitionistic fuzzy optimal value/transportation cost of FIFTP [41] is
and is shown graphically in Figure 2.
Example 3. (fully fuzzy transportation problem (FFTP) based on FLP formulation).subject towhere , , , , , , , , and are nonnegative TrFNs.
The fuzzy optimal value/transportation cost of FFTP [35] is and is shown graphically in Figure 3.
5. Discussion
The picture fuzzy optimal value/transportation cost obtained in Example 1 by using the proposed method as discussed in Section 3 is and can be illustrated as follows:(i)The lowest amount of picture fuzzy transportation cost is 3550 units(ii)The feasible amount of picture fuzzy transportation cost lies in (iii)The highest amount of picture fuzzy transportation cost is 87050 units
So, the least transportation cost will always be higher than 3550 units and lower than 87050 units, and the maximum chances of minimum transportation cost will belong to .
Furthermore, Examples 2 and 3 are considered in an intuitionistic fuzzy environment and fuzzy environment, respectively. The minimum intuitionistic fuzzy transportation cost and minimum fuzzy transportation along with picture fuzzy transportation cost are shown in Table 2.
Obviously, Table 2 demonstrates that the FPFTP gives the best optimal value/transportation cost as compared with FIFTP and FFTP.
6. Conclusion
PFS is the most comprehensive and generalized structure of FS and IFS because it is characterized by membership function, neutral membership function, and nonmembership function. In this paper, we have proposed a new scheme to discuss the fully picture fuzzy transportation problems. We have introduced FPFTPs by considering all the variables as nonnegative TrPFNs. The FPFTPs have been developed on the basis of picture fuzzy linear programming formulation. In order to transform the FPFTPs into crisp linear/non-LPPs, a ranking function is practised. The PFLP formulation technique has been applied to obtain the PFOSs in the form of TrPFNs. Further, we have investigated and compared the fully picture fuzzy transportation model with fully intuitionistic fuzzy transportation model and fully fuzzy transportation model to demonstrate that the proposed approach is more comprehensive and reliable as compared with the existing FIFTP approach [41] and FFTP approach [35].
In future, this work can be extended to(1)-type fully picture fuzzy transportation problems(2)-type bipolar single-valued neutrosophic transportation problems
Data Availability
No data were used to support this study.
Ethical Approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Conflicts of Interest
The authors declare that they have no conflicts of interest.