Abstract
We propound the idea of the partitioned dual Maclaurin symmetric mean (PDMSM) operator stimulated by the partitioned Maclaurin symmetric mean, suppose that we can partition overall attributes into some portions and the attributes are interrelated in the same portion, but the attributes are not interrelated in different portions. We can deal with decision-making issues using PDMSM operator in the intuitionistic fuzzy environment. We also analysis features and peculiar instance of the PDMSM operator. And, we extend the PDMSM operator to introduce the intuitionistic fuzzy partitioned dual Maclaurin symmetric mean operator and the weighted intuitionistic fuzzy partitioned dual Maclaurin symmetric mean operator. Then, we analysis several characteristics and peculiar instances of the developed operators. A new multiple attribute decision-making (MADM) approach grounded on the established weighted intuitionistic fuzzy partitioned dual Maclaurin symmetric mean operator is propounded; the MADM method is to choose the optimal alternative from several alternatives. Finally, we demonstrate the designed method is more general and effective than existing methods through comparative analysis.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Multiple attribute decision-making (MADM) method is to choose the best alternative from viable alternatives; it has attracted more and more attention of people and been used in many aspects, such as financial risk management, location selection and so forth. Owing to the intricacy of MADM issues and multiple attribute group decision-making (MAGDM) issues, using precise values to depict attribute values of alternatives is difficult. On this case, Zadeh [1] developed the fuzzy sets (FSs), which utilize the membership degree to estimate alternatives and have been studied extensively. However, the FSs have only the membership degree and are usual hard to depict much more complex fuzzy information. For purpose of surmounting above shorting, Atanassov [2] presented the intuitionistic fuzzy set (IFS); it is an extensiveness of FSs increasing non-membership degree and hesitant degree. Further, Xu and Yager [3] established the intuitionistic fuzzy numbers (IFNs) and operational rules of IFNs. In recent years, the IFNs have been diffusely used to cope with MADM issues, Garg et al. [4] introduced improved possibility degree method to rank intuitionistic fuzzy numbers, Joshi [5] established a new bi-parametric exponential information measure based on IFS, IFS combined with linguistic sets [6,7,8] and MAGDM issues [9,10,11,12]. Molodtsov [13] introduced soft sets, LEE [14] introduced bipolar valued fuzzy sets, and Mahmood [15] established bipolar valued soft sets; they are also generalizations of fuzzy sets and used in decision making [16, 17]. In order to resolve decision-making problems (DMPs), the aggregation operators (AOs) are one of the most popular tools, which combine all the input individual arguments into a single argument, many studies have been made [18,19,20,21]. The weighted arithmetic operators were introduced by Xu [22] and Xu et al. [3, 23] proposed the weighted geometric operators based on the IFNs. In these AOs, the attributes are independent of each other. However, the relation of attribute cannot be ignored in DMPs. So, some operators consider that there is correlation between the aggregated arguments. In [24], Bonferroni developed the Bonferroni mean (BM); it presumes that correlation exists between any two arguments. Xu et al. [23] propounded the intuitionistic fuzzy BM (IFBM) operator and studied some desirable properties of IFBM operator. Xia et al. [25] put forward the geometric Bonferroni mean (GBM) by considering both the Bonferroni mean and the geometric mean for IFNs. Dutta et al. [26] introduced aggregation operators to fuse Extended Comparative LinguistiC Expressions with Symbolic Translation (ELICIT) information, namely ELICITBM, ELICITEBM and ELICITPBM. The Heronian mean (HM) which can capture correlation between two arguments was proposed by Sykora [27]. Liu et al. [28] introduced partitioned HM operator in linguistic intuitionistic fuzzy environment. Mo et al. [29] introduced Archimedean geometric Heronian mean operators in dual hesitant fuzzy environment.
The Maclaurin symmetric mean (MSM) was originally proposed by Maclaurin [30], which is a popular operator with aggregation function, it can capture the relation among multiple input arguments and then was extended by Detemple and Robertson [31], while BM and HM capture the relationship between two input arguments. The MSM operator was used to solve DMPs [32,33,34,35] with linguistic fuzzy set, used in IFS environment [36], used in q-rung interval-valued orthopair fuzzy environment [37], and used in dual hesitant fuzzy soft set environment [38]. Further, Qin and Liu [19] established the intuitionistic fuzzy MSM (IFMSM) and the weighted IFMSM (WIFMSM). In [39], Qin and Liu introduced the dual Maclaurin symmetric mean (DMSM) operator, which considers the interrelationship among multiple input arguments; there are some generalizations of DMSM. Shi and Xiao [40] established the reducible weighted dual Maclaurin symmetric mean (RWDMSM) operator, Qin and Liu [39] purposed some operators (the uncertain linguistic Choquet dual Maclaurin symmetric mean (ULCDMSM), the uncertain linguistic dual Maclaurin symmetric mean (ULDMSM), the uncertain linguistic weighted dual Maclaurin symmetric mean (ULWDMSM)), Darko et al. [41] established operators (dual hesitant fuzzy dual MSM and weighted dual hesitant fuzzy dual MSM operators), and Wang et al. [42] extended DMSM to interval-valued 2-tuple linguistic Pythagorean fuzzy numbers (IV2TLPFNs); these operators are able to reflect relationship among multiple attributes. However, in real decision-making situations, relation may not exist between attributes. For example, selecting a laptop from several laptops, we can consider following four attributes: basic requirements \((Z_{1})\), customer comments \((Z_{2})\), price comparison \((Z_{3})\), appearance characteristic \((Z_{4})\). These four attributes can be divided into two partitions: \(P_{1}=\{Z_{1}, Z_{4}\}\) and \(P_{2}=\{Z_{2}, Z_{3}\}\). We can know that the attribute \(Z_{1}\) is interrelated to \(Z_{4}\), they are all in \(P_{1}\); the attribute \(Z_{2}\) is interrelated to \(Z_{3}\), they are all in \(P_{2}\). But, there does not exist relationship between the partitions \(P_{1}\) and \(P_{2}\). Based on the condition, the partitioned Bonferroni mean (PBM) operator was presented by Dutta and Guha [43], Liu et al. [44] propounded the partitioned Maclaurin symmetric mean (PMSM) operator based on IFNs, these operators which suppose that total attributes are split into a few parts, and there exists relation between attributes in the same part and does not exist relation between attributes of diverse parts.
The DMSM operator considers that attributes are existing multiple relation. As previous study, it is easily found that generalizations of DMSM just only consider the case that attributes are relevant. But, in real DMPs, there may be not relationship between some attributes. Therefore, it is necessary that introduced the partitioned DMSM (PDMSM) to consider there is no relationship between some attributes. In this paper, our goals are: (1) to establish the PDMSM operator to surmount the drawback of the above discussion; (2) to put forward the intuitionistic fuzzy partitioned dual Maclaurin symmetric mean (IFPDMSM) operator and the weighted intuitionistic fuzzy partitioned dual Maclaurin symmetric mean (WIFPDMSM) operator; (3) to consider some properties, theorems and peculiar instances of the purposed operators; (4) to design a MADM methodology about the presented WIFPDMSM operator; and (5) to explain advantages of the established MADM approach.
The rest of the paper is described below. The Sect. 2 briefly gives notions of IFNs and DMSM. Besides, some properties of the DMSM are listed. In Sect. 3, we establish the PDMSM operator; we also give the features and particular case of the PDMSM operator. The Sect. 4 puts forward the IFPDMSM operator and the WIFPDMSM operator. The properties and peculiar instances of our introduced operators are too shown. The Sect. 5 designs a MADM methodology grounded on the put forward WIFPDMSM operator. Besides, giving an example and comparing the presented approach with other approaches to explain the presented MADM approach is more advantaged. The Sect. 6 is Conclusion and Future Studies.
2 Preliminaries
Firstly, we tersely reviewed some basal conceptions such as definitions, operational laws and ranking method of IFNs. Then, the Maclaurin symmetric mean and the dual Maclaurin symmetric mean are brushed up on in this section.
2.1 IFSs
Definition 1
[2] Suppose \(\tilde{Y}\) be a domain of discourse and \(y\in \tilde{Y}\). Then an intuitionistic fuzzy set \(\Gamma \) on \(\tilde{Y}\) is indicated:
where \(\rho _{\Gamma }\) and \(\tau _{\Gamma }\) represent the membership degree (MD) and non-membership degree (NMD) to \(\Gamma \), respectively, and \(0\leqslant \rho _{\Gamma }(y), \tau _{\Gamma }(y)\leqslant 1\), \(0\leqslant \rho _{\Gamma }(y)+\tau _{\Gamma }(y)\leqslant 1\).
The pair \((\rho _{\Gamma }(y),\tau _{\Gamma }(y))\) is termed as intuitionistic fuzzy number (IFN) [22]. An IFN can be signified as \(\theta =(\rho _{\theta },\tau _{\theta })\) for convenience, meeting \(0\leqslant \rho _{\theta },\tau _{\theta }\leqslant 1\) and \(0\leqslant \rho _{\theta }+\tau _{\theta }\leqslant 1\).
Definition 2
[22] Let \(\theta _{1}=(\rho _{1},\tau _{1})\) and \(\theta _{2}=(\rho _{2},\tau _{2})\) be two IFNs. The operational laws of IFNs are represented as follows:
-
(1)
\(\theta _{1} \oplus \theta _{2}=(1-(1-\rho _{1})(1-\rho _{2}),\tau _{1}\tau _{2})\),
-
(2)
\(\theta _{1} \otimes \theta _{2}=(\rho _{1}\rho _{2},1-(1-\tau _{1})(1-\tau _{2}))\),
-
(3)
\(\lambda \theta _{1}=(1-(1-\rho _{1})^\lambda ,\tau _{1}^\lambda )\), where \(\lambda \) is a real number and \(\lambda >0\),
-
(4)
\(\theta _{1}^\lambda =(\rho _{1}^\lambda ,1-(1-\tau _{1})^\lambda )\), where \(\lambda \) is a real number and \(\lambda >0\).
By Definition 2, some operational laws of IFNs can be obtained easily and listed as follows:
-
(1)
\(\theta _{1}\oplus \theta _{2}=\theta _{2}\oplus \theta _{1}\),
-
(2)
\(\theta _{1}\otimes \theta _{2}=\theta _{2}\otimes \theta _{1}\),
-
(3)
\(\lambda (\theta _{1}\oplus \theta _{2})=\lambda \theta _{1}\oplus \lambda \theta _{2}\), where \(\lambda \) is a real number and \(\lambda >0\),
-
(4)
\((\theta _{1}\otimes \theta _{2})^\lambda =\theta _{1}^\lambda \otimes \theta _{2}^\lambda \), where \(\lambda \) is a real number and \(\lambda >0\),
-
(5)
\(\lambda _{1}\theta _{1}\oplus \lambda _{2}\theta _{1}=(\lambda _{1}+\lambda _{2})\theta _{1}\), where \(\lambda _{1},\lambda _{2}\) are real numbers and \(\lambda _{1},\lambda _{2}>0\),
-
(6)
\(\theta _{1}^{\lambda _{1}}\otimes \theta _{1}^{\lambda _{2}}=\theta _{1}^{\lambda _{1}+\lambda _{2}}\), where \(\lambda _{1},\lambda _{2}\) are real numbers and \(\lambda _{1},\lambda _{2}>0\).
In order to rank two IFNs, the score function and accuracy function are introduced.
Definition 3
[45] If \(\theta =(\rho _{\theta },\tau _{\theta })\) be an IFN, then score function S of the IFN \(\theta \) is described:
where \(S(\theta ) \in [0,1]\).
Definition 4
[46] If \(\theta =(\rho _{\theta },\tau _{\theta })\) be an IFN, then accuracy function H of the IFN \(\theta \) is shown:
where \(H(\theta ) \in [0,1]\).
Definition 5
[3] Suppose \(\theta _{1}=(\rho _{1},\tau _{1})\) and \(\theta _{2}=(\rho _{2},\tau _{2})\) be two IFNs, then
-
(1)
if \(S(\theta _{1})>S(\theta _{2})\), then \(\theta _{1}>\theta _{2},\)
-
(2)
if \(S(\theta _{1})=S(\theta _{2})\), then if \(H(\theta _{1})>H(\theta _{2})\), then \(\theta _{1}>\theta _{2},\) if \(H(\theta _{1})=H(\theta _{2})\), then \(\theta _{1}=\theta _{2}.\)
2.2 The MSM Operator and DMSM Operator
Definition 6
[30] For given nonnegative real numbers \(z_{l}(l=1,2,\ldots ,f)\), and \(b=1,2,\ldots ,f\). The MSM operator is given by:
where \((l_{1},l_{2},\ldots ,l_{b})\) contains all the b-tuple combination of \((1,2,\ldots ,f)\) and \(C_f^b=\frac{f!}{b!(f-b)!}\).
Definition 7
[39] For given nonnegative real numbers \(z_{l}(l=1,2,\ldots ,f)\), and \(b=1,2,\ldots ,f\). The DMSM operator is described by:
where \((l_{1},l_{2},\ldots , l_{b})\) contains all the b-tuple combination of \((1,2,\ldots ,f)\) and \(C_f^b=\frac{f!}{b!(f-b)!}\).
The DMSM operator has the following properties [39]:
-
(1)
if \(z_{l}=z(l=1,2,\ldots ,f)\), then \(\mathrm{DMSM}^{(b)}(z_{1},z_{2},\ldots ,z_{f})=z,\)
-
(2)
if \(z_{l}\leqslant a_{l}(l=1,2,\ldots ,f)\), then
$$\begin{aligned} \mathrm{DMSM}^{(b)}(z_{1},z_{2},\ldots ,z_{f})\leqslant \mathrm{DMSM}^{(b)}(a_{1},a_{2},\ldots ,a_{f}), \end{aligned}$$ -
(3)
\(\mathop {\mathrm{min}}\nolimits _{l}\{z_{l}\}\leqslant \mathrm{DMSM}^{(b)}(z_{1},z_{2},\ldots ,z_{f})\leqslant \mathop {\mathrm{max}}\nolimits _{l}\{z_{l}\}.\)
3 The PDMSM Operator
The DMSM operator in the internal structure presents that input arguments are correlated to other input arguments. But in many real problems, input arguments may be partitioned into some parts and input argument be interrelated to other input arguments in the same part, interrelation does not exist between input arguments in different parts.
Let \(Z_{l}(l=1,2,\ldots ,f)\) be input arguments, and \(z_{l}(l=1,2,\ldots ,f)\) be values, where \(z_{l}\) is the evaluating value of argument \(Z_{l}\), \(z_{l}\geqslant 0\), \(1\leqslant l\leqslant f\). Suppose that the collection Z is divided into c different partitions \(P_{1},P_{2},\ldots ,P_{c}\), meeting \(P_{l} \bigcap P_{q}=\varnothing \), \(l,q\in \{1,2,\ldots ,c\},l\ne q\) and \(\bigcup _{t=1}^c{P_{t}}=Z\). We assume that the arguments are relevant in the identical partition and the arguments are irrelevant in diverse partitions.
In the following, we introduce the partitioned dual Maclaurin symmetric mean operator.
Definition 8
For given nonnegative real numbers \(z_{l}(l=1,2,\ldots ,f)\), c indicates the number of partitions, \(b=1,2,\ldots ,o_{t}\), \(o_{t}\) is the amount of attributes in \(P_{t}\). The PDMSM operator is defined:
where \((l_{1},l_{2},\ldots ,l_{b})\) contains all the b-tuple combination of \((1,2,\ldots ,o_{t})\) and \(C_{o_{t}}^b=\frac{o_{t}!}{b!(o_{t}-b)!}\).
Next, we will verify the characters of the introduced PDMSM operator.
Proposition 1
(Idempotency) Suppose \(z_{1}=z_{2}=\cdots =z_{f}=z\), then
Proof
By Definition 8 and \(z_{1}=z_{2}=\cdots =z_{f}=z,\) we know
which completes the proof. \(\square \)
Proposition 2
(Monotonicity) Let \(y_{l},z_{l}(l=1,2,\ldots ,f)\) be two groups of nonnegative real numbers and \(y_{l}\leqslant z_{l}\), \(l=1,2,\ldots ,f,\) then
when the parameter b is fixed.
Proof
By the definition of the PDMSM operator and \(y_{l}\leqslant z_{l}\) for all l, we get \(\sum \nolimits _{q=1}^b{y_{l_{q}}}\leqslant \sum \nolimits _{q=1}^b{z_{l_{q}}}\) and
Further, we obtain
which completes the proof. \(\square \)
Proposition 3
(Boundedness) Let \(z_{l}(l=1,2,\ldots ,f)\) be a collection of nonnegative real numbers, \(z^-=\mathop {\mathrm{min}}\nolimits _{l}\{z_{l}\}\) and \(z^+=\mathop {\mathrm{max}}\nolimits _{l}\{z_{l}\}\), then
Proof
Because \(z^-=\mathop {\mathrm{min}}\nolimits _{l}\{z_{l}\}\leqslant z_{l},\) and owing to the Propositions 1 and 2, we can have
In the same way, we can have
Therefore, \(z^-\leqslant \mathrm{PDMSM}^{(b)}(z_{1},z_{2},\ldots ,z_{f})\leqslant z^+.\) \(\square \)
Moreover, the effect of b towards the established PDMSM operator can be studied.
Theorem 1
For given nonnegative real numbers \(z_{l}(l=1,2,\ldots ,f)\), then PDMSM operator monotonically increases with respect to the parameter b.
Proof
By [39], we can have the DMSM operator inequality
Therefore, based on Eq. (6), we can obtain
where \(b=1,2,\ldots ,\mathop {\mathrm{min}}\nolimits _{t}\{o_{t}\}\). \(\square \)
Theorem 2
For given nonnegative real numbers \(z_{l}(l=1,2,\ldots ,f)\), then
and
when \(c=1\), the established PDMSM operator reduces to the DMSM operator [39], listed as:
4 The PDMSM Operator Based on the IFNs
In the following, we will extend the PDMSM operator to propound the partitioned dual Maclaurin symmetric mean operator for IFNs and the weighted partitioned dual Maclaurin symmetric mean operator for IFNs. The detailed description is shown as follows.
4.1 The IFPDMSM Operator
Definition 9
For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) partitioned into c distinct partitions \(P_{1},P_{2},\ldots ,P_{c}\), \(b=1,2,\ldots ,o_{t}\), \(o_{t}\) indicates the amount of attributes in \(P_{t}\). The IFPDMSM operator is described:
where \((l_{1},l_{2},\ldots ,l_{b})\) contains overall the b-tuple combination of \((1,2,\ldots ,o_{t})\) and \(C_{o_{t}}^b=\frac{o_{t}!}{b!(o_{t}-b)!}\).
Theorem 3
For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\). The aggregated result of formula (7) is still an IFN, described as follows:
Proof
By the operational laws of the IFNs, we can get
and
Then, we obtain
and
Therefore, we can get
Next,
and
Because \(0\leqslant \rho _{l_{q}}\leqslant 1\), \(0\leqslant \tau _{l_{q}}\leqslant 1\) and \(0\leqslant \rho _{l_{q}}+\tau _{l_{q}}\leqslant 1\), we can have \(0\leqslant \tau _{l_{q}}\leqslant 1-\rho _{l_{q}}\leqslant 1\). Thus,
Thus, we complete the proof. \(\square \)
Also, we can get the IFPDMSM operator has following desirable properties.
Proposition 4
(Idempotency) If \(\theta _{l}(l=1,2,\ldots ,f)\) are equal, i.e., \(\theta _{l}=(\rho _{l},\tau _{l})\) \(={\theta }=({\rho },{\tau })(l=1,2,\ldots ,f)\). Then,
Proof
On the ground of Eq. (8), we can have
\(\square \)
Proposition 5
(Commutativity) For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})\) and \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})\) \((l=1,2,\ldots ,f)\). Suppose \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})\) is any permutation of \(\theta _{l}=(\rho _{l},\tau _{l})\) for all l, then
Proof
According to Eq. (8), we can get
Because \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})\) is any permutation of \(\theta _{l}=(\rho _{l},\tau _{l})\) for all l, we have
\(\square \)
Proposition 6
(Monotonicity) Let \(\theta _{l}=(\rho _{l},\tau _{l})\) and \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})(l=1,2,\ldots , f) \) be arbitrary two collections of IFNs, satisfying \(\rho _{l}\geqslant \ddot{\rho }_{l}, \tau _{l}\leqslant \ddot{\tau }_{l}\) for all l, then
when the parameter b is fixed.
Proof
Suppose that \(\mathrm{IFPDMSM}^{(b)}(\theta _{1},\theta _{2},\ldots ,\theta _{f})\) \(=\theta =(\rho ,\tau )\) and \(\mathrm{IFPDMSM}^{(b)}(\ddot{\theta }_{1},\ddot{\theta }_{2},\ldots ,\ddot{\theta }_{f})=\ddot{\theta }=(\ddot{\rho },\ddot{\tau }),\) then
Because \(\rho _{l}\geqslant \ddot{\rho }_{l}, \tau _{l}\leqslant \ddot{\tau }_{l}\), then
That is \(\rho \geqslant \ddot{\rho }\) and \(\tau \leqslant \ddot{\tau }\), then \(\theta \geqslant \ddot{\theta }\). Therefore,
Proposition 7
(Boundedness) For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\), \(\theta ^-=\mathop {\mathrm{min}}\nolimits _{l}\{\theta _{l}\}\) and \(\theta ^+=\mathop {\mathrm{max}}\nolimits _{l}\{\theta _{l}\}\), \(l=1,2,\ldots ,f,\) then
Proof
Owing to \(\theta ^-=\mathop {\mathrm{min}}\nolimits _{l}\{\theta _{l}\}\leqslant \theta _{l},\) and Propositions 4 and 6, we have
and
Thus, we have \(\theta ^-\leqslant \mathrm{IFPDMSM}^{(b)}(\theta _{1},\theta _{2},\ldots ,\theta _{f})\leqslant \theta ^+.\)
Furthermore, we study the impact of b for the IFPDMSM operator and an example.
Lemma 1
[47] Suppose \(y_{l}>0,z_{l}>0(l=1,2,\ldots ,f)\) meeting \(\sum \nolimits _{l=1}^{f}z_{l}=1,\) then \(\prod \nolimits _{l=1}^{f}y_{l}^{z_{l}}\leqslant \sum \nolimits _{l=1}^{f}{y_{l}z_{l}}.\)
Theorem 4
Let \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) be a group of IFNs, and \(b=1,2,\ldots ,\mathop {\mathrm{min}}\nolimits _{t}\{o_{t}\}\). The IFPDMSM operator monotonically increases with respect to the parameter b.
Proof
Based on Theorem 3, we have
Assume that
Next, we prove function G(b) monotonically increases as b increases. Based on the dual Maclaurin inequality and Lemma 1, we have
Therefore,
In the following, we take the proof by contradiction methodology. Assume G(b) is monotonically decreasing as b increases, then \(G(\mathop {\mathrm{min}}\nolimits _{t}\{o_{t}\})<\cdots<G(2)<G(1)\) and we can have
In addition, we assume that \(o_{t}=o,\) then we can have
According to the assumption \(G(o)<G(1)\), we can get
Obviously, \(\left( \prod \nolimits _{l_{q}=1}^o{\left( 1-\rho _{l_{q}}\right) }\right) ^{\frac{1}{o}}>\frac{\sum \nolimits _{l_{q}=1}^{o}{\left( 1-\rho _{l_{q}}\right) }}{o}\) is contradiction to the Lemma 1. Thus, as the b increases, function G(b) is monotonically increasing. In the same way, we can prove function H(b) is monotonically decreasing as the b increases.
In accordance with the previous analysis, we can have
Therefore, the IFPDMSM operator monotonically increases with respect to the parameter b.
Theorem 5
Let \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) be a group of IFNs, and \(b=1,2,\ldots ,\mathop {\mathrm{min}}\nolimits _{t}\{o_{t}\}\) . Then
and
Example 1
Let \(\theta _{1}=(0.5, 0.3), \theta _{2}=(0.4, 0.4), \theta _{3}=(0.6, 0.2),\theta _{4}=(0.7, 0.2)\) and \(\theta _{5}=(0.3, 0.4)\) be five IFNs. Suppose these five IFNs are partitioned into two groups \(P_{1}=\{\theta _{1},\theta _{3},\theta _{5}\}\) and \(P_{2}=\{\theta _{2},\theta _{4}\}\). Here we use the IFPDMSM to aggregate these five IFNs. In general, we let \(b = 2\), then
Similarly,
Therefore, \(\mathrm{IFPDMSM}^{(2)}(\theta _{1},\theta _{2},\theta _{3},\theta _{4},\theta _{5})=(0.5265,0.2888).\)
4.2 The WIFPDMSM Operator
In Definition 9, the IFPDMSM operator does not view the importance of each input element. But, input elements always have diverse significance in practical DMPs, so we should consider that the weight of elements may be different. Following, We introduce the WIFPDMSM operator for IFNs which considers the importance of elements.
Definition 10
For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) partitioned into c distinct partitions \(P_{1},P_{2},\ldots ,P_{c}\) and the weight of IFN \(\theta _{l}(l=1,2,\ldots ,f)\) is \(\omega _{l}\), meeting \(\omega _{l}\in [0,1]\) and \(\sum \nolimits _{l=1}^f\omega _{l}=1\), \(b=1,2,\ldots ,o_{t}\), \(o_{t}\) signifies the number of attributes in \(P_{t}\). Then the WIFPDMSM operator of the \(\theta _{l}(l=1,2,\ldots ,f)\) is defined as:
where \((l_{1},l_{2},\ldots ,l_{b})\) contains all the b-tuple combination of \((1,2,\ldots ,o_{t})\) and \(C_{o_{t}}^b=\frac{o_{t}!}{b!(o_{t}-b)!}\).
Theorem 6
For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) , the weight of IFN \(\theta _{l}(l=1,2,\ldots ,f)\) is \(\omega _{l}\) , meeting \(\omega _{l}\in [0,1]\) and \(\sum \nolimits _{l=1}^f\omega _{l}=1\) . The aggregated result of formula(9) is too an IFN, listed:
Likewise, we can analyze the WIFPDMSM operator has some desirable properties.
Proposition 8
(Commutativity) For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})\) and \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})\) \((l=1,2,\ldots ,f)\). Suppose \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})\) is any permutation of \(\theta _{l}=(\rho _{l},\tau _{l})\) for all l, then
Proposition 9
(Monotonicity) For given IFNs \(\theta _{l}=(\rho _{l},\tau _{l})\) and \(\ddot{\theta }_{l}=(\ddot{\rho }_{l},\ddot{\tau }_{l})\) \((l=1,2,\ldots ,f)\), satisfying the condition \(\rho _{l}\geqslant \ddot{\rho }_{l}, \tau _{l}\leqslant \ddot{\tau }_{l}\), then
Furthermore, we discuss the effect of parameter b about the WIFPDMSM operator and particular case.
Theorem 7
Let \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) be a collection of IFNs, \(b=1,2,\ldots ,\mathop {\mathrm{min}}\nolimits _{t}\{o_{t}\}\). The WIFPDMSM operator monotonically increases with respect to the b.
Theorem 8
Let \(\theta _{l}=(\rho _{l},\tau _{l})(l=1,2,\ldots ,f)\) be a set of IFNs, \(b=1,2,\ldots ,\) \(\mathop {\mathrm{min}}\nolimits _{t}\{o_{t}\}\) . Then
and
when \(c=1\) , we can get
5 MADM Approach Based on
Following, we will apply an established MADM methodology to solve real decision-making problem. Suppose \(Y=\{Y_{1},Y_{2},\ldots ,Y_{n}\}\) be a group of alternatives, \(Z=\{Z_{1},Z_{2},\ldots ,Z_{f}\}\) be a set of attributes, let \(\omega =(\omega _{1},\omega _{2},\ldots ,\omega _{f})\) is weight vector of attributes and \(\sum \nolimits _{l=1}^f\omega _{l}=1\), \(0\leqslant \omega _{l}\leqslant 1(l=1,2,\ldots ,f)\). Decision maker can use the IFNs to evaluate the alternative \(Y_{l}\) with respect to attribute \(Z_{q}\) and represent it as \(\theta _{l_{q}}=(\rho _{l_{q}},\tau _{l_{q}})\), where \(\rho _{l_{q}},\tau _{l_{q}}\in [0,1]\) and \(0\leqslant \rho _{l_{q}}+\tau _{l_{q}}\leqslant 1\), we can get a decision matrix \(\Lambda =[\theta _{l_{q}}]_{n\times f}\), \(1\leqslant l\leqslant n,1\leqslant q\leqslant f\). Suppose that \(Z=\{Z_{1},Z_{2},\ldots ,Z_{f}\}\) is partitioned into c distinct groups \(P_{1},P_{2},\ldots ,P_{c}\), there has relationship between attributes of the identical group and does not have relationship between attributes of disparate groups. The steps of the propounded method are listed:
Step 1 In DMPs, attributes can be cut into two types, one is benefit attribute, and the other is cost attribute. In order to eliminate the effect of different attribute types, we can transform the decision matrix \(\Lambda =[\theta _{l_{q}}]_{n\times f}\) into the normalization matrix \(\ddot{\Lambda }=[\ddot{\theta }_{l_{q}}]_{n\times f}\), \(1\leqslant l\leqslant n,1\leqslant q\leqslant f\). We use the following formula to obtain the normalization matrix \(\ddot{\Lambda }=[\ddot{\theta }_{l_{q}}]_{n\times f}\)
where \(1\leqslant l\leqslant n,1\leqslant q\leqslant f\).
Step 2 Use the proposed WIFPDMSM operator to get
where \(\ddot{\theta }_{l}\) is the preference value of alternative \(Y_{l}\), where \(l=1,2,\ldots ,n\).
Step 3 Compute values \(S(\ddot{\theta }_{l})\) and \(H(\ddot{\theta }_{l})\) of the aggregated result \(\ddot{\theta }_{l}(l=1,2,\ldots ,n)\).
Step 4 According to the comparative way, making a comparing between the computed values \(S(\ddot{\theta }_{1}),S(\ddot{\theta }_{2}),\ldots ,S(\ddot{\theta }_{n})\) and accuracy values \(H(\ddot{\theta }_{1}),H(\ddot{\theta }_{2}),\) \(\ldots ,H(\ddot{\theta }_{n})\), then ranking all alternatives to choose the greatest one(s).
5.1 Problem Description
Example 2
In the north, there are often droughts in summer, which has some effect on the crops and causes the loss of many farmers. In order to cut the loss of farmers as soon as possible, the local government asked a company to build a dam. After the company goes through many surveys , there are four possible locations \(Y_{1},Y_{2},Y_{3}, Y_{4}\) and decision maker assesses the four possible locations from six attributes, i.e., the cost of location \((Z_{1})\), the size of location \((Z_{2})\), the surrounding environment \((Z_{3})\), the labor cost \((Z_{4})\), the material cost \((Z_{5})\) and the transportation condition \((Z_{6})\). Let the weights of attributes \(Z_{1},Z_{2},Z_{3},Z_{4}\),\(Z_{5}\) and \(Z_{6}\) be 0.2, 0.2, 0.2, 0.1, 0.1 and 0.2, respectively, the weight vector is \({(0.2,0.2,0.2,0.1,0.1,0.2)}^T\). Furthermore, suppose that the attributes \(Z_{1},Z_{2},Z_{3},Z_{4},Z_{5}\) and \(Z_{6}\) are cut into two groups \(P_{1}\) and \(P_{2}\), where \(P_{1}=\{Z_{1},Z_{4},Z_{5}\}\) and \(P_{2}=\{Z_{2},Z_{3},Z_{6}\}\). The decision maker evaluates the location \(Y_{l}(l=1,2,3,4)\) with respect to the attribute \(Z_{q}(q=1,2,3,4,5,6)\) by the IFNs. Therefore, the decision matrix \(\Lambda =[\theta _{l_{q}}]_{4\times 6}\) can be obtained, where \(\theta _{l_{q}}=(\rho _{l_{q}},\tau _{l_{q}})\), \(1\leqslant l\leqslant 4,1\leqslant q\leqslant 6\), which is shown as follows (Table 1).
5.2 Decision-Making Process About the Designed Method
Step 1Standardize the matrix \(\Lambda \). Because total attributes are beneficial, standardization does not need.
Step 2 Aggregate all performance value \(\ddot{\theta }_{l_{q}}(1\leqslant l\leqslant 4,1\leqslant q\leqslant 6)\). And founded on Eq. (11), we get the aggregated result \(\ddot{\theta }_{l}\) for each alternative \(Y_{l}(l = 1,2,3,4)\). (Without loss of generality, here we take \(b=2,c=2\))
Step 3 Compute value \(S(\ddot{\theta }_{l})\) and \(H(\ddot{\theta }_{l})\) of the overall preference value \(\ddot{\theta }_{l}(l=1,2,3,4)\), presented below:
Step 4 In accordance with the Step 3, the sorting result is \(Y_{4}\succ Y_{2}\succ Y_{1}\succ Y_{3}\). Therefore, the greatest alternative is \(Y_{4}\).
Furthermore, we can use the parameter b to describe the preference of decision maker in real situations. So, decision maker need to choose the suitable value based on preference. The decision maker is either optimistic or pessimistic when values of the parameter b are different [44]. We discuss the effect of the different value of the parameter b about the developed method. In Table 2 and Figs. 1 and 2, we can obtain the results by the propounded method.
From Table 2 and Figs. 1 and 2., we can get: with the parameter b changing based on the subjective preference of decision maker, the sorting results are slightly different, which denotes that the WIFPDMSM operator can reflect the preference of decision maker, but the optimal alternative is all \(Y_{4}\). And we can get score value increases based on the developed operator when the value of b increases and the value of c is fixed.
5.3 Validation Test
We examine the effectiveness of the developed approach through Wang and Triantaphylou introduced three test criterion, the specific content of three test criterion is in [48].
Firstly, to verify the effectiveness of the developed methodology by Test Criterion 1 [48]. The new decision matrix is got by decision maker through replacing alternative \(Y_{3}\) by a worse alternative \(Y_{3}^{'}\), shown in Table 3.
We use the established methodology to resolve the new decision-making problem. The outcome of each alternative is calculated as
So, the score value of each alternative is computed as
Founded on the above discussion, the sorting is \(Y_{4}\succ Y_{2}\succ Y_{1}\succ Y_{3}\), the optimal alternative is still alternative \(Y_{4}\) in the new decision-making problem, which is similar with the result obtained by the original problem. So the optimal alternative is not changed when the non-optimal alternative is replaced with another worse alternative.
Next, we examine the effectiveness of our presented methodology utilizing Test Criterion 2,3 [48]. Firstly, the initial decision issue decomposes as the three smaller problems \(\{Y_{1},Y_{2},Y_{4}\},\{Y_{1},Y_{3},Y_{4}\},\{Y_{2}, Y_{3}, Y_{4}\}.\) Then, we use the developed method in this paper to solve the three smaller problems, respectively, the corresponding sorting results are obtained as \(Y_{4}\succ Y_{2}\succ Y_{1},Y_{4}\succ Y_{1}\succ Y_{3},Y_{4}\succ Y_{2}\succ Y_{3}.\) Accordingly, the combination ranking is \(Y_{4}\succ Y_{2}\succ Y_{1}\succ Y_{3}\), which is identical with sorting of the initial decision issue and meets the transitivity property. Thus, the proposed approach satisfies the Test criterion 2 and Test criterion 3.
5.4 Comparison Analysis
In the following, in order to confirm the validity of the propounded methodology, we compare the presented methodology with other methods, such as Xu and Yager’s MADM approach [3] using the IFWG operator, Qin and Liu’s MADM methodology [19] utilizing the WIFMSM operator, Xia et al.’s MADM approach [25] using the WIFGBM operator, Shi and Xiao’s MADM method [40] utilizing the IFRWDMSM and the IFRWMSM operator based on Example 2, and the result of each method is shown in Table 4 and Fig. 3 (* denotes the method [40] grounded on the IFRWDMSM operator, ** denotes the method [40] based on the IFRWMSM operator). In Table 4 and Fig. 3., we can get that the decision outcomes through applying different approaches have subtle difference. But, the most satisfied option is all \(Y_{4}\). Furthermore, we analyze why the developed method outperforms other methods, listed as follows:
-
(1)
MADM methodology utilizes the WIFMSM operator propounded by Qin and Liu [19], MADM method utilizes the WIFGBM operator established by Xia et al. [25], MADM approach utilizes the IFRWDMSM and the IFRWMSM operator introduced by Shi and Xiao [40], but our developed method uses the propounded WIFPDMSM operator. From Table 4, we can see that the sortings of Qin and Liu’s MADM methodology [19], Xia et al.’s MADM method [25] and Shi and Xiao’s MADM approach [40] are same to the designed MADM method based on the WIFPDMSM operator, namely \(Y_{4}\succ Y_{2}\succ Y_{1}\succ Y_{3}\). The proposed method considers the interrelationship betwixt attributes in the identical group; there are other methods capture correlation between attributes except the Xia et al.’s MADM method [25] which captures the correlation for any two attributes. In Example 2, attributes \(Z_{1},Z_{4}\) and \(Z_{5}\) are related to each other and attributes \(Z_{2},Z_{3}\) and \(Z_{6}\) are so too, but there is no interrelationship between the groups \(\{Z_{1},Z_{4},Z_{5}\}\) and \(\{Z_{2},Z_{3},Z_{6}\}\). Obviously, our method based on the introduced WIFPDMSM operator effectively settles Example 2, which views the relationship betwixt any two members of the identical set, it averts the influence of irrelevant members. Qin and Liu’s MADM approach [19], Xia et al.’s MADM approach [25] and Shi and Xiao’s MADM approach [40] consider correlation between attributes, but these attributes are independent each other, for example among the attributes \(Z_{1}\) and \(Z_{2}\), among the attributes \(Z_{1}\) and \(Z_{3}\), among the attributes \(Z_{1}\) and \(Z_{6}\), among the attributes \(Z_{4}\) and \(Z_{2}\), among the attributes \(Z_{4}\) and \(Z_{3}\), among the attributes \(Z_{4}\) and \(Z_{6}\), among the attributes \(Z_{5}\) and \(Z_{2}\), among the attributes \(Z_{5}\) and \(Z_{3}\), among the attributes \(Z_{5}\) and \(Z_{6}\). Thus, the developed methodology grounded on the WIFPDMSM operator contrasting with Qin and Liu’s MADM methodology [19], Xia et al.’s MADM method [25] and Shi and Xiao’s MADM method [40] is more general.
-
(2)
The sorting of MADM approach [3] grounded on the IFWG operator introduced by Xu and Yager is slightly different from the sorting of the established method, because Xu and Yager’s MADM approach uses ordinary weighted geometric operator, which does not view relationship for the attributes. In Example 2, attributes \(Z_{1},Z_{4}\) and \(Z_{5}\) are relevant and attributes \(Z_{2},Z_{3}\) and \(Z_{6}\) are relevant. Therefore, the developed method successfully settles Example 2.
-
(3)
In real DMPs, some attributes may be independent each other. Thus, the developed method is more suitably used in practical MADM issues by contrasting with the methods [19, 25, 40]. And in real DMPs, relationship of attribute may be not ignored. Therefore, the designed method is more generally used in practical MADM issues by contrasting with the approach [3].
By previous analysis, the characteristics of the put forward methodology contrast with other methodologies, results are listed in Table 5 (* denotes the method [40] grounded on the IFRWDMSM operator, ** denotes the method [40] based on the IFRWMSM operator). From it, we can obtain: (1) Xu and Yager’s MADM approach [3] does not consider correlation between attributes, Xia et al.’s MADM approach [25] capture relationship between any two attributes, Qin and Liu’s MADM methodology [19], Shi and Xiao’s MADM approach [40] and the propounded method consider interrelationship for the attributes; (2) the developed MADM method partitions overall attributes into some parts and the attributes are interrelated in the same part, but the attributes are not interrelated in different parts, while Qin and Liu’s MADM methodology [19], Xia et al.’s MADM methodology [25] and Shi and Xiao’s MADM approach [40] don’t split attributes into several portions; (3) the proposed approach and Xia et al.’s MADM approach [25] consider the interrelation between attributes. Our proposed MADM method views interrelationship betwixt members of the identical parts, but Xia et al.’s MADM methodology [25] just finds relation betwixt any two members; (4) our introduced approach can surmount the disadvantage of Qin and Liu’s MADM methodology [19], Xia et al.’s MADM approach [25] and Shi and Xiao’s MADM approach [40], where the four approaches do not cut the attributes into some partitions, and Xu and Yager’s MADM approach [3] does not capture the interrelationship between attributes. In conclusion, the propounded methodology is more ordinary and appropriate than other methods [3, 19, 25, 40].
6 Conclusion and Future Studies
The DMSM operator considers that attributes are existing multiple relation. We easily find that the generalizations of the DMSM just only consider the case that attributes are relevant. But, in real DMPs, there may be not relationship between attributes So this paper has put forward the PDMSM operator. The purposed PDMSM operator has been expanded to the IFPDMSM and the WIFPDMSM operator for intuitionistic fuzzy environment. A few features and particular instances of the established operators have been analyzed. In accordance with the propounded WIFPDMSM operator, a new MADM approach has been designed for intuitionistic fuzzy environment. The established method breaks attributes into some portions, considering attributes of the identical portion are interrelated, while attributes of diverse portions are independent each other. We have applied an example to contrast our established MADM approach with the ones of [3, 19, 25, 40], comparative results show our introduced MADM methodology is more effective than Qin and Liu’s MADM methodology [19], Xia et al.’s MADM approach [25], Shi and Xiao’s MADM approach [40], and Xu and Yager’s MADM approach [3] in which does not capture the interrelationship between attributes to deal with MADM problems with intuitionistic fuzzy environment. In our future study, the presented operators will be utilized to fuzzy linguistic, which is admissive to utilize multiple linguistic fuzzy sets in fuzzy linguistic, it has been wide utilized in DMPs because which allows decision makers to use linguistic fuzzy set to voice their preferences. And the introduced operators can be used in proportional hesitant fuzzy 2-tuple linguistic term set [49] to deal with DMPs. The study is in intuitionistic fuzzy environment, spherical fuzzy sets, Pythagorean fuzzy sets and q-rung orthopair fuzzy sets are extension of IFS, and the introduced operator PDMSM can be used for spherical fuzzy sets [50, 51] which introduced operations of spherical fuzzy sets and Pythagorean fuzzy sets [52] which introduced operators and q-rung orthopair fuzzy sets [53, 54] which introduced a new type and ranking of q-rung orthopair fuzzy sets to solve DMPS. The established operator PDMSM can combine with TOPSIS method [55, 56] which established similarity and distance of Complex Interval-Valued q-Rung Orthopair Fuzzy Sets and consider the unknown weights of the attributes to solve DMPS. These are future works.
References
Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)
Atanassov, K.T.: Intuitionistic fuzzy sets. Fuzzy Sets Syst. 20, 87–96 (1986)
Xu, Z.S., Yager, R.R.: Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 35, 417–433 (2006)
Garg, H., Kumar, K.: Improved possibility degree method for ranking intuitionistic fuzzy numbers and their application in multiattribute decision making. Granul. Comput. 4, 237–247 (2019)
Joshi, R.: A new multi-criteria decision-making method based on intuitionistic fuzzy information and its application to fault detection in a machine. J. Ambient. Intell. Humaniz. Comput. 11, 739–753 (2020)
Liu, P.D., Wang, P.: Some improved linguistic intuitionistic fuzzy aggregation operators and their applications to multiple-attribute decision making. Int. J. Inf. Technol. Decis. Mak. 16, 817–850 (2017)
Peng, H.G., Wang, J.Q., Cheng, P.F.: A linguistic intuitionistic multi-criteria decision making method based on the Frank Heronian mean operator and its application in evaluating coal mine safety. Int. J. Mach. Learn. Cybern. 9, 1053–1068 (2017)
Qiyas, M., Abdullah, S., Liu, Y., Naeem, M.: Multi-criteria decision support systems based on linguistic intuitionistic cubic fuzzy aggregation operators. J. Ambient. Intell. Humaniz. Comput. 12, 8285–8303 (2021)
Liu, P.D., Chen, S.M.: Multiattribute group decision making based on intuitionistic 2-tuple linguistic information. Inf. Sci. 430, 599–619 (2018)
Chen, Z.C., Liu, P.H., Pei, Z.: An approach to multiple attribute group decision making based on linguistic intuitionistic fuzzy numbers. Int. J. Comput. Intell. Syst. 8, 747–760 (2015)
Teng, F., Liu, P.D.: Multiple-attribute group decision-making method based on the linguistic intuitionistic fuzzy density hybrid weighted averaging operator. Int. J. Fuzzy Syst. 21, 213–231 (2018)
Zhang, Y.J., Hu, S.H., Zhou, W.: Multiple attribute group decision making using J-divergence and evidential reasoning theory under intuitionistic fuzzy environment. Neural Comput. Appl. 32, 6311–6326 (2020)
Molodtsov, D.: Soft set theory-first results. Comput. Math. Appl. 37, 19–31 (1999)
Lee, K.M.: Bipolar valued fuzzy sets and their operations. In: Proceedings of International Conference on Intelligent Technologies, Bangkok, Thailand, pp. 307–312 (2000)
Mahmood, T.: A novel approach towards bipolar soft sets and their applications. J. Math. (2020). https://doi.org/10.1155/2020/4690808
Mahmood, T., Rehman, U.U., Ali, Z.: A novel complex fuzzy N-soft sets and their decision-making algorithm. Complex Intell. Syst. (2021). https://doi.org/10.1007/s40747-021-00373-2
Zhao, M.W., Wei, G.W., Wei, C., Guo, Y.F.: CPT-TODIM method for bipolar fuzzy multi-attribute group decision making and its application to network security service provider selection. Int. J. Intell. Syst. 36, 1943–1969 (2021)
Jana, C., Pal, M., Wang, J.Q.: Bipolar fuzzy Dombi aggregation operators and its application in multiple-attribute decision-making process. J. Ambient. Intell. Humaniz. Comput. 10, 3533–3549 (2019)
Qin, J.D., Liu, X.W.: An approach to intuitionistic fuzzy multiple attribute decision making based on Maclaurin symmetric mean operators. J. Intell. Fuzzy Syst. 27, 2177–2190 (2014)
Tao, Z.F., Han, B., Chen, H.Y.: On intuitionistic fuzzy copula aggregation operators in multiple-attribute decision making. Cogn. Comput. 10, 610–624 (2018)
Zhao, X.F., Wei, G.W.: Some intuitionistic fuzzy Einstein hybrid aggregation operators and their application to multiple attribute decision making. Knowl. Based Syst. 37, 472–479 (2013)
Xu, Z.S.: Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 15, 1179–1187 (2007)
Xu, Z.S., Yager, R.R.: Intuitionistic fuzzy Bonferroni means. IEEE Trans. Fuzzy Syst. Man Cybern. Part B (Cybern.) 41, 568–578 (2011)
Bonferroni, C.: Sulle medie multiple di potenze. Bolletino Matematica Italiana 5, 267–270 (1950)
Xia, M.M., Xu, Z.S., Zhu, B.: Geometric Bonferroni means with their application in multi-criteria decision making. Knowl. Based Syst. 40, 88–100 (2013)
Dutta, B., Labella, A., Rodrguez, R.M., Martnez, L.: Aggregating interrelated attributes in multi-attribute decision making with ELICIT information based on Bonferroni mean and its variants. Int. J. Comput. Intell. Syst. 12, 1179–1196 (2019)
Sykora, S. (ed.): Mathematical Means and Averages: Generalized Heronian Means. Stan’s Library. (2009). https://doi.org/10.3247/SL3Math09.002
Liu, P.D., Liu, J.L., Merigo, J.M.: Partitioned Heronian means based on linguistic intuitionistic fuzzy numbers for dealing with multi-attribute group decision making. Appl. Soft Comput. 62, 395–422 (2018)
Mo, J.M., Huang, H.L.: Archimedean geometric Heronian mean aggregation operators based on dual hesitant fuzzy set and their application to multiple attribute decision making. Soft Comput. 24, 14721–14733 (2020)
Maclaurin, C.: A second letter to Martin Folkes, Esq concerning the roots of equations, with demonstration of other rules of algebra. Philos. Trans. R. Soc. Lond. Ser. A 36, 59–96 (1729)
Detemple, D., Robertson, J.: On generalized symmetric means of two variables. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 634, 236–238 (1979)
Fahmi, A., Yaqoob, N., Chammam, W.: Maclaurin symmetric mean aggregation operators based on cubic Pythagorean linguistic fuzzy number. J. Ambient. Intell. Humaniz. Comput. 12(2), 1925–1942 (2021)
Liu, P.D., Li, Y., Zhang, M.C.: Some Maclaurin symmetric mean aggregation operators based on two-dimensional uncertain linguistic information and their application to decision making. Neural Comput. Appl. 31, 4305–4318 (2019)
Liu, P.D., You, X.L.: Linguistic neutrosophic partitioned Maclaurin symmetric mean operators based on clustering algorithm and their application to multi-criteria group decision-making. Artif. Intell. Rev. 53, 2131–2170 (2020)
Sahin, R., Kucuk, G.D.: A novel group decision-making method based on linguistic neutrosophic Maclaurin symmetric mean. Cogn. Comput. 12, 699–717 (2020)
Liu, P.D., Yang, H.Y.: Three-way decisions with intuitionistic uncertain linguistic decision-theoretic rough sets based on generalized Maclaurin symmetric mean operators. Int. J. Fuzzy Syst. 22, 653–667 (2020)
Wang, J., Wei, G.W., Wang, R., Alsaadi, F.E., Hayat, T., Wei, C., Zhang, Y., Wu, J.: Some q-rung interval-valued orthopair fuzzy Maclaurin symmetric mean operators and their applications to multiple attribute group decision making. Int. J. Intell. Syst. 34, 2769–2806 (2019)
Garg, H., Arora, R.: Maclaurin symmetric mean aggregation operators based on t-norm operations for the dual hesitant fuzzy soft set. J. Ambient. Intell. Humaniz. Comput. 11, 375–410 (2020)
Qin, J.D., Liu, X.W.: Approaches to uncertain linguistic multiple attribute decision making based on dual Maclaurin symmetric mean. J. Intell. Fuzzy Syst. 29, 171–186 (2015)
Shi, M.H., Xiao, Q.X.: Intuitionistic fuzzy reducible weighted Maclaurin symmetric means and their application in multiple attribute decision making. Soft Comput. 23, 10029–10043 (2019)
Darko, A.P., Liang, D.C.: An extended COPRAS method for multiattribute group decision making based on dual hesitant fuzzy Maclaurin symmetric mean. Int. J. Intell. Syst. 35, 1021–1068 (2020)
Wang, J., Wei, G.W., Gao, H.: Approaches to multiple attribute decision making with interval-valued 2-tuple linguistic Pythagorean fuzzy information. Mathematics 6, 201 (2018)
Dutta, B., Guha, D.: Partitioned Bonferroni mean based on linguistic 2-tuple for dealing with multi-attribute group decision making. Appl. Soft Comput. 37, 166–179 (2015)
Liu, P.D., Chen, S.M., Wang, Y.M.: Multiattribute group decision making based on intuitionistic fuzzy partitioned Maclaurin symmetric mean operators. Inf. Sci. 512, 830–854 (2019)
Chen, S.M., Tan, J.M.: Handling multicriteria fuzzy decision making problems based on vague set-theory. Fuzzy Sets Syst. 67, 163–172 (1994)
Hong, D.H., Choi, C.H.: Multicriteria fuzzy decision-making problems based on vague set theory. Fuzzy Sets Syst. 114, 103–113 (2000)
Pecaric, J., Wen, J., Wang, W.L., Lu, T.: A generalization of Maclaurin's inequalities and its applications. Math. Inequal. Appl. 8, 583–598 (2005)
Wang, X.T., Triantaphyllou, E.: Ranking irregularities when evaluating alternatives by using some Electre methods. Omega 36, 45–63 (2008)
Chen, Z.S., Yang, L.L., Rodrguez, M.R., Xiong, S.H., Chin, K.S., Martnez, L.: Power-average-operator-based hybrid multiattribute online product recommendation model for consumer decision-making. Int. J. Intell. Syst. 36, 2572–2617 (2021)
Mahmood, T., Ullah, K., Khan, Q., Jan, N.: An approach toward decision-making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 31, 7041–7053 (2019)
Ashraf, S., Abdullah, S.: Spherical aggregation operators and their application in multiattribute group decision-making. Int. J. Intell. Syst. 34, 493–523 (2019)
Garg, H.: A new generalized Pythagorean fuzzy information aggregation using Einstein operations and its application to decision making. Int. J. Intell. Syst. 31, 886–920 (2016)
Ali, M.I.: Another view on q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 33, 2139–2153 (2018)
Khan, M.J., Ali, M.I., Kumam, P.: A new ranking technique for q-rung orthopair fuzzy values. Int. J. Intell. Syst. 36, 558–592 (2021)
Garg, H., Ali, Z., Mahmood, T., Aljahdali, S.: Some similarity and distance measures between complex interval-valued q-rung orthopair fuzzy sets based on cosine function and their applications. Math. Probl. Eng. (2021). https://doi.org/10.1155/2021/5534915
Batool, B., Ahmad, M., Abdullah, S., Ashraf, S., Chinram, R.: Entropy based Pythagorean probabilistic hesitant fuzzy decision making technique and its application for fog-haze factor assessment problem. Entropy 22, 318 (2020)
Acknowledgements
This work was supported by Sichuan Province Youth Science and Technology Innovation Team under Grant 2019JDTD0015, Application Basic Research Plan Project of Sichuan Province under Grant 2021JY0108, Scientific Research Project of Neijiang Normal University under Grant 18TD08, Scientific Research Project of Neijiang Normal University under Grant 2019YB11.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There is no any conflicts of interest among all authors.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Wang, H., Liu, Y., Liu, F. et al. Multiple Attribute Decision-Making Method Based upon Intuitionistic Fuzzy Partitioned Dual Maclaurin Symmetric Mean Operators. Int J Comput Intell Syst 14, 154 (2021). https://doi.org/10.1007/s44196-021-00002-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s44196-021-00002-3