Z1(X) | Z2(X) | . | . | . | Zk(X) | |
X(1) | Z11 | Z12 | . | . | . | Z1K |
X(2) | Z21 | Z22 | . | . | . | Z2K |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
X(k) | ZK1 | ZK2 | . | . | . | ZKK |
Considering the uncertainty of transporting goods from numerous origins to diverse destinations is a critical task for the decision-maker (DM). The ultimate goal of the DM is to make the right decisions that optimize the profit or loss of the organization under the vagueness of the uncontrollable effects. In this paper, mathematical models are proposed using fuzzy non-linear membership functions for the transportation problem considering the parameters' uncertainty that can help the DM to optimize the multi-objective transportation problems (MOTP) and to achieve the desired goals by choosing a confidence level of the uncertain parameters. Based on DM's selection of the confidence level, a compromise solution of the uncertain multi-objective transportation (UMOTP) is obtained along with the satisfaction level in percent for the DM. Two non-linear fuzzy membership functions are considered: the exponential and the hyperbolic functions. Using both membership functions, the sensitivity analysis was implemented by considering different confidence levels. According to the experimental results, the hyperbolic membership function gives 100% DM's satisfaction in many instances. Moreover, it shows stability against the exponential and linear functions.
Citation: Md. Musa Miah, Ali AlArjani, Abdur Rashid, Aminur Rahman Khan, Md. Sharif Uddin, El-Awady Attia. Multi-objective optimization to the transportation problem considering non-linear fuzzy membership functions[J]. AIMS Mathematics, 2023, 8(5): 10397-10419. doi: 10.3934/math.2023527
[1] | Jiaxin Chen, Yuxuan Wu, Shuai Huang, Pei Wang . Multi-objective optimization for AGV energy efficient scheduling problem with customer satisfaction. AIMS Mathematics, 2023, 8(9): 20097-20124. doi: 10.3934/math.20231024 |
[2] | Abdullah Ali H. Ahmadini, Firoz Ahmad . Solving intuitionistic fuzzy multiobjective linear programming problem under neutrosophic environment. AIMS Mathematics, 2021, 6(5): 4556-4580. doi: 10.3934/math.2021269 |
[3] | T. K. Buvaneshwari, D. Anuradha . Solving bi-objective bi-item solid transportation problem with fuzzy stochastic constraints involving normal distribution. AIMS Mathematics, 2023, 8(9): 21700-21731. doi: 10.3934/math.20231107 |
[4] | M Junaid Basha, S Nandhini . A fuzzy based solution to multiple objective LPP. AIMS Mathematics, 2023, 8(4): 7714-7730. doi: 10.3934/math.2023387 |
[5] | Muhammad Akram, Syed Muhammad Umer Shah, Mohammed M. Ali Al-Shamiri, S. A. Edalatpanah . Extended DEA method for solving multi-objective transportation problem with Fermatean fuzzy sets. AIMS Mathematics, 2023, 8(1): 924-961. doi: 10.3934/math.2023045 |
[6] | Sema Akin Bas, Beyza Ahlatcioglu Ozkok . An iterative approach for the solution of fully fuzzy linear fractional programming problems via fuzzy multi-objective optimization. AIMS Mathematics, 2024, 9(6): 15361-15384. doi: 10.3934/math.2024746 |
[7] | Tareq M. Al-shami, José Carlos R. Alcantud, Abdelwaheb Mhemdi . New generalization of fuzzy soft sets: $ (a, b) $-Fuzzy soft sets. AIMS Mathematics, 2023, 8(2): 2995-3025. doi: 10.3934/math.2023155 |
[8] | Habibe Sadeghi, Fatemeh Moslemi . A multiple objective programming approach to linear bilevel multi-follower programming. AIMS Mathematics, 2019, 4(3): 763-778. doi: 10.3934/math.2019.3.763 |
[9] | Ya Qin, Rizk M. Rizk-Allah, Harish Garg, Aboul Ella Hassanien, Václav Snášel . Intuitionistic fuzzy-based TOPSIS method for multi-criterion optimization problem: a novel compromise methodology. AIMS Mathematics, 2023, 8(7): 16825-16845. doi: 10.3934/math.2023860 |
[10] | Adela Khamis, Abd Ghafur Ahmad . On fundamental algebraic characterizations of complex intuitionistic Q-fuzzy subfield. AIMS Mathematics, 2023, 8(3): 7032-7060. doi: 10.3934/math.2023355 |
Considering the uncertainty of transporting goods from numerous origins to diverse destinations is a critical task for the decision-maker (DM). The ultimate goal of the DM is to make the right decisions that optimize the profit or loss of the organization under the vagueness of the uncontrollable effects. In this paper, mathematical models are proposed using fuzzy non-linear membership functions for the transportation problem considering the parameters' uncertainty that can help the DM to optimize the multi-objective transportation problems (MOTP) and to achieve the desired goals by choosing a confidence level of the uncertain parameters. Based on DM's selection of the confidence level, a compromise solution of the uncertain multi-objective transportation (UMOTP) is obtained along with the satisfaction level in percent for the DM. Two non-linear fuzzy membership functions are considered: the exponential and the hyperbolic functions. Using both membership functions, the sensitivity analysis was implemented by considering different confidence levels. According to the experimental results, the hyperbolic membership function gives 100% DM's satisfaction in many instances. Moreover, it shows stability against the exponential and linear functions.
Transportation problem (TP) is a very distinct kind of cost-effective linear programming problem that helps the decision-maker (DM) to optimize the cost parameters. The ordinary transportation problem is associated with transporting goods from p deliverers to q receivers filling the obtainability of the supply equivalent to the demands. Sometimes the cost parameters such as supply, demand, and costs are not described preciously. In this situation, the question of uncertainty arises. Many researchers have shown their ingenuity in developing effective methods for the optimization of a TP. The fundamental concept of TP was developed by Hitchcock [1] in a mathematical form of the distribution of products from numerous sources to frequent warehouses and then [2] showed the best utilization of the system. Thie and Keough [3] have shown the models to solve the transportation problem as a linear programming problem, which is very efficient by using the simplex method that makes the problem very much calculative. On the other side, Zadeh [4] have given a brief description of a new technique for decision-making in a fuzzy environment. Lee and Moore [5] optimized transportation problems with multiple objectives applying the goal-programming concept. Zimmermann [6] applied the fuzzy linear programming concept with multi-objectives to solve MOTP. Isermann [7] have shown an algorithm for linear MOTP and Leberling [8] have given the idea of hyperbolic membership function for multi-objective linear programming problem. Ringuest and Rinks [9] suggested an interactive algorithm for the linear MOTP that makes it easy to find the compromise solution of the transportation problem for the set of non-dominated solutions. Arsham and Kahn [10] introduce a simple model for general transportation problem for stepping-stone method. Chanas et al. [11] and Delgado et al. [12] revealed a general model for fuzzy linear programming. Bit et al. [13] introduced an additive fuzzy programming model for the many criteria transportation problem considering the fuzzy membership function to construct a significant decision function. Yaghin and Darvishi [14] integrated decisions of the physical supply channel on the global scale including supplier selection, order allocation, and transportation planning under uncertainty. Verma et al. [15] apply fuzzy programming technique to solve multi-objective transportation problems with some nonlinear membership functions. El-Wahed and Abo-Sinna [16] discussed the mixture fuzzy-goal programming tactic to the optimization of multiple objective decision making problems. The values of the uncertain parameters are obtained by using uncertain normal distribution suggested by B. Liu [17,18,19,20,21,22] for uncertain measures theorem. Maity et al. [23] apply uncertain measures theorem to measure the problem with cost reliability. Baky [24] have drown a brief description of multi-level use of fuzzy goal programming where Ojha et al. [25] and Kundu et al. [26] show the applicability of fuzzy model in both single and multiple objective TP. In 2015, Guo et al. [27] applied the TP model in uncertain environment for e-Navigation and Maritime Economy. Uddin et al. [28] and Umarusman [29] have demonstrated the use of fuzzy goal programming with genetic algorithm in min-max approach for MOTP. Recently, Singh et al. [30] presented the concept of interactive fuzzy goal programming to solve the MOTP. Moreover, Uddin et al. [31] described TP considering all parameters uncertain with goal programming applying linear membership function. Recently, Darvishi et al. [32], Yaghin and Darvishi [33] have integrated inbound logistics decisions and multi-site aggregate production planning (APP) over the tactical planning horizon in textile industry using fuzzy logic. Fuzzy logic was considered in the planning of textile production management [33]. Ali et al. [34] apply the LR-type fuzzy in a multi-objective supply chain problem. Khan et al. [35] and Kaliyaperumal and Das [36] use non-linear programming to optimize multi-objective problems. Muhammad et al. [37], Kamal et al. [38], Mahajan and Gupta [39] and Khan et al. [40] are also apply the fuzzy goal programming technique for sustainable development. Kacher and Singh [41] developed a fully fuzzy MOTP with the consideration of fuzzy harmonic mean. A recent literature review can be found in [42] with a full description of the models of TP.
Based on the aforementioned literature, the uncertain multi-objective TP is still attracting the attention of the recent researches. However, most of the resent works considered the linear membership function for representing uncertainty. Only a few attempts were found considering the hyperbolic membership function or the exponential membership function. This shortage motivates this study to consider the uncertain multi-objective TP with nonlinear membership functions. Besides, it attempts to answer the question of what is the best membership function to be used amongst hyperbolic, exponential, or linear? Moreover, it proposes to develop a decision support tool by which the DM can interpret the MOTP. Another question was highlighted: Is there any tool that can help the DM to interpret the obtained solution rapidly? Considering these research interests, there is a need for a method that will help the DM to calculate in percent the desired goal with uncertain parameters using non-linear membership function corresponding to his confidence level.
In the present study, diverse attempts were taken to predict the parameters of the MOTP in an uncertain environment. Accordingly, this model will be very helpful for the decision-maker in a very complicated situation to take the right decisions. The key contributions of the present research can be summarized as follows:
● All parameters such as the supply, demand, and cost are considered uncertain.
● Different objectives are considered: beside the benefits, the penalty cost for transportation and damage cost due to delay or early transportation are considered as uncertain.
● The decision maker can choose a confidence level for each of the uncertain parameter to make it a certain one.
● Non-linear membership functions of fuzzy programming approach were considered to model the situation.
● The DM can find out his overall satisfaction in percent (%) corresponding to the chosen confidence level which will be a tremendous job to take right decision and as a whole for the desired profit of the organization.
The rest of this paper is furnished as in Section 2, the proposed mathematical model for non-linear membership function is designed and discussed. In Section 3, an illustrative example for the applicability of the proposed model is discussed. Then Section 4 presents a comparative analysis with discussions of the different membership functions. Finally, the conclusions and perspectives are presented.
Nomenclature:
aj: Supply parameter (in number of units)
bj: Demand parameter (in number of units)
Cij: Cost parameter for ith origin to jth destination (in monetary units)
ƛ: Uncertain variable
R: Uncertain distribution
∅: Normal uncertain distribution
Ω: Uncertain measure function
e: Expected value of the parameter
σ: Standard deviation
ω: Confidence level
ξ: Satisfaction level of the DM
μE(Zk): Exponential membership function for the kth objective
μH(Zk): Hyperbolic membership function for the kth objective
Xij: Amount to be transported from ith origin to jth destination
R−1(x): Inverse normal uncertain distribution.
Transportation problems are generally designed to transport a number of products from some stocks (or sources) to different ends. Let us consider there are p sources and q demands. The sources can be factory or production facilities, warehouse etc. and these are denoted by the symbols a1,a2,……ap and the destinations can be warehouse, outlets etc. and are generally denoted the symbols b1,b2,……bq. Let the transportation costs Cij are related to transport a number of units from ith origin to jth destination and xij is the unknown quantity to be transported from the ith origin to jth destination. In these circumstances, the conventional transportation model is written as:
Minimize : Z(x)=p∑i=1q∑j=1CijxijSubject to the constraints : n∑j=1xij⩽ai,i=1,2,3,...............,p m∑i=1xij⩾bj,j=1,2,3,...............,q ∀xij⩾0,i=1,2,......p;j=1,2,.......,q} . | (1) |
Under the feasibility condition of ∑mi=1ai≥∑nj=ibj .
In the present challenging market condition, various objectives such as minimizing the transportation costs, minimize the transportation time, maximize the profit, minimize the damage cost due to delay or advanced transport of the products are very rational with transportation. On the other hand, these cost parameters are independent to each other and that is why they are considered as conflicting. In such environment, the MOTP can be demonstrated as follows:
Minimize :Zk(x)=p∑i=1q∑j=1CkijxijSubject to : n∑j=1xij⩽ai,i=1,2,3,...............,p m∑i=1xij⩾bj,j=1,2,3,...............,q ∀xij⩾0,i=1,2,......p;j=1,2,.......,q}. | (2) |
Under the feasibility condition of ∑mi=1ai≥∑nj=ibj .
Where Ckij is the unit cost for transportation, ai(i=1,2,……,p) is the supply and bj(j=1,2,……,q) is the order parameter for the kth(k=1,2,……,K) objective function of the MOTP. In general, the number Ckij, ai and bj are considered as crisp. Incorporating the inverse measure theorem, Eq (2) can be written as follows:
Max/Min :Zk(x)=p∑i=1q∑j=1[Ω(Ckij)⩾αij]xijSubject to : Ω(n∑j=1xij⩽ai)⩾γii=1,2,3,...............,p Ω(m∑i=1xij⩾bj)⩾δj,j=1,2,3,...............,q ∀xij⩾0,i=1,2,......p;j=1,2,.......,q} . | (3) |
We know that the inverse of the normal uncertain variable N(e,σ) is as R−1(x)=e+√3σπln(ω1−ω) where ω is the level of confidence of the decision maker.
The computational algorithm for fuzzy exponential membership function is constructed below for achieving the optimal solution and also the satisfaction level of the decision maker as follows:
Step 1: Obtain the crisp values of the parameters using inverse normal uncertain distribution.
Step 2: Construct the given MOTP for uncertain parameters to an ordinary TP using the crisp number obtained from step 1.
Step 3: Solve each single objective TP ignoring all others objectives.
Step 4: Using the result obtain from step 3, determine the corresponding values of each objective function and then construct the payoff matrix as shown in Table 1:
Z1(X) | Z2(X) | . | . | . | Zk(X) | |
X(1) | Z11 | Z12 | . | . | . | Z1K |
X(2) | Z21 | Z22 | . | . | . | Z2K |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
X(k) | ZK1 | ZK2 | . | . | . | ZKK |
Where X(1),X(2),.........,X(K) are the optimal solutions and Z1K,Z1K,.........,ZKK are the corresponding values of the single objective functions.
Step 5: From step 4, for each single objective, find the Mk and the corresponding Lk for each solution set, where Mk=Maximum(Z1K,Z2K,.........,ZKK) and Lk=Minimum(Z1K,Z2K,.........,ZKK), k=1,2,....,K. Then an initial fuzzy model can be written as follows:
FindXij, i=1,2,3,.....,p, j=1,2,3,...,q ZK≤LK,k=1,2,....,KSubject to: n∑j=1xij≤ai, i=1,2,3,...............,p m∑i=1xij≥bj, j=1,2,3,...............,q ∀xij≥0, i=1,2,......p; j=1,2,.......,q}. | (4) |
Assuming that any maximization objective can be transformed to a minimization one as pre-processing step.
Step 6: Describe exponential membership function μE(Zk) for the kth objective function.
Step 7: Convert model, in step 5, as a crisp model as Eq (5) for exponential fuzzy membership function and as Eq (6) for hyperbolic one:
Maximize: ξSubject to: e−sψk(X)−(1−e−s)ξ≥e−s, k=1,2,....,K q∑j=1Xij=ai, i=1,2,....,p p∑i=1Xij=bj, j=1,2,....,q Xij≥0, ξ≥0,∀i,j}, | (5) |
whereψk(X)=Zk−LkMk−Lk.
Maximize ξSubject to: Zk(X)αk+η≤(Mk+Lk2)αk q∑j=1Xij=ai, i=1,2,....,p p∑i=1Xij=bj, j=1,2,....,q ξ≥0,Xij≥0, ∀i,j}, | (6) |
where η=tanh−1(2ξ−1).
Step 8: Solving the model, required solution and the satisfaction level of the DM for the MOTP obtained.
To understand the computational algorithm straight forwardly, a flowchart is presented below. Moreover, an example is illustrated for ascertaining the usefulness of the mentioned transportation problem beside the pertinence of the computational system in the next segment.
To affirm the feasibility of the models, let us consider a multi objective TP with uncertainty in objective parameters. The decision maker desires to transport the merchandises from three sources S1,S2,S3 to four destination points D1,D2,D3,D4 and wishes to optimize the objective functions as follows:
(ⅰ) Minimization of transportation cost (Z1).
(ⅱ) Maximization of profit (Z2).
(ⅲ) Minimization of damage cost (Z3).
Note: First, we assumed that the stochastic profit matrix can be converted to a stochastic cost matrix as a prepressing step. We call it "transformed profit C2ij". This transformation can be performed by subtracting the stochastic profit matrix from a large number with zero variance. Accordingly, the proposed algorithm can be applied straight forwardly.
In the uncertain working environment, it is difficult for the DM to estimate his decision outcomes. But he/she can easily decide the level of confidence ω to achieve the desired goal. Then, the unpredictable parameters can be converted to a crisp number using the normal distribution N(e,σ). Whereas, e stands for expected value of the uncertain parameter and σ for the deviation. To achieve this goal, the uncertainty is considered using the inverse normal uncertain distribution. In other words, the uncertain TP cost C1ij, transformed profit C2ij and damage cost C3ij for each unit of goods from i origins to j destinations for i=1,2,3 and j=1,2,3,4 are obtained using the inverse normal uncertain distribution for the confidence level ω chosen by the DM. Similarly, both the demands and supply are measured using inverse normal uncertain distribution.
R−1(x)=e+√3σπln(ω1−ω) and the supply are measured using inverse uncertain normal distribution. R−1(x)=e+√3σπln(1−ωω).
In each of the case, the DM uses the same confidence level to determine all the uncertain parameters. The data used to illustrate the proposed approach is taken from the work presented in Uddin et al. [29], as listed in Table 2.
Entity | Data matrix | ||||
Uncertain transportation cost C1ij: | D1 | D2 | D3 | D4 | |
S1 | (20, 2) | (18, 2) | (22, 3) | (24, 3) | |
S2 | (10, 1) | (12, 2) | (15, 3) | (13, 1) | |
S3 | (22, 3) | (20, 3) | (24, 2) | (23, 2) | |
Uncertain transformed profit C2ij: | D1 | D2 | D3 | D4 | |
S1 | (5, 1) | (6, 1.5) | (4, 1) | (3, 0.5) | |
S2 | (6, 1) | (5, 1.5) | (5, 0.5) | (4, 1) | |
S3 | (9, 1) | (8, 1.5) | (8, 2) | (10, 2) | |
Uncertain damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | (4, 1) | (4, 1) | (3, 1) | (5, 2) | |
S2 | (3, 1) | (6, 1) | (4, 1) | (4, 1) | |
S3 | (4, 1.5) | (3, 1) | (4, 1) | (5, 1.5) | |
Uncertain demand: |
b1 | b2 | b3 | b4 | |
(40, 3) | (36, 4) | (35, 5) | (40, 3) | ||
Uncertain supply: |
a1 | a2 | a3 | ||
(55, 4) | (60, 5) | (70, 4) |
For confidence level ω=0.75 Table 2 can be changed to Table 3 respectively using confidence level ω=0.75 and the inverse normal uncertain distribution.
Entity | Data matrix | ||||
Crisp value for cost C1ij: |
D1 | D2 | D3 | D4 | |
S1 | 21.22 | 19.22 | 23.83 | 25.83 | |
S2 | 10.61 | 13.22 | 16.83 | 13.61 | |
S3 | 23.83 | 21.83 | 25.22 | 24.22 | |
Crisp value for the transformed profit C2ij: |
D1 | D2 | D3 | D4 | |
S1 | 5.61 | 6.92 | 4.61 | 3.31 | |
S2 | 6.61 | 5.92 | 5.31 | 4.61 | |
S3 | 9.61 | 8.92 | 9.92 | 11.22 | |
Crisp value for damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | 4.61 | 4.61 | 3.61 | 6.22 | |
S2 | 3.61 | 6.61 | 4.61 | 4.61 | |
S3 | 4.92 | 3.61 | 4.61 | 5.92 | |
Crisp value for demand: | b1 | b2 | b3 | b4 | |
41.8 | 38.4 | 38.05 | 41.83 | ||
Crisp value for supply: | a1 | a2 | a3 | ||
52.6 | 57 | 67.56 |
Now, the solution of each single objective of the TP are presented using "TORA".
X2=(11, 0, 0, 42, 19, 0, 19, 0, 31, 32, 0, 0) |
X1=(0, 38, 15, 0, 42, 0, 0, 15, 0, 0, 23, 27) |
X3=(15, 0, 38, 0, 27, 0, 0, 30, 0, 38, 0, 12) |
The different values of Zk corresponding to Xk are listed in the following pay-off matrix Table 4.
Z1(X) | Z2(X) | Z3(X) | |
X(1) | 2968.8 | 1193.69 | 715.84 |
X(2) | 3368.8 | 980.4 | 776.68 |
X(3) | 3038.79 | 1049.51 | 648.6 |
Mk | 3368.8 | 1193.69 | 776.68 |
Lk | 2968.8 | 980.4 | 648.6 |
From the pay-off matrix, one can find the maximum Mk and the minimum Lk thresholds for each objective, as listed in the last rows of the above matrix.
2968.8≤Z1≤3368.8,980.4≤Z2≤1193.69and648.6≤Z3≤776.68}. | (7) |
The exponential membership function is formulated as follows:
e−sψk(x)−(1−e−s)ξ≥e−s , where ψk(X)=Zk−LkMk−Lk. | (8) |
Based on Eq (8), one can have the exponential membership function as follows:
ψ1(x)=Z1−L1M1−L1=Z1−2968.63368.8−2968.8=Z1−2968.6400ψ2(x)=Z2−L2M2−L2=Z2−980.41193.69−980.4=Z1−980.4213.29and ψ3(x)=Z3−L3M3−L3=Z3−648.6776.68−648.6=Z3−648.6128.08}. | (9) |
Taking s=1 in Eq (8) together with the Eq (9), the exponential membership function can be written as an equivalent crisp model as follows:
Maximize ξ
Subject to:
exp{−(21.22x11+19.22x12+23.83x13+25.83x14+10.61x21+13.22x22+16.83x23+13.61x24+23.83x31+21.83x32+25.22x33+24.22x34−2968.6400)} −0.63ξ≥0.37 |
exp{−(5.61x11+6.92x12+4.61x13+3.31x14+6.61x21+5.92x22+5.31x23+4.61x24+9.61x31+8.92x32+9.92x33+11.22x34−980.4)213.29}−0.63ξ ≥0.37 |
exp{−(4.61x11+4.61x12+3.61x13+6.22x14+3.61x21+6.61x22+4.61x23+4.61x24+4.92x31+3.61x32+4.61x33+5.92x34−648.6128.08)}−0.63ξ ≥0.37 |
x11+x12+x13+x14≤52.6x21+x22+x23+x24≤57x31+x32+x33+x34≤67.56x11+x21+x31≥41.8x12+x22+x32≥38.4x13+x23+x33≥38.05x14+x24+x34≥41.83 |
xij≥0 for all intger i,j. |
Using "LINGO" software, the optimal compromise solution is obtained as follows:
X∗=(x11=26.6300, x12=3.4887, x13=22.4812,x14=0.000, x21=15.170,x22=0.00, x23=0.00, x24=41.830, x31=0.00, x32=34.9112,x33=15.5687, x34=0.00)‘ |
The values of the objective functions are Z1(X∗)=3052.887, Z2(X∗)=1025.237 and Z3(X∗)=665.4063. The overall satisfaction of the DM is ξ=0.6990, that is, the overall satisfaction is 69.90%. The following Table 5 shows the different objective values and the satisfaction level of the DM for different confidence levels.
ω | ξ | Objective values | Feasibility | Satisfaction (%) | ||
Z1 | Z2 | Z3 | ||||
00-0.49 | --- | --- | --- | --- | Infeasible | --- |
0.50 | Deviation vanishes and problem exists in certain parameters | |||||
0.51 | 0.3264 | 2703.93 | 884.33 | 535.83 | Feasible | 32.649% |
0.55 | 0.4111 | 2733.02 | 900.273 | 550.17 | Feasible | 41.11% |
0.60 | 0.4462 | 2797.80 | 945.64 | 573.7 | Feasible | 44.62% |
0.65 | 0.5158 | 2918.63 | 975.63 | 599.41 | Feasible | 51.58% |
0.70 | 0.5365 | 2998.33 | 1009.23 | 630.55 | Feasible | 53.65 % |
0.71 | 0.8995 | 2986.69 | 975.66 | 661.32 | Feasible | 89.95% |
0.72 | 0.9420 | 2975.95 | 970.74 | 660.97 | Feasible | 94.20% |
0.73 | 0.9038 | 2797.78 | 986.31 | 653.32 | Feasible | 90.38% |
0.74 | 0.8629 | 2757.58 | 996.35 | 655.95 | Feasible | 86.29% |
0.75 | 0.6990 | 3052.88 | 1025.23 | 665.4 | Feasible | 69.90 % |
0.76 | 0.6329 | 3076.89 | 1038.30 | 674.18 | Feasible | 63.29% |
0.77 | 0.5735 | 3101.43 | 1051.45 | 683.00 | Feasible | 57.35% |
0.78 | 0.5549 | 3111.67 | 1057.35 | 690.65 | Feasible | 55.49% |
0.79 | 0.5123 | 3133.11 | 1068.76 | 697.00 | Feasible | 51.23% |
0.80 | 0.5091 | 3231.33 | 1113.65 | 719.65 | Feasible | 50.91 % |
0.81-1.00 | - | - | - | - | Infeasible | - |
Note: '---'indicates not applicable. |
Figure 2 exposes an explicit view of DM satisfaction over the confidence level using the exponential membership function (EMF) of the fuzzy programming. It shows the satisfaction of the DM is almost static for the confidence level from 0.51 to 0.70 and then dramatically increase for 0.71 and 0.72. After that the level of confidence of the DM gradually go down at the up to 0.85. However, the present transportation problem provides infeasible solution for confidence level 0.00 to 0.49 and for 0.81 to onwards. The reason behind of this result is that the demand becomes greater than supply for choosing the confidence level 0.86 to onwards. A salient observation in accordance with the performed numerical illustration is the decision maker achieves the highest satisfaction level (94.20%) when he selects the confidence level 0.72. Deviation of the parameter vanishes, and the problem becomes in certain environment when DM chooses the confidence level 0.50.
Again, Figure 3 shows the behaviour of the objectives of the TP for various confidence level of the DM using the exponential membership function (EMF). The graph shows the increasing pattern of the objective's values except the TP cost slightly decreasing from 0.72 to 0.74 and profit slightly decreasing at 0.74 while again static up to the end. The damage cost using exponential membership function for this present transportation problem showing increasing behaviour everywhere of the confidence level where the problem has feasible solution.
For ω=0.80 Table 2 can be changed to Table 6 respectively.
Entity | Data matrix | ||||
Crisp value for cost C1ij: |
D1 | D2 | D3 | D4 | |
S1 | 21.52 | 19.52 | 24.28 | 26.28 | |
S2 | 10.76 | 13.52 | 17.28 | 13.76 | |
S3 | 24.28 | 22.28 | 25.52 | 24.52 | |
Crisp value for the transformed profit C2ij: |
D1 | D2 | D3 | D4 | |
S1 | 5.76 | 7.14 | 4.76 | 3.38 | |
S2 | 6.76 | 6.14 | 5.38 | 4.76 | |
S3 | 9.76 | 9.14 | 9.52 | 11.52 | |
Crisp value for damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | 4.76 | 4.76 | 3.76 | 6.52 | |
S2 | 3.76 | 6.76 | 4.76 | 4.76 | |
S3 | 5.14 | 3.76 | 4.76 | 6.14 | |
Crisp value for demand: | b1 | b2 | b3 | b4 | |
42.3 | 39.0 | 38.8 | 42.28 | ||
Crisp value for supply: | a1 | a2 | a3 | ||
52.0 | 56.2 | 66.96 |
Now, the solution of each single objective of the TP using "TORA" are
X1=(0, 39, 13, 0, 42, 0, 14, 0, 0, 26, 28) |
X2=(10, 0, 0, 42, 0, 17, 39, 0, 32, 22, 0, 0) |
X3=(13, 0, 39, 0, 29, 0, 0, 27, 0, 39, 0, 15) |
Using the results, we have the pay-off matrix as follows in Table 7:
Z1(X) | Z2(X) | Z3(X) | |
X(1) | 3071.56 | 1260.98 | 754.76 |
X(2) | 3489.84 | 1027.16 | 869.2 |
X(3) | 3146.96 | 1114.34 | 984.82 |
Mk | 3489.84 | 1260.98 | 984.82 |
Lk | 3071.56 | 1027.16 | 754.76 |
From the pay-off matrix, one can identify the maximum Mk and the minimum Lk thresholds for each objective.
i.e., 3071.56≤Z1≤3489.84,1027.16≤Z2≤1260.98and 754.76≤Z3≤984.82}. | (10) |
The hyperbolic membership function can be represented as follows:
Zk(X)αk+η≤(Mk+Lk2)αk where αk=6Mk−Lk | (11) |
Based on Eq (11), one can have the hyperbolic membership function as follows:
Z1(X)(6M1−L1)+η≤(M1+L12)(6M1−L1)Z1(X)(63489.84−3071.56)+η≤(3489.84+3071.562)(63489.84−3071.561)Z1(X)(6418.28)+η≤(6561.42)(6418.28)}Z2(X)(6M2−L2)+η≤(M2+L22)(6M2−L2)Z2(X)(61260.98−1027.16)+η≤(1260.98+1027.162)(61260.98−1027.16), | (12) |
and
Z2(X)(6233.82)+η≤(2288.142)(6233.82)} | (13) |
Z3(X)(6M3−L3)+η≤(M3+L32)(6M3−L3)Z3(X)(6984.82−754.76)+η≤(984.82+754.762)(6984.82−754.76) Z3(X)(6230.06)+η≤(1739.582)(6230.06)}. | (14) |
Using Eqs (12–14) the hyperbolic membership function can be written as an equivalent crisp model as follows:
Maximize ξ
Subject to:
(21.52x11+19.52x12+24.28x13+26.28x14+10.76x21+13.52x22+17.28x23+13.76x24+24.28x31+22.28x32+25.52x33+24.52x34)(6418.28)+η≤(6561.42)(6418.28) |
(5.76x11+7.14x12+4.76x13+3.38x14+6.76x21+6.14x22+5.38x23+4.76x24+9.76x31+9.14x32+9.52x33+11.52x34)(6233.82)+η≤(2288.142)(6233.82) |
(4.76x11+4.76x12+3.76x13+6.52x14+3.76x21+6.76x22+4.76x23+4.76x24+5.14x31+3.76x32+4.76x33+6.14x34)(6230.06)+η≤(1739.582)(6230.06) |
x11+x12+x13+x14≤52x21+x22+x23+x24≤56.2x31+x32+x33+x34≤66.96x11+x21+x31≥42.3x12+x22+x32≥39x13+x23+x33≥38.8x14+x24+x34≥42.28 |
η=tanh−1(2ξ−1) |
ξ≥0,xij≥0for all intger i,j. |
Using "LINGO" software, the optimal compromise solution is obtained as follows:
X∗=(x11=30.00, x12=7.34, x13=14.65,x14=0.000, x21=13.00, x22=0.00, x23=0.00, x24=43.00, x31=0.00, x32=32.65,x33=25.34, x34=0.00)‘ |
The values of the objective functions are Z1(X∗)=3250.71, Z2(X∗)=1127.30 and Z3(X∗)=729.84. The overall satisfaction of the DM is ξ=0.7030, that is, the overall satisfaction is 70.30%. The following Table 8 shows the different objective values and the satisfaction level of the DM for different confidence levels.
ω | ξ | Objective values | Feasibility | Satisfaction (%) | ||
Z1 | Z2 | Z3 | ||||
00-0.49 | --- | --- | ----- | --- | Infeasible | --- |
0.50 | Deviation vanishes and problem exists in certain parameters | |||||
0.51 | 0.3416 | 2703.80 | 884.65 | 535.90 | Feasible | 34.16% |
0.55 | 0.6076 | 2733.02 | 900.27 | 550.17 | Feasible | 60.76 |
0.60 | 0.8693 | 2775.79 | 932.65 | 570.11 | Feasible | 86.93% |
0.65 | 1.00 | 2876.73 | 940.12 | 594.44 | Feasible | 100% |
0.70 | 1.00 | 2960.22 | 980.15 | 626.90 | Feasible | 100% |
0.71 | 1.00 | 2870.00 | 985.55 | 672.69 | Feasible | 100% |
0.72 | 1.00 | 2618.98 | 1006.22 | 642.82 | Feasible | 100% |
0.73 | 1.00 | 2646.48 | 1017.60 | 648.61 | Feasible | 100% |
0.74 | 1.00 | 2654.76 | 1022.94 | 647.75 | Feasible | 100% |
0.75 | 1.00 | 3040.13 | 1011.05 | 668.96 | Feasible | 100% |
0.76 | 0.9770 | 3076.68 | 1038.73 | 674.50 | Feasible | 97.70% |
0.77 | 0.9190 | 3101.21 | 1051.87 | 683.32 | Feasible | 91.90% |
0.78 | 0.8990 | 3111.67 | 1057.36 | 690.65 | Feasible | 89.90% |
0.79 | 0.8367 | 3133.11 | 1068.76 | 697.00 | Feasible | 83.67% |
0.80 | 0.7030 | 3250.71 | 1127.30 | 729.84 | Feasible | 70.30 % |
0.81-1.0 | --- | --- | --- | --- | Infeasible | --- |
Note: '---'indicates not applicable. |
Figure 4 exposes an explicit view of the DM's satisfaction level against the different confidence level to achieve the crisp value of the uncertain parameters using the hyperbolic membership function (HMF) of the fuzzy programming. It shows the satisfaction of the DM is dramatically increasing from confidence level 0.51 to 0.65 and then almost static 0.65 to 0.75 and then have a nose down from 0.76 to onward. However, the present transportation problem, solution is not feasible for confidence level 0.00 to 0.49 and for 0.81 to onwards. The reason behind of this result is that the demand becomes greater than supply for choosing the confidence level 0.81 to onwards. The DM shows 100% satisfaction for the confidence level 0.65 to 0.75 and for the rest it decreases in every cases. Deviation of the parameter vanishes and the problem becomes in certain environment when DM chooses the confidence level 0.50.
Again, Figure 5 implies all three objectives for the current problem using the hyperbolic membership function are increasing except for the TP cost and damage at point 0.70. In this point, TP cost goes down slightly and again goes up before going almost straight for the next three point. The damage cost using hyperbolic membership function for this present transportation problem showing increasing behaviour everywhere of the confidence level where the problem has feasible solution.
From the previous discussions, it is clear that there are slight differences in the objective values and the corresponding satisfaction level of the DM for applying different membership function of fuzzy approach. In Table 9, we will have an explicit overview of the objective values applying the fuzzy membership functions for various choice of the DM in between the confidence level of 0.70–0.85.
Hyperbolic membership function | Exponential membership function | DM confidence level | ||||||||
Z1 | Z2 | Z3 | Satisfaction (%) | Feasibility | Z1 | Z2 | Z3 | Satisfaction (%) | Feasibility | |
2960.22 | 980.15 | 626.90 | 100% | Feasible. | 2998.33 | 1009.23 | 630.55 | 53.65% | Feasible. | 0.70 |
2870.00 | 985.55 | 672.69 | 100% | Feasible. | 2986.69 | 975.66 | 661.32 | 89.95% | Feasible. | 0.71 |
2618.98 | 1006.22 | 642.82 | 100% | Feasible. | 2975.95 | 970.74 | 660.97 | 94.20% | Feasible. | 0.72 |
2646.48 | 1017.60 | 648.61 | 100% | Feasible. | 2797.78 | 986.31 | 653.32 | 90.38% | Feasible. | 0.73 |
2654.76 | 1022.94 | 647.75 | 100% | Feasible. | 2757.58 | 996.35 | 655.95 | 86.29% | Feasible. | 0.74 |
3040.13 | 1011.05 | 998.96 | 100% | Feasible. | 3052.88 | 1025.23 | 665.4 | 69.90% | Feasible. | 0.75 |
3076.68 | 1038.73 | 674.50 | 97.70% | Feasible. | 3076.89 | 1038.30 | 674.18 | 63.29% | Feasible. | 0.76 |
3101.21 | 1051.87 | 683.32 | 91.90% | Feasible. | 3101.43 | 1051.45 | 683.00 | 57.35% | Feasible. | 0.77 |
3111.67 | 1057.36 | 690.65 | 89.90% | Feasible. | 3111.67 | 1057.35 | 690.65 | 55.49% | Feasible. | 0.78 |
3133.11 | 1068.76 | 697.00 | 83.67% | Feasible. | 3133.11 | 1068.76 | 697.00 | 51.25% | Feasible. | 0.79 |
3250.71 | 1127.30 | 729.84 | 70.30% | Feasible. | 3231.33 | 1113.65 | 719.65 | 5091% | Feasible. | 0.80 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.81 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.82 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.83 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.84 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.85 |
Note: ' ---' indicates not applicable. |
In Figures 6 to 9, we have a very concrete observations of various parameters of the uncertain transportation problem using fuzzy membership functions. Figure 6 reveals the satisfaction level of the DM for various confidence level using the fuzzy membership functions, linear, exponential and hyperbolic. It is clear from the graph that the satisfaction of DM always better for hyperbolic other than the exponential and linear. For hyperbolic membership function, DM satisfaction level is 100% through confidence level 0.65 to 0.75. On the other hand, for linear and exponential, the DM satisfaction pick their high at 0.72. Again, Hyperbolic and exponential membership function shows their infeasibility after 0.80 where linear is solvable up to 0.85.
Figure 7 unwrapped the transportation cost against the confidence level for the fuzzy membership functions. All the three functions have shown almost same pattern throughout the region except 0.70 to 0.75. The hyperbolic membership function has shown more fluctuation regarding the satisfaction of DM then other two in the area 0.72 to 0.74 whereas the others have same oscillation on that region. All the three membership functions have given equal TP cost from 0.75 to 0.80. The DM have highest satisfaction for transportation cost using the membership functions for confidence level 0.72.
Figure 8 represents the profit corresponding to the confidence level using the fuzzy membership functions. All the membership functions have shown increasing behaviour throughout the interval except at 0.70 where they have slight downward pattern and then again increasing continue towards the end. From the graph it is observed that linear membership function has shown maximum number of profit within our expectation.
From Figure 9, we observed the damage cost of the transportation problem when transporting using the mentioned fuzzy membership functions in uncertain parameters. The graphs presented have shown almost same objective values at all the points where solutions are feasible except have some more increment at 0.71 with immediate nose at 0.72 continue up to 0.74. The DM have the height satisfaction for the damage cot around 660.00 for the chosen confidence level 0.72.
The problem we have discussed can be adopted in many logistic applications including procurement, production, sales, recycling, or even consolidation of shipments. The implications of considering the problem uncertain parameters can be useful for reflecting the real situation while solving it optimally. For the current turbulent working environment, DMs/managers are seeking for tools that can guide them to take the right decision. Decision can be taken by applying this method according to the identified confidence level. The model permits the DMs to calculate the satisfaction level for different uncertain situations. Consequently, the DM can predict his/her desired goal in percent relying on his confidence level before taking decisions. This methodology can also be used by owners, contractors especially in the planning or risk analysis phases.
This study provides a significant contribution that achieves many managerial implications within the logistic sectors:
● It can be used by the DM as an optimization tool. In this case, the DM can select the solution according to the desired objective that could be transportation cost, damage cost or even the profit.
● It presents a decision support system for working with uncertain transportation environment. In which the DM can compute the expected satisfaction level based on his certainty of parameters estimation (i.e., confidence level).
● DM should estimate the confidence level properly in order to avoid the infeasibility of the transportation problem. Whereas, the confidence level affects the variance of the parameters that may lead to increase the demand against the supply.
● The hyperbolic membership function gives stable results against the exponential and linear functions, therefore, the DM could rely on the hyperbolic function.
In this study, uncertain MOTP has been studied throughout the proposed methods. The unknown uncertain parameters were resolved by uncertain normal distribution. Multiple number of models has been designed for MOTP in uncertain parameters using the fuzzy non-linear membership functions with their mathematical algorithm and we have shown the applicability of this algorithms by a heuristic example of same data table with a variety of confidence level of the DM for each case. Sometime the problem becomes infeasible for a chosen confidence level due to the violation of the feasibility condition of the transportation problem. The satisfaction in percent of DM were obtain for the chosen confidence level. Relying on the comparative result, Results show that the hyperbolic function has shown multiple time 100% of the DM in a region but solution is not feasible for a large scale of confidence level but exponential membership function has given more feasible and continuously suitable solution to the DM than hyperbolic. However, the hyperbolic function gives more satisfaction level than the other functions. Priority is one of the realistic features for the DM and hence priority/weight can be incorporated to goal as an uncertain parameter in the current MOTP. Fractional differential equation can be applied to estimate the uncertain MOTP with specific goal to each objectives converting the fuzzy function into fractional order differential equations.
The authors extend their appreciation to the Deputyship for Research and Innovation, Ministry of Education in Saudi Arabia, for funding this research work through the project number (IF-PSAU-2021/01/18925).
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
[1] |
F. L. Hitchcock, The distribution of a product from several sources to numerous localities, J. Math. Phys., 20 (1941), 224–230. https://doi.org/10.1002/sapm1941201224 doi: 10.1002/sapm1941201224
![]() |
[2] |
T. C. Koopmans, Optimum utilization of the transportation system, Econometrica, 17 (1949), 136–146. https://doi.org/10.2307/1907301 doi: 10.2307/1907301
![]() |
[3] | P. R. Thie, G. E. Keough, An introduction to linear programming and game theory, Hoboken: John Wiley & Sons, 2011. |
[4] |
L. A. Zadeh, Fuzzy sets, Inf. Control., 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X doi: 10.1016/S0019-9958(65)90241-X
![]() |
[5] |
S. M. Lee, L. J. Moore, Optimizing transportation problems with multiple objectives, AIIE Trans., 5 (1973), 333–338. https://doi.org/10.1080/05695557308974920 doi: 10.1080/05695557308974920
![]() |
[6] |
H.-J. Zimmermann, Fuzzy programming and linear programming with several objective functions, Fuzzy Sets Syst., 1 (1978), 45–55. https://doi.org/10.1016/0165-0114(78)90031-3 doi: 10.1016/0165-0114(78)90031-3
![]() |
[7] |
H. Isermann, The enumeration of all efficient solutions for a linear multiple-objective transportation problem, Nav. Res. Logt., 26 (1979), 123–139. https://doi.org/10.1002/nav.3800260112 doi: 10.1002/nav.3800260112
![]() |
[8] |
H. Leberling, On finding compromise solutions in multicriteria problems using the fuzzy min-operator, Fuzzy Sets Syst., 6 (1981), 105–118. https://doi.org/10.1016/0165-0114(81)90019-1 doi: 10.1016/0165-0114(81)90019-1
![]() |
[9] |
J. L. Ringuest, D. B. Rinks, Interactive solutions for the linear multiobjective transportation problem, Eur. J. Oper. Res., 32 (1987), 96–106. https://doi.org/10.1016/0377-2217(87)90274-8 doi: 10.1016/0377-2217(87)90274-8
![]() |
[10] |
H. Arsham, A. B. Kahn, A simplex-type algorithm for general transportation problems: An alternative to stepping-stone, J. Oper. Res. Soc., 40 (1989), 581–590. https://doi.org/10.1057/jors.1989.95 doi: 10.1057/jors.1989.95
![]() |
[11] |
S. Chanas, W. Kołodziejczyk, A. Machaj, A fuzzy approach to the transportation problem, Fuzzy Sets Syst., 13 (1984), 211–221. https://doi.org/10.1016/0165-0114(84)90057-5 doi: 10.1016/0165-0114(84)90057-5
![]() |
[12] |
M. Delgado, J. L. Verdegay, M. A. Vila, A general model for fuzzy linear programming, Fuzzy Sets Syst., 29 (1989), 21–29. https://doi.org/10.1016/0165-0114(89)90133-4 doi: 10.1016/0165-0114(89)90133-4
![]() |
[13] |
A. K. Bit, M. P. Biswal, S. Alam, Fuzzy programming approach to multicriteria decision making transportation problem, Fuzzy Sets Syst., 50 (1992), 135–141. https://doi.org/10.1016/0165-0114(92)90212-M doi: 10.1016/0165-0114(92)90212-M
![]() |
[14] |
R. G. Yaghin, F. Darvishi, Order allocation and procurement transport planning in apparel supply chain: A utility-based possibilistic-flexible programming approach, Fuzzy Sets Syst., 398 (2020), 1–33. https://doi.org/10.1016/j.fss.2019.09.016 doi: 10.1016/j.fss.2019.09.016
![]() |
[15] |
R. Verma, M. P. Biswal, A. Biswas, Fuzzy programming technique to solve multi-objective transportation problems with some non-linear membership functions, Fuzzy Sets Syst., 91 (1997), 37–43. https://doi.org/10.1016/S0165-0114(96)00148-0 doi: 10.1016/S0165-0114(96)00148-0
![]() |
[16] |
W. F. Abd El-Wahed, M. A. Abo-Sinna, A hybrid fuzzy-goal programming approach to multiple objective decision making problems, Fuzzy Sets Syst., 119 (2001), 71–85. https://doi.org/10.1016/S0165-0114(99)00050-0 doi: 10.1016/S0165-0114(99)00050-0
![]() |
[17] | B. D. Liu, Uncertainty theory, Berlin: Springer, 2007. |
[18] | B. D. Liu, Fuzzy process, hybrid process and uncertain process, J. Uncertain Syst., 2 (2008), 3–16. |
[19] | B. D. Liu, Theory and practice of uncertain programming, Berlin, Heidelberg: Springer, 2009. |
[20] | B. D. Liu, Some research problems in uncertainty theory, J. Uncertain Syst., 3 (2009), 3–10. |
[21] | B. D. Liu, Uncertainty theory: A branch of mathematics for modeling human uncertainty, Berlin: Springer, 2010. |
[22] | Y. H. Liu, H. Minghu, Expected value of function of uncertain variables, J. Uncertain Syst., 4 (2010), 181–186. |
[23] |
G. Maity, S. K. Roy, J. L. Verdegay, Multi-objective transportation problem with cost reliability under uncertain environment, Int. J. Comput. Intell. Syst., 9 (2016), 839–849. https://doi.org/10.1080/18756891.2016.1237184 doi: 10.1080/18756891.2016.1237184
![]() |
[24] |
I. A. Baky, Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach, Appl. Math. Model., 34 (2010), 2377–2387. https://doi.org/10.1016/j.apm.2009.11.004 doi: 10.1016/j.apm.2009.11.004
![]() |
[25] |
A. Ojha, S. K. Mondal, M. Maiti, Transportation policies for single and multi-objective transportation problem using fuzzy logic, Math. Comput. Model., 53 (2011), 1637–1646. https://doi.org/10.1016/j.mcm.2010.12.029 doi: 10.1016/j.mcm.2010.12.029
![]() |
[26] |
P. Kundu, S. Kar, M. Maiti, Multi-objective multi-item solid transportation problem in fuzzy environment, Appl. Math. Model., 37 (2013), 2028–2038. https://doi.org/10.1016/j.apm.2012.04.026 doi: 10.1016/j.apm.2012.04.026
![]() |
[27] |
H. Y. Guo, X. S. Wang, S. L. Zhou, A transportation problem with uncertain costs and random supplies, e-Navi., 2 (2015), 1–11. https://doi.org/10.1016/j.enavi.2015.06.001 doi: 10.1016/j.enavi.2015.06.001
![]() |
[28] |
M. S. Uddin, S. K. Roy, M. M. Ahmed, An approach to solve multi-objective transportation problem using fuzzy goal programming and genetic algorithm, AIP Conf. Proc., 1978 (2018), 470095. https://doi.org/10.1063/1.5044165 doi: 10.1063/1.5044165
![]() |
[29] |
N. Umarusman, Fuzzy goal programming problem based on minmax approach for optimal system design, Alphanumeric J., 6 (2018), 177–192. https://doi.org/10.17093/alphanumeric.404680 doi: 10.17093/alphanumeric.404680
![]() |
[30] |
P. Singh, S. Kumari, P. Singh, Fuzzy efficient interactive goal programming approach for multi-objective transportation problems, Int. J. Appl. Comput. Math., 3 (2017), 505–525. https://doi.org/10.1007/s40819-016-0155-x doi: 10.1007/s40819-016-0155-x
![]() |
[31] |
M. S. Uddin, M. Miah, Md A.-A. Khan, A. Alarjani, Goal programming tactic for uncertain multi-objective transportation problem using fuzzy linear membership function, Alex. Eng. J., 60 (2021), 2525–2533. https://doi.org/10.1016/j.aej.2020.12.039 doi: 10.1016/j.aej.2020.12.039
![]() |
[32] |
F. Darvishi, R. G. Yaghin, A. Sadeghi, Integrated fabric procurement and multi-site apparel production planning with cross-docking: A hybrid fuzzy-robust stochastic programming approach, Appl. Soft Comput., 92 (2020), 106267. https://doi.org/10.1016/j.asoc.2020.106267 doi: 10.1016/j.asoc.2020.106267
![]() |
[33] |
R. G. Yaghin, F. Darvishi, Integrated textile material and production management in a fuzzy environment: A logistics perspective, J. Text. Inst., 113 (2022), 1380–1400. https://doi.org/10.1080/00405000.2021.1929705 doi: 10.1080/00405000.2021.1929705
![]() |
[34] |
I. Ali, A. Fügenschuh, S. Gupta, U. M. Modibbo, The LR-type fuzzy multi objective vendor selection problem in supply chain management, Mathematics, 8 (2020), 1621. https://doi.org/10.3390/math8091621 doi: 10.3390/math8091621
![]() |
[35] |
M. F. Khan, U. M. Modibbo, N. Ahmad, I. Ali, Nonlinear optimization in bi-level selective maintenance allocation problem, J. King Saud Univ.-Sci., 34 (2022), 101933. https://doi.org/10.1016/j.jksus.2022.101933 doi: 10.1016/j.jksus.2022.101933
![]() |
[36] |
P. Kaliyaperumal, A. Das, A mathematical model for nonlinear optimization which attempts membership functions to address the uncertainties, Mathematics, 10 (2022), 1743. https://doi.org/10.3390/math10101743 doi: 10.3390/math10101743
![]() |
[37] |
M. Zam'An, Y. Dasril, C. Ramasamy, N. Bujang, Y. N. Ifriza, Improved segregated advancement (I-SA): A new method for solving full triangular fuzzy transportation problems, Int. J. Manag. Sci. Eng. Manag., 2022, 1–11. https://doi.org/10.1080/17509653.2022.2118885 doi: 10.1080/17509653.2022.2118885
![]() |
[38] |
M. Kamal, U. M. Modibbo, A. AlArjani, I. Ali, Neutrosophic fuzzy goal programming approach in selective maintenance allocation of system reliability, Complex Intell. Syst., 7 (2021), 1045–1059. https://doi.org/10.1007/s40747-021-00269-1 doi: 10.1007/s40747-021-00269-1
![]() |
[39] |
S. Mahajan, S. K. Gupta, On optimistic, pessimistic and mixed approaches under different membership functions for fully intuitionistic fuzzy multiobjective nonlinear programming problems, Expert Syst. Appl., 168 (2021), 114309. https://doi.org/10.1016/j.eswa.2020.114309 doi: 10.1016/j.eswa.2020.114309
![]() |
[40] |
M. F. Khan, A. Pervez, U. M. Modibbo, J. Chauhan, I. Ali, Flexible fuzzy goal programming approach in optimal mix of power generation for socio-economic sustainability: A case study, Sustainability, 13 (2021), 8256. https://doi.org/10.3390/su13158256 doi: 10.3390/su13158256
![]() |
[41] |
Y. Kacher, P. Singh, Fuzzy harmonic mean technique for solving fully fuzzy multi-objective transportation problem, J. Comput. Sci., 63 (2022), 101782. https://doi.org/10.1016/j.jocs.2022.101782 doi: 10.1016/j.jocs.2022.101782
![]() |
[42] |
Y. Kacher, P. Singh, A comprehensive literature review on transportation problems, Int. J. Appl. Comput. Math., 7 (2021), 206. https://doi.org/10.1007/s40819-021-01134-y doi: 10.1007/s40819-021-01134-y
![]() |
1. | Abu Sayeed Arif, Md. Ashraful Babu, Aminur Rahman Khan, Mohammad Nazrul Islam, Md. Sharif Uddin, Ramesh Chandra Poonia, 2024, Priority-driven Unbalanced Transportation Problem (PUTP) to obtain better Initial Feasible Solution, 979-8-3503-8365-2, 1, 10.1109/InC460750.2024.10649090 | |
2. | Abu Sayeed Arif, Md. Ashraful Babu, Mohammad Nazrul Islam, Md. Sharif Uddin, Ramesh Chandra Poonia, 2024, Chapter 27, 978-981-97-7093-9, 337, 10.1007/978-981-97-7094-6_27 | |
3. | Ibrahim M. Hezam, A bi-level humanitarian response plan design model considering equity and efficiency—the example of Yemen, 2023, 8, 2473-6988, 19172, 10.3934/math.2023979 | |
4. | Rakesh Kumar, Wattana Viriyasitavat, Assadaporn Sapsomboon, Gaurav Dhiman, Reem Alshahrani, Suhare Solaiman, Rashmi Choudhary, Protyay Dey, R. Sivaranjani, A Symmetric and Comparative Study of Decision Making in Intuitionistic Multi-objective Optimization Environment: Past, Present and Future, 2025, 1134-3060, 10.1007/s11831-025-10243-6 |
Z1(X) | Z2(X) | . | . | . | Zk(X) | |
X(1) | Z11 | Z12 | . | . | . | Z1K |
X(2) | Z21 | Z22 | . | . | . | Z2K |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
X(k) | ZK1 | ZK2 | . | . | . | ZKK |
Entity | Data matrix | ||||
Uncertain transportation cost C1ij: | D1 | D2 | D3 | D4 | |
S1 | (20, 2) | (18, 2) | (22, 3) | (24, 3) | |
S2 | (10, 1) | (12, 2) | (15, 3) | (13, 1) | |
S3 | (22, 3) | (20, 3) | (24, 2) | (23, 2) | |
Uncertain transformed profit C2ij: | D1 | D2 | D3 | D4 | |
S1 | (5, 1) | (6, 1.5) | (4, 1) | (3, 0.5) | |
S2 | (6, 1) | (5, 1.5) | (5, 0.5) | (4, 1) | |
S3 | (9, 1) | (8, 1.5) | (8, 2) | (10, 2) | |
Uncertain damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | (4, 1) | (4, 1) | (3, 1) | (5, 2) | |
S2 | (3, 1) | (6, 1) | (4, 1) | (4, 1) | |
S3 | (4, 1.5) | (3, 1) | (4, 1) | (5, 1.5) | |
Uncertain demand: |
b1 | b2 | b3 | b4 | |
(40, 3) | (36, 4) | (35, 5) | (40, 3) | ||
Uncertain supply: |
a1 | a2 | a3 | ||
(55, 4) | (60, 5) | (70, 4) |
Entity | Data matrix | ||||
Crisp value for cost C1ij: |
D1 | D2 | D3 | D4 | |
S1 | 21.22 | 19.22 | 23.83 | 25.83 | |
S2 | 10.61 | 13.22 | 16.83 | 13.61 | |
S3 | 23.83 | 21.83 | 25.22 | 24.22 | |
Crisp value for the transformed profit C2ij: |
D1 | D2 | D3 | D4 | |
S1 | 5.61 | 6.92 | 4.61 | 3.31 | |
S2 | 6.61 | 5.92 | 5.31 | 4.61 | |
S3 | 9.61 | 8.92 | 9.92 | 11.22 | |
Crisp value for damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | 4.61 | 4.61 | 3.61 | 6.22 | |
S2 | 3.61 | 6.61 | 4.61 | 4.61 | |
S3 | 4.92 | 3.61 | 4.61 | 5.92 | |
Crisp value for demand: | b1 | b2 | b3 | b4 | |
41.8 | 38.4 | 38.05 | 41.83 | ||
Crisp value for supply: | a1 | a2 | a3 | ||
52.6 | 57 | 67.56 |
Z1(X) | Z2(X) | Z3(X) | |
X(1) | 2968.8 | 1193.69 | 715.84 |
X(2) | 3368.8 | 980.4 | 776.68 |
X(3) | 3038.79 | 1049.51 | 648.6 |
Mk | 3368.8 | 1193.69 | 776.68 |
Lk | 2968.8 | 980.4 | 648.6 |
ω | ξ | Objective values | Feasibility | Satisfaction (%) | ||
Z1 | Z2 | Z3 | ||||
00-0.49 | --- | --- | --- | --- | Infeasible | --- |
0.50 | Deviation vanishes and problem exists in certain parameters | |||||
0.51 | 0.3264 | 2703.93 | 884.33 | 535.83 | Feasible | 32.649% |
0.55 | 0.4111 | 2733.02 | 900.273 | 550.17 | Feasible | 41.11% |
0.60 | 0.4462 | 2797.80 | 945.64 | 573.7 | Feasible | 44.62% |
0.65 | 0.5158 | 2918.63 | 975.63 | 599.41 | Feasible | 51.58% |
0.70 | 0.5365 | 2998.33 | 1009.23 | 630.55 | Feasible | 53.65 % |
0.71 | 0.8995 | 2986.69 | 975.66 | 661.32 | Feasible | 89.95% |
0.72 | 0.9420 | 2975.95 | 970.74 | 660.97 | Feasible | 94.20% |
0.73 | 0.9038 | 2797.78 | 986.31 | 653.32 | Feasible | 90.38% |
0.74 | 0.8629 | 2757.58 | 996.35 | 655.95 | Feasible | 86.29% |
0.75 | 0.6990 | 3052.88 | 1025.23 | 665.4 | Feasible | 69.90 % |
0.76 | 0.6329 | 3076.89 | 1038.30 | 674.18 | Feasible | 63.29% |
0.77 | 0.5735 | 3101.43 | 1051.45 | 683.00 | Feasible | 57.35% |
0.78 | 0.5549 | 3111.67 | 1057.35 | 690.65 | Feasible | 55.49% |
0.79 | 0.5123 | 3133.11 | 1068.76 | 697.00 | Feasible | 51.23% |
0.80 | 0.5091 | 3231.33 | 1113.65 | 719.65 | Feasible | 50.91 % |
0.81-1.00 | - | - | - | - | Infeasible | - |
Note: '---'indicates not applicable. |
Entity | Data matrix | ||||
Crisp value for cost C1ij: |
D1 | D2 | D3 | D4 | |
S1 | 21.52 | 19.52 | 24.28 | 26.28 | |
S2 | 10.76 | 13.52 | 17.28 | 13.76 | |
S3 | 24.28 | 22.28 | 25.52 | 24.52 | |
Crisp value for the transformed profit C2ij: |
D1 | D2 | D3 | D4 | |
S1 | 5.76 | 7.14 | 4.76 | 3.38 | |
S2 | 6.76 | 6.14 | 5.38 | 4.76 | |
S3 | 9.76 | 9.14 | 9.52 | 11.52 | |
Crisp value for damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | 4.76 | 4.76 | 3.76 | 6.52 | |
S2 | 3.76 | 6.76 | 4.76 | 4.76 | |
S3 | 5.14 | 3.76 | 4.76 | 6.14 | |
Crisp value for demand: | b1 | b2 | b3 | b4 | |
42.3 | 39.0 | 38.8 | 42.28 | ||
Crisp value for supply: | a1 | a2 | a3 | ||
52.0 | 56.2 | 66.96 |
Z1(X) | Z2(X) | Z3(X) | |
X(1) | 3071.56 | 1260.98 | 754.76 |
X(2) | 3489.84 | 1027.16 | 869.2 |
X(3) | 3146.96 | 1114.34 | 984.82 |
Mk | 3489.84 | 1260.98 | 984.82 |
Lk | 3071.56 | 1027.16 | 754.76 |
ω | ξ | Objective values | Feasibility | Satisfaction (%) | ||
Z1 | Z2 | Z3 | ||||
00-0.49 | --- | --- | ----- | --- | Infeasible | --- |
0.50 | Deviation vanishes and problem exists in certain parameters | |||||
0.51 | 0.3416 | 2703.80 | 884.65 | 535.90 | Feasible | 34.16% |
0.55 | 0.6076 | 2733.02 | 900.27 | 550.17 | Feasible | 60.76 |
0.60 | 0.8693 | 2775.79 | 932.65 | 570.11 | Feasible | 86.93% |
0.65 | 1.00 | 2876.73 | 940.12 | 594.44 | Feasible | 100% |
0.70 | 1.00 | 2960.22 | 980.15 | 626.90 | Feasible | 100% |
0.71 | 1.00 | 2870.00 | 985.55 | 672.69 | Feasible | 100% |
0.72 | 1.00 | 2618.98 | 1006.22 | 642.82 | Feasible | 100% |
0.73 | 1.00 | 2646.48 | 1017.60 | 648.61 | Feasible | 100% |
0.74 | 1.00 | 2654.76 | 1022.94 | 647.75 | Feasible | 100% |
0.75 | 1.00 | 3040.13 | 1011.05 | 668.96 | Feasible | 100% |
0.76 | 0.9770 | 3076.68 | 1038.73 | 674.50 | Feasible | 97.70% |
0.77 | 0.9190 | 3101.21 | 1051.87 | 683.32 | Feasible | 91.90% |
0.78 | 0.8990 | 3111.67 | 1057.36 | 690.65 | Feasible | 89.90% |
0.79 | 0.8367 | 3133.11 | 1068.76 | 697.00 | Feasible | 83.67% |
0.80 | 0.7030 | 3250.71 | 1127.30 | 729.84 | Feasible | 70.30 % |
0.81-1.0 | --- | --- | --- | --- | Infeasible | --- |
Note: '---'indicates not applicable. |
Hyperbolic membership function | Exponential membership function | DM confidence level | ||||||||
Z1 | Z2 | Z3 | Satisfaction (%) | Feasibility | Z1 | Z2 | Z3 | Satisfaction (%) | Feasibility | |
2960.22 | 980.15 | 626.90 | 100% | Feasible. | 2998.33 | 1009.23 | 630.55 | 53.65% | Feasible. | 0.70 |
2870.00 | 985.55 | 672.69 | 100% | Feasible. | 2986.69 | 975.66 | 661.32 | 89.95% | Feasible. | 0.71 |
2618.98 | 1006.22 | 642.82 | 100% | Feasible. | 2975.95 | 970.74 | 660.97 | 94.20% | Feasible. | 0.72 |
2646.48 | 1017.60 | 648.61 | 100% | Feasible. | 2797.78 | 986.31 | 653.32 | 90.38% | Feasible. | 0.73 |
2654.76 | 1022.94 | 647.75 | 100% | Feasible. | 2757.58 | 996.35 | 655.95 | 86.29% | Feasible. | 0.74 |
3040.13 | 1011.05 | 998.96 | 100% | Feasible. | 3052.88 | 1025.23 | 665.4 | 69.90% | Feasible. | 0.75 |
3076.68 | 1038.73 | 674.50 | 97.70% | Feasible. | 3076.89 | 1038.30 | 674.18 | 63.29% | Feasible. | 0.76 |
3101.21 | 1051.87 | 683.32 | 91.90% | Feasible. | 3101.43 | 1051.45 | 683.00 | 57.35% | Feasible. | 0.77 |
3111.67 | 1057.36 | 690.65 | 89.90% | Feasible. | 3111.67 | 1057.35 | 690.65 | 55.49% | Feasible. | 0.78 |
3133.11 | 1068.76 | 697.00 | 83.67% | Feasible. | 3133.11 | 1068.76 | 697.00 | 51.25% | Feasible. | 0.79 |
3250.71 | 1127.30 | 729.84 | 70.30% | Feasible. | 3231.33 | 1113.65 | 719.65 | 5091% | Feasible. | 0.80 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.81 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.82 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.83 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.84 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.85 |
Note: ' ---' indicates not applicable. |
Z1(X) | Z2(X) | . | . | . | Zk(X) | |
X(1) | Z11 | Z12 | . | . | . | Z1K |
X(2) | Z21 | Z22 | . | . | . | Z2K |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
. | . | . | . | . | . | . |
X(k) | ZK1 | ZK2 | . | . | . | ZKK |
Entity | Data matrix | ||||
Uncertain transportation cost C1ij: | D1 | D2 | D3 | D4 | |
S1 | (20, 2) | (18, 2) | (22, 3) | (24, 3) | |
S2 | (10, 1) | (12, 2) | (15, 3) | (13, 1) | |
S3 | (22, 3) | (20, 3) | (24, 2) | (23, 2) | |
Uncertain transformed profit C2ij: | D1 | D2 | D3 | D4 | |
S1 | (5, 1) | (6, 1.5) | (4, 1) | (3, 0.5) | |
S2 | (6, 1) | (5, 1.5) | (5, 0.5) | (4, 1) | |
S3 | (9, 1) | (8, 1.5) | (8, 2) | (10, 2) | |
Uncertain damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | (4, 1) | (4, 1) | (3, 1) | (5, 2) | |
S2 | (3, 1) | (6, 1) | (4, 1) | (4, 1) | |
S3 | (4, 1.5) | (3, 1) | (4, 1) | (5, 1.5) | |
Uncertain demand: |
b1 | b2 | b3 | b4 | |
(40, 3) | (36, 4) | (35, 5) | (40, 3) | ||
Uncertain supply: |
a1 | a2 | a3 | ||
(55, 4) | (60, 5) | (70, 4) |
Entity | Data matrix | ||||
Crisp value for cost C1ij: |
D1 | D2 | D3 | D4 | |
S1 | 21.22 | 19.22 | 23.83 | 25.83 | |
S2 | 10.61 | 13.22 | 16.83 | 13.61 | |
S3 | 23.83 | 21.83 | 25.22 | 24.22 | |
Crisp value for the transformed profit C2ij: |
D1 | D2 | D3 | D4 | |
S1 | 5.61 | 6.92 | 4.61 | 3.31 | |
S2 | 6.61 | 5.92 | 5.31 | 4.61 | |
S3 | 9.61 | 8.92 | 9.92 | 11.22 | |
Crisp value for damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | 4.61 | 4.61 | 3.61 | 6.22 | |
S2 | 3.61 | 6.61 | 4.61 | 4.61 | |
S3 | 4.92 | 3.61 | 4.61 | 5.92 | |
Crisp value for demand: | b1 | b2 | b3 | b4 | |
41.8 | 38.4 | 38.05 | 41.83 | ||
Crisp value for supply: | a1 | a2 | a3 | ||
52.6 | 57 | 67.56 |
Z1(X) | Z2(X) | Z3(X) | |
X(1) | 2968.8 | 1193.69 | 715.84 |
X(2) | 3368.8 | 980.4 | 776.68 |
X(3) | 3038.79 | 1049.51 | 648.6 |
Mk | 3368.8 | 1193.69 | 776.68 |
Lk | 2968.8 | 980.4 | 648.6 |
ω | ξ | Objective values | Feasibility | Satisfaction (%) | ||
Z1 | Z2 | Z3 | ||||
00-0.49 | --- | --- | --- | --- | Infeasible | --- |
0.50 | Deviation vanishes and problem exists in certain parameters | |||||
0.51 | 0.3264 | 2703.93 | 884.33 | 535.83 | Feasible | 32.649% |
0.55 | 0.4111 | 2733.02 | 900.273 | 550.17 | Feasible | 41.11% |
0.60 | 0.4462 | 2797.80 | 945.64 | 573.7 | Feasible | 44.62% |
0.65 | 0.5158 | 2918.63 | 975.63 | 599.41 | Feasible | 51.58% |
0.70 | 0.5365 | 2998.33 | 1009.23 | 630.55 | Feasible | 53.65 % |
0.71 | 0.8995 | 2986.69 | 975.66 | 661.32 | Feasible | 89.95% |
0.72 | 0.9420 | 2975.95 | 970.74 | 660.97 | Feasible | 94.20% |
0.73 | 0.9038 | 2797.78 | 986.31 | 653.32 | Feasible | 90.38% |
0.74 | 0.8629 | 2757.58 | 996.35 | 655.95 | Feasible | 86.29% |
0.75 | 0.6990 | 3052.88 | 1025.23 | 665.4 | Feasible | 69.90 % |
0.76 | 0.6329 | 3076.89 | 1038.30 | 674.18 | Feasible | 63.29% |
0.77 | 0.5735 | 3101.43 | 1051.45 | 683.00 | Feasible | 57.35% |
0.78 | 0.5549 | 3111.67 | 1057.35 | 690.65 | Feasible | 55.49% |
0.79 | 0.5123 | 3133.11 | 1068.76 | 697.00 | Feasible | 51.23% |
0.80 | 0.5091 | 3231.33 | 1113.65 | 719.65 | Feasible | 50.91 % |
0.81-1.00 | - | - | - | - | Infeasible | - |
Note: '---'indicates not applicable. |
Entity | Data matrix | ||||
Crisp value for cost C1ij: |
D1 | D2 | D3 | D4 | |
S1 | 21.52 | 19.52 | 24.28 | 26.28 | |
S2 | 10.76 | 13.52 | 17.28 | 13.76 | |
S3 | 24.28 | 22.28 | 25.52 | 24.52 | |
Crisp value for the transformed profit C2ij: |
D1 | D2 | D3 | D4 | |
S1 | 5.76 | 7.14 | 4.76 | 3.38 | |
S2 | 6.76 | 6.14 | 5.38 | 4.76 | |
S3 | 9.76 | 9.14 | 9.52 | 11.52 | |
Crisp value for damage cost C3ij: | D1 | D2 | D3 | D4 | |
S1 | 4.76 | 4.76 | 3.76 | 6.52 | |
S2 | 3.76 | 6.76 | 4.76 | 4.76 | |
S3 | 5.14 | 3.76 | 4.76 | 6.14 | |
Crisp value for demand: | b1 | b2 | b3 | b4 | |
42.3 | 39.0 | 38.8 | 42.28 | ||
Crisp value for supply: | a1 | a2 | a3 | ||
52.0 | 56.2 | 66.96 |
Z1(X) | Z2(X) | Z3(X) | |
X(1) | 3071.56 | 1260.98 | 754.76 |
X(2) | 3489.84 | 1027.16 | 869.2 |
X(3) | 3146.96 | 1114.34 | 984.82 |
Mk | 3489.84 | 1260.98 | 984.82 |
Lk | 3071.56 | 1027.16 | 754.76 |
ω | ξ | Objective values | Feasibility | Satisfaction (%) | ||
Z1 | Z2 | Z3 | ||||
00-0.49 | --- | --- | ----- | --- | Infeasible | --- |
0.50 | Deviation vanishes and problem exists in certain parameters | |||||
0.51 | 0.3416 | 2703.80 | 884.65 | 535.90 | Feasible | 34.16% |
0.55 | 0.6076 | 2733.02 | 900.27 | 550.17 | Feasible | 60.76 |
0.60 | 0.8693 | 2775.79 | 932.65 | 570.11 | Feasible | 86.93% |
0.65 | 1.00 | 2876.73 | 940.12 | 594.44 | Feasible | 100% |
0.70 | 1.00 | 2960.22 | 980.15 | 626.90 | Feasible | 100% |
0.71 | 1.00 | 2870.00 | 985.55 | 672.69 | Feasible | 100% |
0.72 | 1.00 | 2618.98 | 1006.22 | 642.82 | Feasible | 100% |
0.73 | 1.00 | 2646.48 | 1017.60 | 648.61 | Feasible | 100% |
0.74 | 1.00 | 2654.76 | 1022.94 | 647.75 | Feasible | 100% |
0.75 | 1.00 | 3040.13 | 1011.05 | 668.96 | Feasible | 100% |
0.76 | 0.9770 | 3076.68 | 1038.73 | 674.50 | Feasible | 97.70% |
0.77 | 0.9190 | 3101.21 | 1051.87 | 683.32 | Feasible | 91.90% |
0.78 | 0.8990 | 3111.67 | 1057.36 | 690.65 | Feasible | 89.90% |
0.79 | 0.8367 | 3133.11 | 1068.76 | 697.00 | Feasible | 83.67% |
0.80 | 0.7030 | 3250.71 | 1127.30 | 729.84 | Feasible | 70.30 % |
0.81-1.0 | --- | --- | --- | --- | Infeasible | --- |
Note: '---'indicates not applicable. |
Hyperbolic membership function | Exponential membership function | DM confidence level | ||||||||
Z1 | Z2 | Z3 | Satisfaction (%) | Feasibility | Z1 | Z2 | Z3 | Satisfaction (%) | Feasibility | |
2960.22 | 980.15 | 626.90 | 100% | Feasible. | 2998.33 | 1009.23 | 630.55 | 53.65% | Feasible. | 0.70 |
2870.00 | 985.55 | 672.69 | 100% | Feasible. | 2986.69 | 975.66 | 661.32 | 89.95% | Feasible. | 0.71 |
2618.98 | 1006.22 | 642.82 | 100% | Feasible. | 2975.95 | 970.74 | 660.97 | 94.20% | Feasible. | 0.72 |
2646.48 | 1017.60 | 648.61 | 100% | Feasible. | 2797.78 | 986.31 | 653.32 | 90.38% | Feasible. | 0.73 |
2654.76 | 1022.94 | 647.75 | 100% | Feasible. | 2757.58 | 996.35 | 655.95 | 86.29% | Feasible. | 0.74 |
3040.13 | 1011.05 | 998.96 | 100% | Feasible. | 3052.88 | 1025.23 | 665.4 | 69.90% | Feasible. | 0.75 |
3076.68 | 1038.73 | 674.50 | 97.70% | Feasible. | 3076.89 | 1038.30 | 674.18 | 63.29% | Feasible. | 0.76 |
3101.21 | 1051.87 | 683.32 | 91.90% | Feasible. | 3101.43 | 1051.45 | 683.00 | 57.35% | Feasible. | 0.77 |
3111.67 | 1057.36 | 690.65 | 89.90% | Feasible. | 3111.67 | 1057.35 | 690.65 | 55.49% | Feasible. | 0.78 |
3133.11 | 1068.76 | 697.00 | 83.67% | Feasible. | 3133.11 | 1068.76 | 697.00 | 51.25% | Feasible. | 0.79 |
3250.71 | 1127.30 | 729.84 | 70.30% | Feasible. | 3231.33 | 1113.65 | 719.65 | 5091% | Feasible. | 0.80 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.81 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.82 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.83 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.84 |
- | - | - | - | Infeasible | - | - | - | - | Infeasible | 0.85 |
Note: ' ---' indicates not applicable. |