1 Introduction
In decision making, uncertainty is ubiquitous since objective things are uncertain and complex, and the managing and modelling of uncertain information are crucial for the acquisition of desirable solutions (Xu and Zhao,
2016). To date, a large number of tools have been proposed to model people’s imprecise decision information from different angles (Atanassov,
1986; Torra,
2010; Zhu
et al.,
2012; Zhou
et al.,
2013; Pang
et al.,
2016; Guan
et al.,
2017; Gou
et al.,
2017; Liao
et al.,
2017; Zhang,
2017; Zhao
et al.,
2018). Among them, to fully reflect the characteristics of affirmation and negation of human’s cognitive performance, Atanassov (
1986) introduced intuitionistic fuzzy sets (IFSs), which assign to each element a membership degree and a non-membership degree. In order to portray the human’s hesitancy in the decision-making process, Torra (
2010) introduced hesitant fuzzy sets (HFSs), which allocate to each element several different membership degrees. Afterwards, motivated by the ideas of IFSs and HFSs, Zhu
et al. (
2012) developed dual hesitant fuzzy sets (DHFSs) to manipulate the hesitation both for the membership degree and the non-membership degree by two functions from which two sets of membership and non-membership degrees can be respectively derived for each element. Obviously, DHFSs are able to express the human’s hesitancy in more detail and more comprehensively than IFSs and HFSs, and cover IFSs and HFSs as special cases. DHFSs are very suitable for group deciding making as they can well handle the situations where a decision organization consisting of several experts is not sure about a value, but hesitant among several possible values when it provides the membership degree or the non-membership degree of an element.
At present, the studies on theory and application of DHFSs have attracted great attention, and a lot of research results have been achieved (Farhadinia,
2014; Ju
et al.,
2014b; Li,
2014; Singh,
2014; Zhu and Xu,
2014; Zhang
et al.,
2016; Ren
et al.,
2017). Since the aggregation operators are very important for the application of DHFSs in decision making, many scholars have studied the aggregation operators of dual hesitant fuzzy information. Wang
et al. (
2014) and Yu
et al. (
2016) developed some fundamental dual hesitant fuzzy aggregation operators in terms of arithmetic and geometric operations. Afterwards, Yu (
2014) and Wang and Li (
2014) extended these aggregation operators (Wang
et al.,
2014), and presented a family of generalized dual hesitant fuzzy aggregation operators. Based on Hamacher
t-norm and
t-conorm, Einstein
t-conorm and
t-norm, Ju
et al. (
2014b) and Zhang
et al. (
2017a) developed a series of new dual hesitant fuzzy aggregation operators, respectively. For fusing the correlative dual hesitant fuzzy information, Ju
et al. (
2014a) developed some dual hesitant fuzzy Choquet aggregation operators; Wang
et al. (
2016) proposed a wide range of dual hesitant fuzzy power aggregation operators based on Archimedean
t-conorm and
t-norm; Zhang (
2015) proposed the dual hesitant fuzzy Hamacher correlated geometric operator. In addition, considering that there may exist some interactions between the membership functions and the non-membership functions of different DHFSs, Xu
et al. (
2015) presented a class of dual hesitant fuzzy interaction operators. Analysing the above-mentioned dual hesitant fuzzy aggregation operators, we can find that these operators are all defined under the assumption that all attributes are at the same priority level. However, in many practical multi-attribute decision making (MADM) problems, the attributes are in different priority levels. For instance, a consumer who is unfamiliar with cars is selecting a car from five candidate cars. Due to his/her ignorance of cars, he/she invites three friends who are proficient in cars to evaluate these cars by some indices among which safety level and comfort level are important. Generally, the safety attribute has a higher priority than comfort, which is to say, it is not allowed to compensate a loss in safety by a benefit in comfort. When evaluating the safety level of a car, one of his/her friends thinks that its satisfaction degree is 0.5, while the others believe that it should be 0.7, and they can’t persuade each other. Meanwhile, one of his/her friends deems the dissatisfaction degree of safety as 0.1, another views it as 0.2, and the other considers it as 0.3, and they all strongly insist on their own opinions. Then the above problem is a dual hesitant fuzzy MADM problem with prioritized attributes, and the evaluation for safety level of the car can be represented by the dual hesitant fuzzy element (DHFE)
$\{\{0.5,0.7\},\{0.1,0.2,0.3\}\}$.
The MADM problem with prioritized attributes is an interesting and hot research topic and has received great attention from scholars. For example, Yager (
2008;
2009) first investigated the MADM problems with prioritized attributes, and proposed the prioritized averaging (PA) operator and prioritized ordered weighted average (POWA) operator, in which the weight of an attribute with lower priority is dependent upon the satisfactions of the higher priority attributes. After that, Yu and Xu (
2013) generalized the PA operator (Yager,
2008) to the intuitionistic fuzzy environment and developed several prioritized intuitionistic fuzzy aggregation (PIFA) operators in light of some basic intuitionistic fuzzy operations. Based on the POWA operator (Yager,
2009), Xu
et al. (
2011) proposed the intuitionistic fuzzy POWA operator. Yu (
2012) formulated the generalized intuitionistic fuzzy prioritized weighted geometric operator based on Archimedean
t-conorm and
t-norm. Wei (
2012) extended the prioritized operators (Yager,
2008) to the hesitant fuzzy environment and developed some hesitant fuzzy prioritized operators. Yu
et al. (
2013) generalized Wei (
2012)’s prioritized operators and presented some generalized hesitant fuzzy prioritized operators. Zhou and Li (
2014) developed two generalized hesitant fuzzy prioritized Einstein operators with the help of Einstein operations. By means of the softmax function, Torres
et al. (
2014) developed the hesitant fuzzy prioritized softmax average and hesitant fuzzy prioritized softmax geometric operators. Recently, based on a correctional score function and a dice similarity measure of DHFEs, Ren and Wei (
2017) developed a method to solve the decision making problems in which there exists a prioritization relationship over attributes and the attribute values take the form of DHFEs.
It is worth pointing out that when we apply the PIFA operators (Yu and Xu,
2013) to solve the intuitionistic fuzzy MADM problems with prioritized attributes, the PIFA operators may not capture the prioritization relationship over attributes since there may exist compensation between attributes (for details, please refer to Section
5.1). Furthermore, in the process of generating weights for attributes (Yu and Xu,
2013; Xu
et al.,
2011; Yu,
2012; Wei,
2012; Yu
et al.,
2013; Zhou and Li,
2014; Torres
et al.,
2014; Ren and Wei,
2017), the concept of score function is used to transform the original decision information into single real numbers, which leads to distortion and loss of information, and further results in inaccurate decision results (for details, please refer to Section
5.1). Consequently, it is very necessary to develop new prioritized aggregation operators. Since both IFSs and HFSs are special cases of DHFSs, we just need to investigate the aggregation of dual hesitant fuzzy information in the MADM problems with prioritized attributes. Therefore, the main objective of this paper is to develop a family of prioritized dual hesitant fuzzy aggregation operators based on
t-norms and
t-conorms and explore their applications in the dual hesitant fuzzy MADM problems with prioritized attributes.
To do so, we organize the paper as follows: Section
2 reviews some basic knowledge that will be used in our work. In Section
3, we define dual hesitant fuzzy t-norm and
t-conorm and survey a special class of DHF
t-norms and
t-conorms. In Section
4, based on dual hesitant fuzzy
t-norms and
t-conorms, we first develop the prioritized dual hesitant fuzzy weighted triangular operator, which preserves both the monotonicity and boundary conditions, and from which a family of prioritized dual hesitant fuzzy aggregation operators can be derived. Then, based upon the developed prioritized dual hesitant fuzzy aggregation operators, we propose a method to handle the dual hesitant fuzzy MADM problems with prioritized attributes and demonstrate the feasibility and applicability through a car selection example. In Section
5, two comparisons are implemented to illustrate the validity and superiority of the developed prioritized aggregation operators and the proposed decision making method. Section
6 ends the paper with some conclusions.
2 Preliminaries
In this section, we review some preliminary knowledge that will be used thereinafter.
Definition 1 (See Batyrshin and Kaynak, 1999; Klement et al., 2000).
A t-norm T is a mapping from ${[0,1]^{2}}$ to $[0,1]$ possessing the properties of commutativity and associativity, which is increasing in both arguments and refers to 1 as identity, i.e. $T(1,a)=a$ for $a\in [0,1]$.
A
t-conorm
S from
${[0,1]^{2}}$ to
$[0,1]$ has the similar properties with the
t-norm
T. The only difference is that the
t-conorm
S regards 0 as identity, i.e.
$S(0,a)=a$ for
$a\in [0,1]$ (Alsina
et al.,
1983; Nguyen and Walker,
2005).
Some typical examples of
t-norms and
t-conorms are shown as follows (Kolesárová and Komorníková,
1999; Kolesárová
et al.,
2007)
$(\forall a,b\in [0,1])$:
-
(i) ${T_{M}}(a,b)=\min (a,b)=a\wedge b$; ${T_{P}}(a,b)=a\cdot b$; ${T_{L}}(a,b)=\max (a+b-1,0)$;
-
(ii) ${S_{M}}(a,b)=\max (a,b)=a\vee b$; ${S_{S}}(a,b)=a+b-ab$; ${S_{L}}(a,b)=\min (a+b,1)$.
It can be easily validated that for any t-norm T, it holds that $T(0,a)=0$ and $T(a,b)\leqslant {T_{M}}(a,b)$; for any t-conorm S, we have $S(1,a)=1$ and ${S_{M}}(a,b)\leqslant S(a,b)$, where $a,b\in [0,1]$.
Atanassov (
1986) first proposed the notion of intuitionistic fuzzy sets as follows:
Definition 2 (See Atanassov, 1986).
Let
X be a fixed set, then an intuitionistic fuzzy set (IFS)
I on
X is defined as:
where the functions
${u_{I}}:X\to [0,1]$ and
${v_{I}}:X\to [0,1]$ ascertain the membership degree and non-membership degree of the element
$x\in X$ to the set
I, respectively, with the condition:
${u_{I}}(x)+{v_{I}}(x)\leqslant 1$. For convenience, Xu (
2007) called
$\alpha =({u_{\alpha }},{v_{\alpha }})$ an intuitionistic fuzzy number (IFN).
Some operations on IFNs are presented as follows:
Definition 3 (See Xu, 2007).
Let
${\alpha _{i}}=({u_{{\alpha _{i}}}},{v_{{\alpha _{i}}}})$,
$i=1,2$ be two IFNs, then
-
(i) ${\alpha _{1}}\wedge {\alpha _{2}}=({u_{{\alpha _{1}}}}\wedge {u_{{\alpha _{2}}}},{v_{{\alpha _{1}}}}\vee {v_{{\alpha _{2}}}})$;
-
(ii) ${\alpha _{1}}\vee {\alpha _{2}}=({u_{{\alpha _{1}}}}\vee {u_{{\alpha _{2}}}},{v_{{\alpha _{1}}}}\wedge {v_{{\alpha _{2}}}})$;
-
(iii) ${\alpha _{1}}\oplus {\alpha _{2}}=({u_{{\alpha _{1}}}}+{u_{{\alpha _{2}}}}-{u_{{\alpha _{1}}}}{u_{{\alpha _{2}}}},{v_{{\alpha _{1}}}}{v_{{\alpha _{2}}}})$;
-
(iv) ${\alpha _{1}}\otimes {\alpha _{2}}=({u_{{\alpha _{1}}}}{u_{{\alpha _{2}}}},{v_{{\alpha _{1}}}}+{v_{{\alpha _{2}}}}-{v_{{\alpha _{1}}}}{v_{{\alpha _{2}}}})$.
However, there exist some cases in which the difficulty of determining the membership degree of an element is not because we have a margin of error (IFSs), but because we have several possible values. In order to cope with such cases, Torra (
2010) put forward the notion of hesitant fuzzy sets.
Definition 4 (See Torra, 2010).
Let X be a fixed set, then a hesitant fuzzy set (HFS) on X is in terms of a function which applied to X returns a subset of $[0,1]$.
To be easily understood, Xia and Xu (
2011) mathematically interpreted the HFS as:
where
${h_{E}}(x)$ is a set of several values in
$[0,1]$, representing the possible membership degrees of the element
$x\in X$ to the set
E. For convenience, Xia and Xu (
2011) called
$h={h_{E}}(x)$ a hesitant fuzzy element (HFE).
Assumption.
As pointed out in Bedregal
et al. (
2014), although the membership of an HFS could be any subset of
$[0,1]$, practical works always assume explicitly or implicitly that the membership of an HFS is a finite and non-empty subset. Bedregal
et al. (
2014) defined the HFSs whose memberships are finite and non-empty subsets of
$[0,1]$ as the typical HFSs, and the elements in the typical HFSs as the typical HFEs. From now on, the paper will only pay attention to the typical HFEs. For notational convenience, we still adopt the HFEs to denote the typical HFEs.
Meanwhile, Xia and Xu (
2011) developed the following method to compare HFEs.
Definition 5 (See Xia and Xu, 2011).
For an HFE h, $q(h)=(1/\mathrm{\# }h){\textstyle\sum _{{\gamma _{i}}\in h}}{\gamma _{i}}$ is defined as the score function of h, where $\mathrm{\# }h$ denotes the number of elements in h. Then for two HFEs ${h_{1}}$ and ${h_{2}}$, if $q({h_{1}})>q({h_{2}})$, then ${h_{1}}$ is superior to ${h_{2}}$, denoted by ${h_{1}}\succ {h_{2}}$; if $q({h_{1}})=q({h_{2}})$, then ${h_{1}}$ is indifferent to ${h_{2}}$, denoted by ${h_{1}}\sim {h_{2}}$.
Recently, inspired by the ideas of IFSs and HFSs, Zhu
et al. (
2012) introduced dual hesitant fuzzy sets, which allow the membership and non-membership degrees of an element to a given set to be several different values in
$[0,1]$, respectively.
Definition 6 (See Zhu et al., 2012).
Let
X be a fixed set, then a dual hesitant fuzzy set (DHFS)
A on
X is given in the following form:
where
${h_{A}}(x)$ and
${g_{A}}(x)$ are two sets of several values in
$[0,1]$, indicating the possible membership and non-membership degrees of the element
$x\in X$ to the set
A, respectively, with the condition:
${\max _{\gamma \in {h_{A}}(x)}}\{\gamma \}+{\max _{\eta \in {g_{A}}(x)}}\{\eta \}\leqslant 1$ for all
$x\in X$.
Zhu
et al. (
2012) called the component
$d(x)=({h_{A}}(x),{g_{A}}(x))$ a dual hesitant fuzzy element (DHFE), denoted by
$d=(h,g)$. Apparently, for the DHFE
$d=(h,g)$, if
$\mathrm{\# }h=\mathrm{\# }g=1$ (
$\mathrm{\# }h$ and
$\mathrm{\# }g$ denote the numbers of elements in
h and
g, respectively), then
d is simplified to an IFN; if
$h\ne \phi $ and
$g=\phi $ (
ϕ denotes the null set), then
d is simplified to an HFE. In addition, when
$h\ne \phi $ and
$g\ne \phi $, the complement of
d is given by
${d^{c}}=(g,h)$ (Zhu
et al.,
2012). Since DHFEs are the basic units of a DHFS, for the purpose of simplicity, we thereinafter will only focus on the DHFEs.
For convenience, we give the following two definitions:
Definition 7.
Let $d=(h,g)$ be a DHFE, then h and g are respectively called the membership degree set and non-membership degree set of d, and the numbers of elements in h and g are respectively denoted by $\mathrm{\# }h$ and $\mathrm{\# }g$.
Definition 8.
For any subset v of $[0,1]$, a permutation is defined by the mapping ${\sigma _{v}}:\{1,2,\dots ,\mathrm{\# }v\}\to v$ such that for any $t=1,2,\dots ,\mathrm{\# }v-1$, we have ${\sigma _{v}}(t)<{\sigma _{v}}(t+1)$, i.e. ${\sigma _{v}}(t)$ is the tth smallest element in v, where $\mathrm{\# }v$ denotes the number of elements in v.
Farhadinia (
2014) proposed a linear order to implement the comparison of two DHFEs under the assumption that the DHFEs have the same numbers of membership degrees and non-membership degrees, respectively.
Definition 9 (See Farhadinia, 2014).
Let
${d_{i}}=({h_{i}},{g_{i}})$,
$i=1,2$ be two DHFEs, then a linear order
${\preceq _{L}}$ is defined as:
where
${d_{i}^{+}}=\mathit{Score}({h_{i}})+\mathit{Score}({g_{i}})$ and
${d_{i}^{-}}=|\mathit{Score}({h_{i}})-\mathit{Score}({g_{i}})|$ for
$i=1,2$. Here, the score of a set
v as a subset of
$[0,1]$ is given by
Below we show the above comparison method through an example:
Example 1.
Let
${d_{1}}=\{\{0.1,0.2\},\{0.5,0.8\}\}$ and
${d_{2}}=\{\{0.1,0.4\},\{0.4,0.6\}\}$ be two DHFEs. Clearly,
${d_{1}}$ should be inferior to
${d_{2}}$ from intuition. By Eq. (
1), we get
$\mathit{Score}({h_{1}})=0.1667$,
$\mathit{Score}({g_{1}})=0.7$, and
$\mathit{Score}({h_{2}})=0.3$,
$\mathit{Score}({g_{2}})=0.5333$. Then we get
${d_{2}^{+}}=0.8333<0.8667={d_{1}^{+}}$, which indicates that
${d_{2}}{\preceq _{L}}{d_{1}}$. It is obvious that the comparative result is counterintuitive.
For comparing two DHFEs effectively, motivated by the comparison method for IFNs (Xu and Yager,
2006), we adjust the comparison principle in Definition
9 as:
Definition 10.
Let
${d_{i}}=({h_{i}},{g_{i}})$,
$i=1,2$ be two DHFEs,
${d_{i}^{\circ }}=\mathit{Score}({h_{i}})-\mathit{Score}({g_{i}})$ be the score function of
${d_{i}}$, and
${d_{i}^{\ast }}=\mathit{Score}({h_{i}})+\mathit{Score}({g_{i}})$ be the accuracy function of
${d_{i}}$, then we define
-
(i) if ${d_{1}^{\circ }}<{d_{2}^{\circ }}$, then ${d_{1}}$ is inferior to ${d_{2}}$, denoted by ${d_{1}}\prec {d_{2}}$;
-
(ii) if ${d_{1}^{\circ }}={d_{2}^{\circ }}$, then
-
(1) if ${d_{1}^{\ast }}={d_{2}^{\ast }}$, then ${d_{1}}$ is indifferent to ${d_{2}}$, denoted by ${d_{1}}\sim {d_{2}}$;
-
(2) if ${d_{1}^{\ast }}<{d_{2}^{\ast }}$, then ${d_{1}}$ is inferior to ${d_{2}}$, denoted by ${d_{1}}\prec {d_{2}}$.
For the DHFEs
${d_{1}}$ and
${d_{2}}$ in Example
1, we have
${d_{1}^{\circ }}=-0.5333<-0.2333={d_{2}^{\circ }}$. Thus,
${d_{1}}$ is inferior to
${d_{2}}$, which is in line with human’s intuition.
3 Dual Hesitant Fuzzy t-Norm and t-Conorm
The aim of this section is to define dual hesitant fuzzy t-norms and t-conorms and study a special class of dual hesitant fuzzy t-norms and t-conorms in detail, which are very helpful for the development of prioritized dual hesitant fuzzy aggregation operators.
From Definition
6, we know that for two different DHFEs, the numbers of membership degrees (or non-membership degrees) may be different. Hence, a normalization process should be considered. Inspired by the normalization method for HFEs (Xu and Xia,
2011), below we normalize them by adding membership degrees (or non-membership degrees):
Definition 11.
Assume that $d=(h,g)$ is a DHFE, then $\overline{h}=(1-\tau ){\sigma _{h}}(1)+\tau {\sigma _{h}}(\mathrm{\# }h)$ and $\overline{g}=\tau {\sigma _{g}}(1)+$$(1-\tau ){\sigma _{g}}(\mathrm{\# }g)$ are called the added membership and non-membership degrees, respectively, where τ $(0\leqslant \tau \leqslant 1)$ is a parameter provided by the decision maker according to his/her risk preference.
Thus, for two DHFEs with different numbers of membership degrees (or non-membership degrees), we may employ the parameter
τ to normalize them such that they have the same number of membership degrees (or non-membership degrees). For example, for two DHFEs
${d_{1}}=\{\{0.1,0.2\},\{0.4,0.5,0.6\}\}$ and
${d_{2}}=\{\{0.2,0.3,0.4,0.6\},\{0.3,0.4\}\}$, it is obvious that
$\mathrm{\# }{h_{1}}<\mathrm{\# }{h_{2}}$ and
$\mathrm{\# }{g_{2}}<\mathrm{\# }{g_{1}}$. In Definition
11, let
$\tau =1$, then in this case,
$\overline{{h_{1}}}=0\times {\sigma _{{h_{1}}}}(1)+1\times {\sigma _{{h_{1}}}}(\mathrm{\# }{h_{1}})=0.2$ and
$\overline{{g_{2}}}=1\times {\sigma _{{g_{2}}}}(1)+0\times {\sigma _{{g_{2}}}}(\mathrm{\# }{g_{2}})=0.3$. Thus, we can extend
${d_{1}}$ by adding 0.2 into its membership degree set
${h_{1}}$ and extend
${d_{2}}$ by adding 0.3 into its non-membership degree set
${g_{2}}$. As a result,
${d_{1}}$ becomes
$\{\{0.1,0.2,0.2,0.2\},\{0.4,0.5,0.6\}\}$ and
${d_{2}}$ becomes
$\{\{0.2,0.3,0.4,0.6\},\{0.3,0.3,0.4\}\}$. In general, the parameter
τ is determined by the decision maker used to reflect his/her risk attitude. Clearly, if
$\tau =1$, then the largest membership degree and the smallest non-membership degree are added, respectively, which means that the decision maker is optimistic. For other cases, for example,
$\tau =0$ indicates that the decision maker is pessimistic, and
$\tau =0.5$ indicates that the decision maker is indifferent. In this paper, we only consider the case in which the decision makers are optimists, and other cases can be studied in a similar way.
For facilitating the definitions of dual hesitant fuzzy t-norms and t-conorms, a partial order “${\leqslant _{D}}$” on the set of all DHFEs D is defined as follows:
Definition 12.
Let
${d_{i}}=({h_{i}},{g_{i}})$,
$i=1,2$ be two DHFEs with
$\mathrm{\# }{h_{1}}=\mathrm{\# }{h_{2}}=k$ and
$\mathrm{\# }{g_{1}}=\mathrm{\# }{g_{2}}=l$, then a partial order between
${d_{1}}$ and
${d_{2}}$ is defined as:
Note 1.
For two DHFEs with different numbers of membership degrees (or non-membership degrees), the partial order “
${\leqslant _{D}}$” is defined between their normalization forms (see Definition
11).
Example 2.
Consider two DHFEs
${d_{1}}=\{\{0.5,0.6,0.8\},\{0.1,0.2\}\}$ and
${d_{2}}=\{\{0.4,0.6\},\{0.2,0.3,0.4\}\}$. Through normalization,
${d_{1}}$ and
${d_{2}}$ become
${d_{1}}=\{\{0.5,0.6,0.8\},\{0.1,0.1,0.2\}\}$ and
${d_{2}}=\{\{0.4,0.6,0.6\}$,
$\{0.2,0.3,0.4\}\}$, respectively. Thus, by Definition
12, we get
${d_{2}}{\leqslant _{D}}{d_{1}}$.
For two DHFEs ${d_{i}}=({h_{i}},{g_{i}})$, $i=1,2$ with $\mathrm{\# }{h_{1}}=\mathrm{\# }{h_{2}}=k$ and $\mathrm{\# }{g_{1}}=\mathrm{\# }{g_{2}}=l$, we define the meet-operation as ${d_{1}}\wedge {d_{2}}=\{\{{\sigma _{{h_{1}}}}(t)\wedge {\sigma _{{h_{2}}}}(t)|t=1,2,\dots ,k\},\{{\sigma _{{g_{1}}}}(t)\vee {\sigma _{{g_{2}}}}(t)|t=1,2,\dots ,l\}\}$ and the joint-operation as ${d_{1}}\vee {d_{2}}=\{\{{\sigma _{{h_{1}}}}(t)\vee {\sigma _{{h_{2}}}}(t)|t=1,2,\dots ,k\},\{{\sigma _{{g_{1}}}}(t)\wedge {\sigma _{{g_{2}}}}(t)|t=1,2,\dots ,l\}\}$. Then for any DHFE d, it can be easily deduced that $d\wedge {0_{D}}={0_{D}}$ and $d\vee {1_{D}}={1_{D}}$, where ${0_{D}}=\{\{0\},\{1\}\}$ and ${1_{D}}=\{\{1\},\{0\}\}$. Therefore, the set D with the partial order “${\leqslant _{D}}$” is a bounded lattice, denoted as $(D,{\leqslant _{D}})$, whose smallest and largest elements are ${0_{D}}=\{\{0\},\{1\}\}$ and ${1_{D}}=\{\{1\},\{0\}\}$, respectively.
Now with the help of the bounded lattice $(D,{\leqslant _{D}})$, we can straightforwardly extend the definitions of t-norms and t-conorms to the dual hesitant fuzzy setting.
Definition 13.
A dual hesitant fuzzy
t-norm (DHF
t-norm) is a mapping
$DT:{D^{2}}\to D$ having the following properties:
-
(i) Commutativity: $DT({d_{1}},{d_{2}})=DT({d_{2}},{d_{1}})$;
-
(ii) Associativity: $DT({d_{1}},DT({d_{2}},{d_{3}}))=DT(DT({d_{1}},{d_{2}}),{d_{3}})$;
-
(iii) Monotonicity: if ${d_{1}}{\leqslant _{D}}{d_{3}}$ and ${d_{2}}{\leqslant _{D}}{d_{4}}$, then $DT({d_{1}},{d_{2}}){\leqslant _{D}}DT({d_{3}},{d_{4}})$;
-
(iv) ${1_{D}}$ as identity: $DT({1_{D}},{d_{1}})={d_{1}}$.
A dual hesitant fuzzy
t-conorm (DHF
t-conorm) is a mapping
$DS:{D^{2}}\to D$ possessing the following properties:
-
(i) Commutativity: $DS({d_{1}},{d_{2}})=DS({d_{2}},{d_{1}})$;
-
(ii) Associativity: $DS({d_{1}},DS({d_{2}},{d_{3}}))=DS(DS({d_{1}},{d_{2}}),{d_{3}})$;
-
(iii) Monotonicity: if ${d_{1}}{\leqslant _{D}}{d_{3}}$ and ${d_{2}}{\leqslant _{D}}{d_{4}}$, then $DS({d_{1}},{d_{2}}){\leqslant _{D}}DS({d_{3}},{d_{4}})$;
-
(iv) ${0_{D}}$ as identity: $DS({0_{D}},{d_{1}})={d_{1}}$,
where
${d_{1}},{d_{2}},{d_{3}},{d_{4}}\in D$.
The associativity property of DHF t-norms and t-conorms permits us to extend them to any number of dual hesitant fuzzy arguments, i.e. given n DHFEs ${d_{i}}$, $i=1,2,\dots ,n$, we have $DT({d_{1}},\dots ,{d_{n}})=DT(DT({d_{1}},\dots ,{d_{n-1}}),{d_{n}})$ and $DS({d_{1}},\dots ,{d_{n}})=DS(DS({d_{1}},\dots ,{d_{n-1}}),{d_{n}})$. Besides, we get the notable properties: $DT({d_{1}},\dots ,{d_{n}},{d_{n+1}}){\leqslant _{D}}DT({d_{1}},\dots ,{d_{n}})$ and $DS({d_{1}},\dots ,{d_{n}}){\leqslant _{D}}DS({d_{1}},\dots ,{d_{n}},{d_{n+1}})$ for $n\geqslant 2$.
Let ${d_{i}}=({h_{i}},{g_{i}})$, $i=1,2$ be two DHFEs with $\mathrm{\# }{h_{1}}=\mathrm{\# }{h_{2}}=k$ and $\mathrm{\# }{g_{1}}=\mathrm{\# }{g_{2}}=l$, then some typical examples of DHF t-norms are listed as follows:
1) Dual hesitant fuzzy minimum (DHFM)
t-norm:
2) Dual hesitant fuzzy product (DHFP)
t-norm:
3) Dual hesitant fuzzy Lukasiewicz (DHFL)
t-norm:
Three typical examples of DHF
t-conorms are presented as follows:
1) Dual hesitant fuzzy maximum (DHFM)
t-conorm:
2) Dual hesitant fuzzy probabilistic sum (DHFPS)
t-conorm:
3) Dual hesitant fuzzy Lukasiewicz (DHFL)
t-conorm:
Note 2.
The above-mentioned dual hesitant fuzzy
t-norms and
t-conorms are all defined on two DHFEs with the same number of membership degrees and the same number of non-membership degrees. For two DHFEs with different numbers of membership degrees (or non-membership degrees), we may define dual hesitant fuzzy
t-norms and
t-conorms on their normalization forms (see Definition
11).
To date, we have introduced the definitions of DHF
t-norms and
t-conorms, which are consistent with those of traditional
t-norms and
t-conorms (similar work can be found in Deschrijver
et al.,
2004; Dimuro
et al.,
2011). In what follows, we research a special class of DHF
t-norms and
t-conorms, which are constructed by traditional
t-norms and
t-conorms and will play a crucial role in the development of prioritized dual hesitant fuzzy aggregation operators.
Theorem 1.
Let $T,S:{[0,1]^{2}}\to [0,1]$ be a t-norm and a t-conorm, respectively, such that $T(x,y)+S(1-x,1-y)\leqslant 1$ for $x,y\in [0,1]$. Then the mapping $DT$ defined by
is a DHF t-norm, and the mapping $DS$ defined by
is a DHF t-conorm, where ${d_{i}}=({h_{i}},{g_{i}})\in D$, $i=1,2$ with $\mathrm{\# }{h_{1}}=\mathrm{\# }{h_{2}}=k$ and $\mathrm{\# }{g_{1}}=\mathrm{\# }{g_{2}}=l$.
Theorem
1 can be easily proven by the definitions of
t-norms and
t-conorms. Obviously, the DHF
t-norms and
t-conorms respectively presented by Eqs. (
2)–(
4) and Eqs. (
5)–(
6) can be formed through Theorem
1.
Property 1.
Let $D{T_{T,\hspace{0.2778em}S}}$ and $D{S_{S,T}}$ be a DHF t-norm and t-conorm constructed through Theorem 1, respectively, then for any two DHFEs ${d_{i}}$, $i=1,2$, we have
-
(i) $D{T_{T,S}}({0_{D}},{d_{1}})={0_{D}}$ and $D{S_{S,\hspace{0.2778em}T}}({1_{D}},{d_{1}})={1_{D}}$;
-
(ii) if for $i=1,2$, ${d_{i}}=({h_{i}},{g_{i}})$ with ${h_{i}}\ne \phi $ and ${g_{i}}\ne \phi $, then ${(D{T_{T,\hspace{0.2778em}S}}({d_{1}},{d_{2}}))^{c}}=D{S_{S,T}}({d_{1}^{c}},{d_{2}^{c}})$ and ${(D{S_{S,T}}({d_{1}},{d_{2}}))^{c}}=D{T_{T,S}}({d_{1}^{c}},{d_{2}^{c}})$;
-
(iii) $D{T_{T,S}}({d_{1}},{d_{2}}){\leqslant _{D}}D{T_{{T_{M}},{S_{M}}}}({d_{1}},{d_{2}})$ and $D{S_{{S_{M}},{T_{M}}}}({d_{1}},{d_{2}}){\leqslant _{D}}D{S_{S,T}}({d_{1}},{d_{2}})$, i.e. $D{T_{{T_{M}},{S_{M}}}}$ is the largest DHF t-norm among all $D{T_{T,S}}$, and $D{S_{{S_{M}},{T_{M}}}}$ is the smallest DHF t-conorm among all $D{S_{S,T}}$.
Proof.
(1) Since for any
t-norm
T and
t-conorm
S, it holds that
$T(0,a)=0$ and
$S(1,a)=1$ for
$a\in [0,1]$. Then
and
(2) $\begin{array}[t]{r@{\hskip4.0pt}c@{\hskip4.0pt}l}{(D{T_{T,S}}({d_{1}},{d_{2}}))^{c}}& =& \big(\big\{\big\{T({\sigma _{{h_{1}}}}(t),{\sigma _{{h_{2}}}}(t))\big|t=1,2,\dots ,k\big\},\\ {} & & {\big\{S({\sigma _{{g_{1}}}}(t),{\sigma _{{g_{2}}}}(t))\big|t=1,2,\dots ,l\}\big\}\big)^{c}}\\ {} & =& \big\{\big\{S({\sigma _{{g_{1}}}}(t),{\sigma _{{g_{2}}}}(t))\big|t=1,2,\dots ,l\big\},\\ {} & & \big\{T({\sigma _{{h_{1}}}}(t),{\sigma _{{h_{2}}}}(t))\big|t=1,2,\dots ,k\big\}\big\}=D{S_{S,\hspace{0.2778em}T}}\big({d_{1}^{c}},{d_{2}^{c}}\big).\end{array}$
Similarly, it can be proven that ${(D{S_{S,\hspace{0.2778em}T}}({d_{1}},{d_{2}}))^{c}}=D{T_{T,\hspace{0.2778em}S}}({d_{1}^{c}},{d_{2}^{c}})$.
(3) Since for any t-norm T and t-conorm S, it holds that $T(a,b)\leqslant {T_{M}}(a,b)$ and ${S_{M}}(a,b)\leqslant S(a,b)$ for $a,b\in [0,1]$. Then, $T({\sigma _{{h_{1}}}}(t),{\sigma _{{h_{2}}}}(t))\leqslant {\sigma _{{h_{1}}}}(t)\wedge {\sigma _{{h_{2}}}}(t)$ for $t=1,2,\dots ,k$, and $S({\sigma _{{g_{1}}}}(t),{\sigma _{{g_{2}}}}(t))\geqslant {\sigma _{{g_{1}}}}(t)\vee {\sigma _{{g_{2}}}}(t)$ for $t=1,2,\dots ,l$. Therefore, $D{T_{T,\hspace{0.2778em}S}}({d_{1}},{d_{2}}){\leqslant _{D}}D{T_{{T_{M}},\hspace{0.2778em}{S_{M}}}}({d_{1}},{d_{2}})$. In a similar way, we prove $D{S_{{S_{M}},\hspace{0.2778em}{T_{M}}}}({d_{1}},{d_{2}}){\leqslant _{D}}D{S_{S,\hspace{0.2778em}T}}({d_{1}},{d_{2}})$. □
4 Prioritized Dual Hesitant Fuzzy Multi-Attribute Decision Making
In this section, we focus on the resolution of dual hesitant fuzzy MADM problems in which there exists a prioritization relationship over attributes. We first describe this kind of problems as follows: suppose that there are several attributes ${c_{j}}$ $(j=1,2,\dots ,m)$ according to which a decision organization containing several experts assesses several feasible alternatives ${x_{i}}$ $(i=1,2,\dots ,n)$ by using the DHFEs ${d_{j}}({x_{i}})$. Assume that there exists the prioritization relationship over the attributes: ${c_{1}}\succ {c_{2}}\succ \cdots \succ {c_{m}}$, i.e. the attribute ${c_{r}}$ has a higher priority than the attribute ${c_{j}}$ if $r<j$. The goal of the decision maker is to get the ranking of all feasible alternatives.
A simple method to solve the aforesaid dual hesitant fuzzy MADM problems with prioritized attributes is to conduct an aggregation for the dual hesitant fuzzy evaluation values of each alternative under all attributes to obtain a collective value, and then to compare the collective values of all alternatives to obtain a ranking of alternatives. However, from the introduction, we note that no studies have been done on the aggregation of dual hesitant fuzzy information in the MADM problems with prioritized attributes. Therefore, below we attempt to develop prioritized dual hesitant fuzzy aggregation operators based on the DHF t-norms and t-conorms defined in the former section.
4.1 The Prioritized Dual Hesitant Fuzzy Weighted Triangular Operator
In this subsection, we pay attention to the aggregation of dual hesitant fuzzy information in the MADM problems where there exists a prioritization relationship over attributes. Before that, we first introduce the following definition:
Definition 14.
A dual hesitant fuzzy aggregation function (DHFAF) of dimension
n is a mapping
$DF:{D^{n}}\to D$ with the following conditions:
-
(i) $DF({0_{D}},{0_{D}},\dots ,{0_{D}})={0_{D}}$ and $DF({1_{D}},{1_{D}},\dots ,{1_{D}})={1_{D}}$;
-
(ii) $DF({d_{1}},{d_{2}},\dots ,{d_{n}}){\leqslant _{D}}DF({d_{1}^{{^{\prime }}}},{d_{2}^{{^{\prime }}}},\dots ,{d_{n}^{{^{\prime }}}})$ for ${d_{i}}{\leqslant _{D}}{d_{i}^{{^{\prime }}}}$, $i=1,2,\dots ,n$.
The conditions (i) and (ii) can be interpreted as follows: the condition (i) indicates that when the aggregated dual hesitant fuzzy arguments are all the smallest element ${0_{D}}$ of the lattice $(D,{\leqslant _{D}})$, their aggregation result should be ${0_{D}}$; analogously, when the aggregated dual hesitant fuzzy arguments are all the largest element ${1_{D}}$ of the lattice $(D,{\leqslant _{D}})$, the obtained aggregation result should be ${1_{D}}$; the condition (ii) says that the aggregation result should not decrease with the individual dual hesitant fuzzy argument increasing regarding the partial order ${\leqslant _{D}}$, that is, an aggregation function on D should be non-decreasing in relation to the aggregated dual hesitant fuzzy arguments.
It can be easily seen that DHF
t-norms and
t-conorms depicted in Theorem
1 are binary DHFAFs. In the following, we develop another DHFAF for aggregating the dual hesitant fuzzy information in the MADM problems with prioritized attributes. The key to developing such a function is to determine the weights of attributes, by which the prioritization relationship over attributes can be reflected. For the alternative
${x_{i}}$ $(i=1,2,\dots ,n)$, based on the DHF
t-norm
$D{T_{T,S}}$ (constructed through Theorem
1), we define the priority weight of the attribute
${c_{j}}$ as:
where
${d_{0}}({x_{i}})={1_{D}}$. Then, based on the DHF
t-norm
$D{T_{{T_{1}},{S_{1}}}}$ and DHF
t-conorm
$D{S_{{S_{2}},{T_{2}}}}$(constructed through Theorem
1), we define the prioritized dual hesitant fuzzy weighted triangular (PDHFWT) operator as:
From Eqs. (
10) and (
11), we can easily observe that: (i) the weights
${w_{j}}({x_{i}})$ (
$i=1,2,\dots ,n$,
$j=1,2,\dots ,m$) are all DHFEs; (ii) for
$i=1,2,\dots ,n$, the weights
${w_{j}}({x_{i}})$ are non-increasing in
j, i.e.,
${w_{j}}({x_{i}}){\leqslant _{D}}{w_{r}}({x_{i}})$ if
$r<j$; (iii) for
$i=1,2,\dots ,n$, if
${d_{1}}({x_{i}})={0_{D}}$, then
${w_{1}}({x_{i}})={1_{D}}$ and
${w_{j}}({x_{i}})={0_{D}}$ for
$j>1$, and in this case,
$F({x_{i}})={0_{D}}$, that is, for any alternative
${x_{i}}$,
${0_{D}}$ satisfaction to the first prioritized attribute
${c_{1}}$ always results in the overall aggregation result
$F({x_{i}})={0_{D}}$; furthermore, if
${d_{j}}({x_{i}})={0_{D}}$, then
${w_{r}}({x_{i}})={0_{D}}$ for
$r>j$, and
$F({x_{i}})=D{S_{{S_{2}},{T_{2}}}}(D{T_{{T_{1}},{S_{1}}}}({w_{1}}({x_{i}}),{d_{1}}({x_{i}})),\dots ,D{T_{{T_{1}},{S_{1}}}}({w_{j-1}}({x_{i}}),{d_{j-1}}({x_{i}})))$, which illustrates that
${0_{D}}$ satisfaction to some attribute
${c_{j}}$ leads to no contributions made by the attributes with lower priority than
${c_{j}}$ to the overall aggregation result, that is, the lack of satisfaction to the higher prioritized attributes cannot be compensated by satisfaction to the lower prioritized attributes (i.e., the PDHFWT operator has the property of non-compensation); (iv) for different alternatives
${x_{i}}$ and
${x_{k}}(k\ne i)$, the weights
${w_{j}}({x_{i}})$ and
${w_{j}}({x_{k}})$ are usually different, that is, the yielded weights rely on the alternatives
${x_{i}}$ $(i=1,2,\dots ,n)$.
All the above say that the developed PDHFWT operator can well capture the prioritization relationship over attributes. Furthermore, we get:
Theorem 2.
The PDHFWT operator is a DHFAF.
Theorem
2 is straightforward.
In Eqs. (
10) and (
11), when different DHF
t-norms and
t-conorms are employed, different forms of prioritized dual hesitant fuzzy aggregation operators can be obtained. A specific one is shown as follows: assume that for the alternatives
${x_{i}}$ $(i=1,2,\dots ,n)$,
${d_{j}}({x_{i}})=({h_{ij}},{g_{ij}})$ with
$\mathrm{\# }{h_{ij}}={k_{i}}$ and
$\mathrm{\# }{g_{ij}}={l_{i}}$ for
$j=1,2,\dots ,m$. Let
$D{T_{T,S}}=D{T_{{T_{1}},{S_{1}}}}=D{T_{{T_{P}},{S_{S}}}}$, shown as Eq. (
3), and
$D{S_{{S_{2}},{T_{2}}}}=D{S_{{S_{S}},{T_{P}}}}$, shown as Eq. (
6). Then by Eq. (
10), we obtain
for
$j=2,3,\dots ,m$. Moreover, by Eq. (
11), we acquire
We illustrate the developed PDHFWT operator by the following example:
Example 3.
Consider the prioritized attributes
${c_{1}}\succ {c_{2}}\succ {c_{3}}$, and assume that for the alternative
x the evaluation values under the attributes
${c_{j}}$ $(j=1,2,3)$ provided by a decision organization are DHFEs:
Firstly, by Eq. (
12), the priority weights
${w_{j}}(x)$ of the attributes
${c_{j}}$ $(j=1,2,3)$ can be calculated:
Evidently,
${w_{3}}(x){\leqslant _{D}}{w_{2}}(x){\leqslant _{D}}{w_{1}}(x)$, which accords with the prioritization relationship over the three attributes.
Then, by Eq. (
13), we obtain the overall attribute value of the alternative
x, shown as:
Since the DHFS is a generalization of the IFS and the HFS, below we apply the developed PDHFWT operator shown in Eqs. (
12) and (
13) to the intuitionistic fuzzy and hesitant fuzzy environments.
In the intuitionistic fuzzy context, by Eq. (
12), the priority weight of the attribute
${c_{j}}$ regarding the alternative
${x_{i}}$ is given as:
where
${w_{1}}({x_{i}})=(1,0)$, and
${\alpha _{j}}({x_{i}})=({u_{ij}},{v_{ij}})$ is an IFN representing the attribute value of the alternative
${x_{i}}$ under the attribute
${c_{j}}$. Then, by Eq. (
13), we get the following prioritized intuitionistic fuzzy weighted triangular (PIFWT) operator:
In the hesitant fuzzy context, by Eq. (
12), the priority weight of the attribute
${c_{j}}$ with respect to the alternative
${x_{i}}$ is given as:
where
${w_{1}}({x_{i}})=\{1\}$,
${h_{j}}({x_{i}})=\{{\sigma _{{h_{ij}}}}(t)|t=1,2,\dots ,{k_{i}}\}$ is a HFE representing the possible attribute values of the alternative
${x_{i}}$ under the attribute
${c_{j}}$. Then, by Eq. (
13), we obtain the following prioritized hesitant fuzzy weighted triangular (PHFWT) operator:
4.2 A Method to Solve Dual Hesitant Fuzzy MADM Problems with Prioritized Attributes
In the previous section, we have developed the PDHFWT operator by using the DHF
t-norms and
t-conorms, which manages to capture the prioritization relationship over attributes, and proved that it is essentially a DHFAF, which indicates that the PDHFWT operator can be applied to aggregate the dual hesitant fuzzy information in MADM problems. Based on the PDHFWT operator, we here provide a method to handle the dual hesitant fuzzy MADM problems with prioritized attributes, whose procedures are presented as follows:
-
Step 1. For the alternatives
${x_{i}}$ $(i=1,2,\dots ,n)$, we calculate the priority weights
${w_{j}}({x_{i}})$ $(i=1,2,\dots ,n,$ $j=1,2,\dots ,m)$ of the attributes
${c_{j}}$ $(j=1,2,\dots ,m)$ by Eq. (
12).
-
Step 2. By Eq. (
13), we calculate the overall attribute values
$F({x_{i}})$ $(i=1,2,\dots ,n)$ of alternatives
${x_{i}}$ $(i=1,2,\dots ,n)$.
-
Step 3. Rank
$F({x_{i}})$,
$i=1,2,\dots ,n$, according to Definition
10, and then the corresponding ranking orders of alternatives
${x_{i}}$ $(i=1,2,\dots ,n)$ can be obtained.
Example 4 (See Yu and Xu, 2013).
Assume that a consumer wants to buy a new car from five cars
${x_{1}},{x_{2}},\dots ,{x_{5}}$. Since he/she has poor understanding about cars, he/she invites three friends who are proficient in cars to assess these cars by considering six attributes: 1) safety level
${c_{1}}$; 2) price
${c_{2}}$; 3) fuel consumption
${c_{3}}$; 4) comfort level
${c_{4}}$; 5) maximum gas mileage
${c_{5}}$; 6) fashion
${c_{6}}$. In the consumer’s opinion, there exists the prioritization relationship among these attributes:
${c_{1}}\succ {c_{2}}\succ {c_{3}}\succ {c_{4}}\succ {c_{5}}\succ {c_{6}}$. Suppose that the assessment values
${d_{j}}({x_{i}})$ of cars
${x_{i}}$ $(i=1,2,\dots ,5)$ with regard to the attributes
${c_{j}}$ $(j=1,2,\dots ,6)$ provided by the three friends can be represented by DHFEs, see Table
1.
Table 1
Dual hesitant fuzzy attribute values.
|
${c_{1}}$ |
${c_{2}}$ |
${c_{3}}$ |
${c_{4}}$ |
${c_{5}}$ |
${c_{6}}$ |
${x_{1}}$ |
$\{\{0.5,0.7\},\{0.1,0.2,0.3\}\}$ |
$\{\{0.3,0.5,0.6\},\{0.2,0.4\}\}$ |
$\{\{0.1,0.2\},\{0.5,0.6\}\}$ |
$\{\{0.8,0.9\},\{0.1\}\}$ |
$\{\{0.6,0.8\},\{0.1,0.2\}\}$ |
$\{\{0.1,0.3\},\{0.5,0.7\}\}$ |
${x_{2}}$ |
$\{\{0.4\},\{0.2,0.3\}\}$ |
$\{\{0.6,0.7\},\{0.1\}\}$ |
$\{\{0.6,0.7,0.8\},\{0.1,0.2\}\}$ |
$\{\{0.5,0.7\},\{0.1\}\}$ |
$\{\{0.5,0.6,0.7\},\{0.1,0.2\}\}$ |
$\{\{0.2\},\{0.6,0.7\}\}$ |
${x_{3}}$ |
$\{\{0.3,0.4\},\{0.1,0.2\}\}$ |
$\{\{0.6,0.8\},\{0.1\}\}$ |
$\{\{0.4,0.6\},\{0.4\}\}$ |
$\{\{0.6,0.7\},\{0.2,0.3\}\}$ |
$\{\{0.8,0.9\},\{0.1\}\}$ |
$\{\{0.4,0.6\},\{0.3,0.4\}\}$ |
${x_{4}}$ |
$\{\{0.6,0.7\},\{0.1,0.2\}\}$ |
$\{\{0.6,0.8\},\{0.1\}\}$ |
$\{\{0.2,0.3\},\{0.4,0.6\}\}$ |
$\{\{0.7,0.8\},\{0.2\}\}$ |
$\{\{0.4,0.5,0.6\},\{0.4\}\}$ |
$\{\{0.1,0.2\},\{0.4,0.5\}\}$ |
${x_{5}}$ |
$\{\{0.4,0.5\},\{0.3\}\}$ |
$\{\{0.4,0.6\},\{0.1,0.2,0.3\}\}$ |
$\{\{0.5,0.6\},\{0.2,0.4\}\}$ |
$\{\{0.8,0.9\},\{0.1\}\}$ |
$\{\{0.4\},\{0.5,0.6\}\}$ |
$\{\{0.6,0.7\},\{0.3\}\}$ |
Table 2
Dual hesitant fuzzy priority weights of first three attributes.
|
${w_{1}}$ |
${w_{2}}$ |
${w_{3}}$ |
${x_{1}}$ |
$\{\{1\},\{0\}\}$ |
$\{\{0.5,0.7\},\{0.1,0.2,0.3\}\}$ |
$\{\{0.15,0.35,0.42\},\{0.28,0.36,0.58\}\}$ |
${x_{2}}$ |
$\{\{1\},\{0\}\}$ |
$\{\{0.4\},\{0.2,0.3\}\}$ |
$\{\{0.24,0.28\},\{0.28,0.37\}\}$ |
${x_{3}}$ |
$\{\{1\},\{0\}\}$ |
$\{\{0.3,0.4\},\{0.1,0.2\}\}$ |
$\{\{0.18,0.32\},\{0.19,0.28\}\}$ |
${x_{4}}$ |
$\{\{1\},\{0\}\}$ |
$\{\{0.6,0.7\},\{0.1,0.2\}\}$ |
$\{\{0.36,0.56\},\{0.19,0.28\}\}$ |
${x_{5}}$ |
$\{\{1\},\{0\}\}$ |
$\{\{0.4,0.5\},\{0.3\}\}$ |
$\{\{0.16,0.3\},\{0.37,0.44,0.51\}\}$ |
Table 3
Dual hesitant fuzzy priority weights of last three attributes.
|
${w_{4}}$ |
${w_{5}}$ |
${w_{6}}$ |
${x_{1}}$ |
$\{\{0.015,0.07,0.084\},\{0.64,0.68,0.832\}\}$ |
$\{\{0.012,0.063,0.0756\},\{0.676,0.712,0.8488\}\}$ |
$\{\{0.0072,0.0504,0.0605\},\{0.7084,0.7408,0.8791\}\}$ |
${x_{2}}$ |
$\{\{0.144,0.196,0.224\},\{0.424,0.559\}\}$ |
$\{\{0.072,0.1372,0.1568\},\{0.4816,0.6031\}\}$ |
$\{\{0.036,0.0823,0.1098\},\{0.5334,0.6825\}\}$ |
${x_{3}}$ |
$\{\{0.072,0.192\},\{0.514,0.568\}\}$ |
$\{\{0.0432,0.1344\},\{0.6112,0.6976\}\}$ |
$\{\{0.0346,0.1209\},\{0.6501,0.7278\}\}$ |
${x_{4}}$ |
$\{\{0.072,0.168\},\{0.514,0.712\}\}$ |
$\{\{0.0504,0.1344\},\{0.6112,0.7696\}\}$ |
$\{\{0.0202,0.0672,0.0806\},\{0.7667,0.8618\}\}$ |
${x_{5}}$ |
$\{\{0.08,0.18\},\{0.496,0.552,0.706\}\}$ |
$\{\{0.064,0.162\},\{0.5464,0.5968,0.7354\}\}$ |
$\{\{0.0256,0.0648\},\{0.7732,0.7984,0.8942\}\}$ |
Obviously, the above problem is a dual hesitant fuzzy MADM problem with prioritized attributes. In the following, we adopt the proposed method to solve it.
Firstly, by Eq. (
12), we calculate the priority weights
${w_{j}}({x_{i}})$ of the attributes
${c_{j}}$ $(j=1,2,\dots ,6)$ for the cars
${x_{i}}$ $(i=1,2,\dots ,5)$, see Tables
2 and
3. Then, by Eq. (
13), the overall attribute values of the cars
${x_{i}}$ $(i=1,2,\dots ,5)$ are calculated, shown as:
Finally, according to Definition
10, we obtain the scores of
$F({x_{i}})$ $(i=1,2,\dots ,5)$, listed as:
from which we get the ranking orders of the five optional cars:
${x_{4}}\succ {x_{1}}\succ {x_{3}}\succ {x_{2}}\succ {x_{5}}$, where “≻” means “prefer to”. Therefore, the consumer should buy the fourth car
${x_{4}}$.
It is not hard to find that in the above procedures the priority weights of attributes are indeed induced by the DHFP
t-norm, shown as Eq. (
3), and the overall attribute value of each car is indeed derived from the DHFP
t-norm and DHFPS
t-conorm, shown as Eqs. (
3) and (
6), respectively. Now we consider other DHF
t-norms and
t-conorms. Firstly, if we adopt the DHFM
t-norm and DHFL
t-norm, shown as Eqs. (
2) and (
4), respectively, to induce the priority weights of attributes, then by means of our proposed method, the score of the obtained overall attribute value of each car
${x_{i}}$ can be computed, see Table
4.
Table 4
Scores and rankings of cars with different DHF t-norms inducing priority weights.
DHF t-norms |
Scores of cars |
Ranking orders |
${x_{1}}$ |
${x_{2}}$ |
${x_{3}}$ |
${x_{4}}$ |
${x_{5}}$ |
DHFM t-norm |
0.7901 |
0.8289 |
0.8041 |
0.8915 |
0.8606 |
${x_{4}}\succ {x_{5}}\succ {x_{2}}\succ {x_{3}}\succ {x_{1}}$ |
DHFP t-norm |
0.7499 |
0.715 |
0.7171 |
0.8768 |
0.4438 |
${x_{4}}\succ {x_{1}}\succ {x_{3}}\succ {x_{2}}\succ {x_{5}}$ |
DHFL t-norm |
0.6351 |
0.5581 |
0.5181 |
0.7995 |
0.5169 |
${x_{4}}\succ {x_{1}}\succ {x_{2}}\succ {x_{3}}\succ {x_{5}}$ |
Moreover, if we use the DHFM
t-norm, DHFP
t-norm, and DHFL
t-norm, shown as Eqs. (
2)–(
4), respectively, to generate the priority weights of attributes, and the DHFL
t-norm and DHFL
t-conorm, shown as Eqs. (
4) and (
7), to aggregate the attribute values, then by our proposed method, the score of the obtained overall attribute value of each car
${x_{i}}$ can be computed, see Table
5.
Table 5
Scores and ranking orders of cars with different DHF t-norms inducing priority weights.
DHF t-norms |
Scores of cars |
Ranking orders |
${x_{1}}$ |
${x_{2}}$ |
${x_{3}}$ |
${x_{4}}$ |
${x_{5}}$ |
DHFM t-norm |
0.75 |
0.6667 |
0.7 |
0.9 |
0.8 |
${x_{4}}\succ {x_{5}}\succ {x_{1}}\succ {x_{3}}\succ {x_{2}}$ |
DHFP t-norm |
0.8 |
0.4933 |
0.4672 |
0.9 |
0.54 |
${x_{4}}\succ {x_{1}}\succ {x_{5}}\succ {x_{2}}\succ {x_{3}}$ |
DHFL t-norm |
0.8 |
0.46 |
0.45 |
0.9 |
0.5 |
${x_{4}}\succ {x_{1}}\succ {x_{5}}\succ {x_{2}}\succ {x_{3}}$ |
From Tables
4 and
5, it can be clearly seen that the car
${x_{4}}$ is always the best choice no matter which DHF
t-norm is applied to generate the priority weights of attributes and whichever DHF
t-norm and
t-conorm is adopted to aggregate the attribute values of cars. However, the ranking orders of cars are different in different cases. On one hand, the ranking orders of cars are different when different DHF
t-norms are used to induce the priority weights of attributes. On the other hand, different ranking orders of cars are generated when different DHF
t-norms and
t-conorms are used to aggregate the attribute values.
All of these illustrate that different ranking orders of alternatives will be yielded when different DHF t-norms are used to induce the priority weights of attributes or different DHF t-norms and t-cornoms are adopted to aggregate the attribute values of alternatives. Then two important questions arise: which DHF t-norm performs better in generating priority weights, and which DHF t-norm and DHF t-conorm conduct better in aggregating attribute values? Since the solving process is complicated, we will resolve these questions in our future work.
5 Comparative Analyses and Discussions
In this section, two comparisons are conducted to illustrate the validity and superiority of the developed prioritized aggregation operators and the proposed decision making method.
5.1 Comparative Studies of Prioritized Aggregation Operators
From the introduction, we note that no studies have been done on the aggregation of dual hesitant fuzzy information in the MADM problems with prioritized attributes. Since IFSs and HFSs are two special cases of DHFSs, below we compare the developed prioritized aggregation operators with those in the intuitionistic fuzzy and hesitant fuzzy environments shown in Yu and Xu (
2013), Wei (
2012).
(1) A comparison with prioritized intuitionistic fuzzy aggregation operators
Based upon the basic operations of IFNs shown in Definition
3, Yu and Xu (
2013) developed the following two kinds of prioritized intuitionistic fuzzy aggregation (PIFA) operators to manage the intuitionistic fuzzy MADM problems with prioritized attributes:
where
${\alpha _{j}}({x_{i}})$ is an IFN representing the attribute value of the alternative
${x_{i}}$ under the attribute
${c_{j}}$ $(j=1,2,\dots ,m)$ and
${w_{j}}({x_{i}})$ is the priority weight of the attribute
${c_{j}}$ regarding the alternative
${x_{i}}$ defined by
where
${\alpha _{0}}({x_{i}})=(1,0)$.
Assume that there are two prioritized attributes
${c_{1}}\succ {c_{2}}$,
${\alpha _{1}}({x_{i}})=(0,1)$ and
${\alpha _{2}}({x_{i}})=(0.3,0.5)$. Then, by Eq. (
20), we get
${w_{1}}({x_{i}})=(1,0)$ and
${w_{2}}({x_{i}})=(1,0)\otimes (0,1)=(0,1)$. Furthermore, by Eqs. (
18) and (
19), we respectively obtain
and
From the above, we notice that for the alternative
${x_{i}}$, when the attribute value under the first prioritized attribute is
$(0,1)$, neither of the aggregation results derived from Eqs. (
18) and (
19) is
$(0,1)$, which indicates that there exists compensation between the two attributes. Thus, the PIFA operators shown in Eqs. (
18) and (
19) do not capture the prioritization relationship between the two attributes and they are not suitable to handle the above intuitionistic fuzzy MADM problems with the prioritized attributes. However, by using our prioritized aggregation operator defined as Eqs. (
14) and (
15), we get
and
which are rational. Therefore, it can be concluded that our developed prioritized aggregation operators are also applicable for solving the intuitionistic fuzzy MADM problems with prioritized attributes and are more effective than the PIFA operators shown in Yu and Xu (
2013).
(2) A comparison with the hesitant fuzzy prioritized weighted average operator
In order to solve the hesitant fuzzy MADM problems with prioritized attributes, Wei (
2012) developed the following hesitant fuzzy prioritized weighted average (HFPWA) operator:
where
${h_{ij}}$ is an HFE representing the possible attribute values of the alternative
${x_{i}}$ under the attribute
${c_{j}}$ $(j=1,2,\dots ,m)$ and
${T_{j}}({x_{i}})$ is the priority weight of the attribute
${c_{j}}$ regarding the alternative
${x_{i}}$ defined by
where
$q({h_{ij}})$ is the score of
${h_{ij}}$ derived from Definition
5.
Below we make a detailed comparison of our developed prioritized aggregation operators with the HFPWA operator through the following example concerning the introduction of overseas outstanding teachers.
Example 5 (See Wei, 2012).
To strengthen academic education and promote the building of a teaching body, the school of management in a Chinese university wants to introduce overseas outstanding teachers. This introduction has received great attention from the school. A panel of decision makers constituted by the university president, the dean of management school and the human resource officer will take the whole responsibility for this introduction. They came up with a strict evaluation for five candidates
${x_{i}}$ $(i=1,2,\dots ,5)$ from the following four aspects: morality
${c_{1}}$, research capability
${c_{2}}$, teaching skill
${c_{3}}$ and educational background
${c_{4}}$. This introduction will be in strict accordance with the principle of combining ability with political integrity. There is a prioritization relationship over the attributes:
${c_{1}}\succ {c_{2}}\succ {c_{3}}\succ {c_{4}}$. Each candidate
${x_{i}}$ is evaluated using the HFE
${h_{j}}({x_{i}})$ by the panel of decision makers under the attribute
${c_{j}}$, see Table
6.
Table 6
Hesitant fuzzy assessment values.
|
${c_{1}}$ |
${c_{2}}$ |
${c_{3}}$ |
${c_{4}}$ |
${x_{1}}$ |
$\{0.4,0.5,0.7\}$ |
$\{0.5,0.8\}$ |
$\{0.6,0.7,0.9\}$ |
$\{0.5,0.6\}$ |
${x_{2}}$ |
$\{0.6,0.7,0.8\}$ |
$\{0.5,0.6\}$ |
$\{0.4,0.6,0.7\}$ |
$\{0.4,0.5\}$ |
${x_{3}}$ |
$\{0.6,0.8\}$ |
$\{0.2,0.3,0.5\}$ |
$\{0.4,0.6\}$ |
$\{0.5,0.7\}$ |
${x_{4}}$ |
$\{0.5,0.6,0.7\}$ |
$\{0.4,0.5\}$ |
$\{0.8,0.9\}$ |
$\{0.3,0.4,0.5\}$ |
${x_{5}}$ |
$\{0.6,0.7\}$ |
$\{0.5,0.7\}$ |
$\{0.7,0.8\}$ |
$\{0.2,0.3,0.4\}$ |
Below we utilize the proposed method to deal with the above hesitant fuzzy MADM problem with prioritized attributes.
Firstly, by Eq. (
16), we calculate the priority weights
${w_{j}}({x_{i}})$ (
$i=1,2,\dots ,5$,
$j=1,2,\dots ,4$) of the attributes
${c_{j}}$ $(j=1,2,\dots ,4)$ for candidates
${x_{i}}$ $(i=1,2,\dots ,5)$, see Table
7.
Table 7
Hesitant fuzzy priority weights.
|
${w_{1}}$ |
${w_{2}}$ |
${w_{3}}$ |
${w_{4}}$ |
${x_{1}}$ |
$\{1\}$ |
$\{0.4,0.5,0.7\}$ |
$\{0.2,0.4,0.56\}$ |
$\{0.12,0.28,0.504\}$ |
${x_{2}}$ |
$\{1\}$ |
$\{0.6,0.7,0.8\}$ |
$\{0.3,0.42,0.48\}$ |
$\{0.12,0.252,0.336\}$ |
${x_{3}}$ |
$\{1\}$ |
$\{0.6,0.8\}$ |
$\{0.12,0.24,0.4\}$ |
$\{0.048,0.144,0.24\}$ |
${x_{4}}$ |
$\{1\}$ |
$\{0.5,0.6,0.7\}$ |
$\{0.2,0.3,0.35\}$ |
$\{0.16,0.27,0.315\}$ |
${x_{5}}$ |
$\{1\}$ |
$\{0.6,0.7\}$ |
$\{0.3,0.49\}$ |
$\{0.21,0.392\}$ |
Moreover, by Eq. (
17), we compute the overall attribute values of the candidates
${x_{i}}$ $(i=1,2,\dots ,5)$, shown as:
Finally, according to Definition
5, the scores of
$h({x_{i}})$ $(i=1,2,\dots ,5)$ are obtained:
Consequently, the ranking of the five candidates is
${x_{5}}\succ {x_{2}}\succ {x_{3}}\succ {x_{4}}\succ {x_{1}}$.
In order to obtain the ranking of the five candidates, Wei (
2012) adopted the HFPWA operator defined as Eqs. (
21) and (
22) to compute the overall attribute values of candidates, and then rank the candidates according to the scores of the overall attribute values defined in Definition
5. Here we omit the detailed procedure of Wei’s method and only list the obtained ranking of candidates:
${x_{5}}\succ {x_{2}}\succ {x_{1}}\succ {x_{4}}\succ {x_{3}}$.
It can be easily seen that the ranking of the five candidates derived from our method is slightly different from that yielded by Wei’s method. The main reason may be that in the two methods the priority weights of attributes are generated in different ways. In our method, we indeed use a t-norm to induce the priority weights of attributes. In this process, we make full use of the given hesitant fuzzy decision information and avoid the loss of original information; while in Wei’s method, we first need to compute the scores of hesitant fuzzy attribute values, which are real numbers, and then calculate the priority weights of attributes by the product of the scores, which are also real numbers. In this course, the given hesitant fuzzy decision information is not fully utilized and just transformed into single real numbers, which leads to the distortion and loss of information and thus results in inaccurate decision results. We shall further illustrate this by the following example:
Suppose that an MADM problem is composed of two alternatives
${x_{1}}$ and
${x_{2}}$, and three attributes
${c_{1}}$,
${c_{2}}$ and
${c_{3}}$ over which there exists the prioritization relationship
${c_{1}}\succ {c_{2}}\succ {c_{3}}$. The attribute value of each alternative under each attribute expressed by an HFE is shown in Table
8.
Table 8
Hesitant fuzzy attribute values.
|
${c_{1}}$ |
${c_{2}}$ |
${c_{3}}$ |
${x_{1}}$ |
$\{0.2,0.3,0.5,0.8\}$ |
$\{0.2,0.3,0.4\}$ |
$\{0.4,0.6\}$ |
${x_{2}}$ |
$\{0.3,0.45,0.6\}$ |
$\{0.2,0.4\}$ |
$\{0.3,0.5,0.7\}$ |
In the following, we shall investigate the priority weights of attributes generated by Wei’s method and our method, respectively. At first, we use Wei’s method, i.e. Eq. (
22), to calculate the priority weights of attributes. For convenience, we denote the hesitant fuzzy attribute values of the alternatives
${x_{i}}$ $(i=1,2)$ under the attributes
${c_{j}}$ $(j=1,2,3)$ as
${h_{ij}}$ (
$i=1,2$,
$j=1,2,3$). Then, according to Definition
5, we calculate the scores of all hesitant fuzzy attribute values, shown as:
Moreover, by Eq. (
22), we compute the priority weights of attributes, see Table
9.
Table 9
Real-valued priority weights.
|
${w_{1}}$ |
${w_{2}}$ |
${w_{3}}$ |
${x_{1}}$ |
1 |
0.45 |
0.135 |
${x_{2}}$ |
1 |
0.45 |
0.135 |
Again, we use the developed method, i.e. Eq. (
16), to compute the priority weights of attributes and list the results in Table
10.
Table 10
Hesitantfuzzy priority weights.
|
${w_{1}}$ |
${w_{2}}$ |
${w_{3}}$ |
${x_{1}}$ |
$\{1\}$ |
$\{0.2,0.3,0.5,0.8\}$ |
$\{0.04,0.09,0.2,0.32\}$ |
${x_{2}}$ |
$\{1\}$ |
$\{0.3,0.45,0.6\}$ |
$\{0.06,0.18,0.24\}$ |
From Tables
9 and
10, it can be easily observed that by Wei’s method, for the alternatives
${x_{1}}$ and
${x_{2}}$, the generated priority weight of each attribute is the same although their assessment information under the attribute is different, which is unreasonable. The reason is that in the process of generating priority weights for attributes, the score function is used to transform the given hesitant fuzzy attribute values into single real numbers, which leads to distortion and loss of information. Nevertheless, our method takes full advantage of the given hesitant fuzzy decision information, and for the alternatives
${x_{1}}$ and
${x_{2}}$, the generated priority weights of each attribute are different, except for those of the first prioritized attribute, that is, the generated priority weights are dependent upon the alternatives, which capture the characteristic of the MADM problems with prioritized attributes.
5.2 Comparative Studies of Prioritized Dual Hesitant Fuzzy MADM Methods
As mentioned in the introduction, in order to solve the dual hesitant fuzzy MADM problems with prioritized attributes, Ren and Wei (
2017) established a decision making method based on a correctional score function and a dice similarity measure of DHFEs. In this part, we make a detailed comparison with this method to illustrate the advantages of our proposed method through the car selection problem shown in Example
4.
Now we adopt Ren and Wei (
2017)’s method to deal with the car selection problem described in Example
4. Firstly, by the formulae
${w_{1}}({x_{i}})=1$ and
${w_{j}}({x_{i}})={\textstyle\prod _{r=1}^{j-1}}{S_{{D_{\alpha }}}}({d_{r}}({x_{i}}))$ for
$j\ne 1$, we calculate the priority weights
${w_{j}}({x_{i}})$ (
$i=1,2,\dots ,5$,
$j=1,2,\dots ,6$) of the attributes
${c_{j}}$ $(j=1,2,\dots ,6)$ for the cars
${x_{i}}$ $(i=1,2,\dots ,5)$, see Table
11. Here,
${S_{{D_{\alpha }}}}({d_{r}}({x_{i}}))$ is the correctional score function of the dual hesitant fuzzy attribute value
${d_{r}}({x_{i}})$ (for details about the correctional score function of DHFEs, please see Ren and Wei (
2017).
Table 11
Real-valued priority weights.
|
${w_{1}}$ |
${w_{2}}$ |
${w_{3}}$ |
${w_{4}}$ |
${w_{5}}$ |
${w_{6}}$ |
${x_{1}}$ |
1 |
0.748 |
0.4543 |
0.1008 |
0.0902 |
0.0742 |
${x_{2}}$ |
1 |
0.6104 |
0.5255 |
0.4322 |
0.3663 |
0.2913 |
${x_{3}}$ |
1 |
0.675 |
0.5886 |
0.3269 |
0.2361 |
0.2112 |
${x_{4}}$ |
1 |
0.81 |
0.7063 |
0.2373 |
0.1873 |
0.1041 |
${x_{5}}$ |
1 |
0.5984 |
0.4239 |
0.2741 |
0.2453 |
0.1033 |
Then, based on the formula
$PD({x^{\ast }},{x_{i}})={\textstyle\sum _{j=1}^{6}}\frac{{w_{j}}({x_{i}})}{{\textstyle\sum _{j=1}^{6}}{w_{j}}({x_{i}})}\frac{2{S_{{D_{\alpha }}}}({d_{j}^{\ast }}){S_{{D_{\alpha }}}}({d_{j}}({x_{i}}))}{{S_{{D_{\alpha }}}}{({d_{j}^{\ast }})^{2}}+{S_{{D_{\alpha }}}}{({d_{j}}({x_{i}}))^{2}}}$, we calculate the dice similarity measure between the ideal alternative
${x^{\ast }}$, defined as
${x^{\ast }}=({d_{1}^{\ast }},{d_{2}^{\ast }},\dots ,{d_{6}^{\ast }})$ with
${d_{j}^{\ast }}=\{\{1\},\{0\}\}$,
$j=1,2,\dots ,6$, and each car
${x_{i}}$ $(i=1,2,\dots ,5)$, shown as:
Therefore, the ranking of the five optional cars is
${x_{3}}\succ {x_{2}}\succ {x_{5}}\succ {x_{4}}\succ {x_{1}}$, and the consumer should buy the third car
${x_{3}}$.
Obviously, the ranking of the five optional cars derived from Ren and Wei (
2017)’s method is markedly different from that derived from our proposed method, which is
${x_{4}}\succ {x_{1}}\succ {x_{3}}\succ {x_{2}}\succ {x_{5}}$. The reason may be that in the two methods the dual hesitant fuzzy decision information is handled in different ways. In Ren and Wei’s method, all original dual hesitant fuzzy decision information is not sufficiently utilized and just translated into single real numbers by the correctional score function, which leads to distortion and loss of information. However, in our method, all original dual hesitant fuzzy decision information is first dealt with by means of a dual hesitant fuzzy
t-norm to generate the priority weights of attributes, and then the single dual hesitant fuzzy attribute values are conducted a weighted aggregation by the developed PDHFWT operator to yield the overall attribute values of alternatives. In the whole process, we make the best of the given dual hesitant fuzzy decision information and avoid the loss of information. Furthermore, it is worthwhile to mention that by using our method, the obtained priority weights of attributes and overall attribute values of alternatives are all in the form of DHFEs, which can well embody the dual hesitant essence of dual hesitant fuzzy MADM problems.
From the above two comparisons, it is not hard to see that the developed prioritized aggregation operators can well circumvent the drawbacks of some existing prioritized aggregation operators, and have great superiority in manipulating such dual hesitant fuzzy MADM problems in which there is a prioritization relationship over attributes. The main advantages of the developed prioritized aggregation operators are summarized as follows:
(1) The developed prioritized aggregation operators take full advantage of the given dual hesitant fuzzy decision information and avoid the loss of original information.
(2) By the developed prioritized aggregation operators, the obtained priority weights of attributes and overall attribute values of alternatives take the form of DHFEs, which can well embody the dual hesitant essence of dual hesitant fuzzy MADM problems.
(3) The developed prioritized aggregation operators permit the decision makers to have more choices when choosing aggregation techniques since in these operators, the dual hesitant fuzzy t-norms and t-conorms are changeable.
(4) The developed prioritized aggregation operators are also applicable for solving the intuitionistic fuzzy and hesitant fuzzy MADM problems with prioritized attributes, and are more effective than relevant prioritized aggregation operators.
6 Conclusions
In this paper, we have been concerned with the aggregation of dual hesitant fuzzy information in multi-attribute decision making (MADM) problems with prioritized attributes. Firstly, we have defined dual hesitant fuzzy t-norms and t-conorms and studied a special class of dual hesitant fuzzy t-norms and t-conorms in detail, which are constructed by traditional t-norms and t-conorms. Secondly, we have developed the prioritized dual hesitant fuzzy weighted triangular operator to aggregate dual hesitant fuzzy assessment information of alternatives under the prioritized attributes, from which a family of prioritized dual hesitant fuzzy aggregation operators can be derived. Thirdly, we have applied the developed prioritized aggregation operators to solve the dual hesitant fuzzy MADM problems with prioritized attributes. Finally, by comparative analyses, we have shown that the developed prioritized aggregation operators take full advantage of the given decision information, avoid the loss of original information, and thus yield better final decision results. Moreover, the priority weights of attributes induced by a dual hesitant fuzzy t-norm take the form of dual hesitant fuzzy elements, which can well embody the dual hesitant essence of dual hesitant fuzzy MADM problems. Besides, the developed prioritized aggregation operators are also applicable for handling the intuitionistic fuzzy and hesitant fuzzy MADM problems with prioritized attributes, and are more effective than relevant prioritized aggregation operators.
As shown in Section
4.2, when we use different dual hesitant fuzzy
t-norms to induce priority weights of attributes or different dual hesitant fuzzy
t-norms and
t-conorms to aggregate the attribute values of alternatives, different rankings of alternatives will be gotten. Which dual hesitant fuzzy
t-norm performs better in generating priority weights, and which dual hesitant fuzzy
t-norm and dual hesitant fuzzy
t-conorm conducts better in aggregating attribute values? In our future work, we will try to solve these two issues. Moreover, as Zhao
et al. (
2017) and Liu
et al. (
2017) pointed out that in the decision making process different decision makers have different knowledge, experience, culture and educational backgrounds, they always use heterogeneous preference representation structures to express their preferences. In future studies, we will investigate the resolution of heterogeneous multi-attribute group decision making problems, in which the decision information is expressed as hesitant fuzzy elements, dual hesitant fuzzy elements, hesitant fuzzy linguistic term sets and probabilistic linguistic term sets. Besides, the consensus problem is a hot topic in group decision making (Capuano
et al.,
2017; Del Moral
et al.,
2018; Herrera-Viedma
et al.,
2017). In our future work, we attempt to study the consensus reaching model in group decision making based on dual hesitant fuzzy preference relations by considering social influence.