# Multicriteria Decision-Making Approach with Hesitant Interval-Valued Intuitionistic Fuzzy Sets

Authors: Juan-juan Peng; Jian-qiang Wang; Jing Wang; Xiao-hong Chen
Journal: The Scientific World Journal
 (2014)

---

## Abstract

The definition of hesitant interval-valued intuitionistic fuzzy sets (HIVIFSs) is developed based on interval-valued intuitionistic fuzzy sets (IVIFSs) and hesitant fuzzy sets (HFSs). Then, some operations on HIVIFSs are introduced in detail, and their properties are further discussed. In addition, some hesitant interval-valued intuitionistic fuzzy number aggregation operators based ont-conorms and t-norms are proposed, which can be used to aggregate decision-makers' information in multicriteria decision-making (MCDM) problems. Some valuable proposals of these operators are studied. In particular, based on algebraic and Einstein t-conorms and t-norms, some hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators and Einstein aggregation operators can be obtained, respectively. Furthermore, an approach of MCDM problems based on the proposed aggregation operators is given using hesitant interval-valued intuitionistic fuzzy information. Finally, an illustrative example is provided to demonstrate the applicability and effectiveness of the developed approach, and the study is supported by a sensitivity analysis and a comparison analysis.


---

## Body

## 1. Introduction

Since fuzzy sets were proposed by Zadeh [1], the studies on multicriteria decision-making (MCDM) problems have made great progress. Further, fuzzy sets were generalized to intuitionistic fuzzy sets (IFSs) by Atanassov [2, 3], where each element in an IFS has a membership degree and a nonmembership degree between 0 and 1, respectively. Then, Atanassov and Gargov [4] proposed the notion of interval-valued intuitionistic fuzzy sets (IVIFSs) which are the extension of IFSs, where the membership degree and nonmembership degree of an element in an IVIFS are, respectively, represented by intervals in [
0,1
] rather than crisp values between 0 and 1. In recent years, many researchers have studied the theory of IVIFSs and applied it to various fields [5–8]. For instance, Atanassov [9] introduced the operators of IVIFSs. Lee [10] proposed a method for ranking interval-valued intuitionistic fuzzy numbers (IVIFNs) for fuzzy decision-making problems. Lee [11] provided an enhanced MCDM method of machine design schemes under the interval-valued intuitionistic fuzzy environment. Li [12] proposed a TOPSIS based nonlinear-programming method for MCDM problems with IVIFSs. Park et al. [13] extended the TOPSIS method to solve group MCDM problems in interval-valued intuitionistic fuzzy environment in which all the preference information provided by decision-makers is presented as IVIFNs. Chen et al. [14] developed an approach to tackle group MCDM problems in the context of IVIFSs. Nayagam and Sivaraman [15] introduced a method for ranking IVIFSs and compared it to other methods by means of numerical examples. Chen et al. [16] presented a MCDM method based on the proposed interval-valued intuitionistic fuzzy weighted average (IVIFWA) operator. Meng et al. [17] developed an induced generalized interval-valued intuitionistic fuzzy hybrid Shapley averaging (GIVIFHSA) operator and applied it to MCDM problems.Hesitant fuzzy sets (HFSs), another extension of traditional fuzzy sets, provide a useful reference for our study under hesitant fuzzy environment. HFSs were first introduced by Torra and Narukawa [18], and they permit the membership degrees of an element to be a set of several possible values between 0 and 1. HFSs are highly useful in handling the situations where people have hesitancy in providing their preferences over objects in the decision-making process. Some aggregation operators of HFSs were studied and applied to decision-making problems [19–21]. Then, the correlation coefficients of HFSs, the distance measures, and correlation measures of HFSs were discussed [22–24], based on which Peng et al. [25] presented a generalized hesitant fuzzy synergetic weighted distance measure. Zhang and Wei [26] developed the E-VIKOR method and TOPSIS method to solve MCDM problems with hesitant fuzzy information. Zhang [27] developed a wide range of hesitant fuzzy power aggregation operators for hesitant fuzzy information. Chen et al. [28] generalized the concept of HFSs to hesitant interval-valued fuzzy sets (HIVFSs) in which the membership degrees of an element to a given set are not exactly defined but denoted by several possible interval values. Wei [29] defined HIVFSs and some hesitant interval-valued fuzzy aggregation operators. Wei and Zhao [30] developed some Einstein operations on HIVFSs and the induced hesitant interval-valued fuzzy Einstein aggregation (HIVFEA) operators and applied them to MCDM problems. Zhu et al. [31] defined dual HFSs (DHFSs) in terms of two functions that return two sets of membership degrees and nonmembership degrees rather than crisp numbers in HFSs. If the idea of dual HFSs is used from a new perspective, then another extension of HFSs may be defined in terms of one function that the element of HFSs returns a set of IFSs, which are called hesitant intuitionistic fuzzy sets (HIFSs). But decision-makers usually cannot estimate criteria values of alternatives with exact numerical values when the information is not known precisely. Therefore, interval values in fuzzy sets can represent it better than specific numbers, such as interval-valued fuzzy sets (IVFSs) and IVIFSs. Furthermore, although the theories of IVIFSs and HFSs have been developed and generalized, they cannot deal with all sorts of uncertainties in different real problems. For example, when we ask the opinion of an expert about a certain statement, he or she may answer that the possibility that the statement is true is [0.1, 0.2] and that the statement is false is [0.4, 0.5], or the possibility that the statement is true is [0.5, 0.6] and that the statement is false is [0.3, 0.5]. This issue is beyond the scope of IVFSs and IVIFSs. Therefore, some new theories are required.So the concept of hesitant interval-valued intuitionistic fuzzy sets (HIVIFSs) is developed in this paper. Comparing to the existing fuzzy sets mentioned above, HIVIFSs are a new extension of HFSs, which support a more flexible and simpler approach when decision-makers provide their decision information in a hesitant interval-valued intuitionistic fuzzy environment. Furthermore, IVIFSs, HFSs, HIVFSs, and HIFSs are all the special cases of HIVIFSs.In this paper, HFSs are extended based on IVIFSs. HIVIFSs are defined, and their properties and applications are also discussed. Thus, the rest of this paper is organized as follows. In Section2, the definitions and properties of IVIFSs and HFSs are briefly reviewed. In Section 3, the notion of HIVIFSs is proposed, and the operations and properties of HIVIFSs based on t-conorms and t-norms are discussed. In Section 4, some hesitant interval-valued intuitionistic fuzzy number aggregation operators are developed and applied to MCDM problems. Section 5 gives an example to illustrate the application of the developed method. Finally, the conclusions are drawn in Section 6.


## 2. Preliminaries

In this section, some basic concepts and definitions related to HIVIFSs are introduced, including interval numbers, IVIFSs, and HFSs. These will be utilized in the subsequent analysis.


### 2.1. Interval Numbers and Their Operations

Definition 1 (see [32–34]).
Leta
~
=
[
a
L
,
a
U
]
=
{
x
∣
a
L
≤
x
≤
a
U
}; then a
~ is called an interval number. In particular, if 0
≤
a
L
≤
x
≤
a
U, then a
~ is reduced to a positive interval number.
Consider any two interval fuzzy numbersa
~
=
[
a
L
,
a
U
] and b
~
=
[
b
L
,
b
U
], and their operations are defined as follows:(1)
a
~
=
b
~
⇔
a
L
=
b
L
,
a
U
=
b
U;
(2)
a
~
+
b
~
=
[
a
L
+
b
L
,
a
U
+
b
U
];
(3)
a
~
-
b
~
=
[
a
L
-
b
U
,
a
U
-
b
L
];
(4)
a
~
×
b
~
=
[
min
⁡
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}, max
⁡
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}
];
(5)
k
a
~
=
[
k
a
L
,
k
a
U
]
,
k
>
0.


### 2.2. IVIFSs

Atanassov first proposed IFSs, being enlargement and development of Zadeh’s fuzzy sets. IFSs contain the degree of nonmembership, which makes it possible for us to model unknown information. The definition of IVIFSs given by Atanassov and Gargov [4] is shown as follows.Definition 2 (see [4]).
LetD
[
0,1
] be the set of all closed subintervals of the interval [
0,1
]. Let X be a given set and X
≠
⌀. An IVIFS in X is an expression given by A
=
{
〈
x
,
μ
A
(
x
)
,
ν
A
(
x
)
〉
∣
x
∈
X
}, where μ
A
:
X
→
D
[
0,1
], ν
A
→
D
[
0,1
] with the condition 0
<
su
p
x
μ
A
(
x
)
+
su
p
x
ν
A
(
x
)
≤
1. The intervals μ
A
(
x
) and ν
A
(
x
) denote the degree of belongingness and nonbelongingness of the element x to the set A, respectively. Thus, for each x
∈
X, μ
A
(
x
) and ν
A
(
x
) are closed intervals whose lower and upper boundaries are denoted by μ
A
L
(
x
)
,
μ
A
U
(
x
) and ν
A
L
(
x
)
,
ν
A
U
(
x
), respectively, and then
(1)
A
=
{
〈
x
,
[
μ
A
L
(
x
)
,
μ
A
U
(
x
)
]
,
[
ν
A
L
(
x
)
,
ν
A
U
(
x
)
]
〉
∣
x
∈
X
}
,
where 0
<
μ
A
U
(
x
)
+
ν
A
U
(
x
)
≤
1, μ
A
L
(
x
)
≥
0
,
ν
A
L
(
x
)
≥
0. For each element x, the hesitancy degree can be calculated as follows: Π
A
(
x
)
=
1
-
μ
A
(
x
)
-
ν
A
(
x
)
=
[
1
-
μ
A
U
(
x
)
-
ν
A
U
(
x
)
,
1
-
μ
A
L
(
x
)
-
ν
A
L
(
x
)
]. The set of all IVIFSs in X is denoted by IVIFS(X). An interval-valued intuitionistic fuzzy number (IVIFN) is denoted by A
=
(
[
a
,
b
]
,
[
c
,
d
]
) and the degree of hesitance is denoted by [
e
,
f
]
=
[
1
-
a
-
d
,
1
-
a
-
c
] for convenience.Definition 3 (see [16]).
Letα
~
i
=
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
(
1
≤
i
≤
n
) be a collection of IVIFNs and let w
i
(
1
≤
i
≤
n
) be the crisp values, where α
~
i
=
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
=
[
[
a
i
,
b
i
]
,
[
1
-
d
i
,
1
-
c
i
]
], 0
≤
a
i
≤
b
i
≤
1, 0
≤
c
i
≤
d
i
≤
1, 0
≤
b
i
+
d
i
≤
1, and 1
≤
i
≤
n, and then the interval-valued intuitionistic fuzzy weighted average operator can be defined as follows:
(2)
IVIFW
A
w
(
α
~
1
,
α
~
2
,
…
,
α
~
n
)
=
∑
i
=
1
n
[
[
a
i
,
b
i
]
,
[
1
-
d
i
,
1
-
c
i
]
]
×
w
i
∑
i
=
1
n
w
i
=
[
[
∑
i
=
1
n
a
i
w
i
∑
i
=
1
n
w
i
,
∑
i
=
1
n
b
i
w
i
∑
i
=
1
n
w
i
]
,
=
=
[
∑
i
=
1
n
(
1
-
d
i
)
w
i
∑
i
=
1
n
w
i
,
∑
i
=
1
n
(
1
-
c
i
)
w
i
∑
i
=
1
n
w
i
]
]
=
[
[
a
~
,
b
~
]
,
[
c
~
,
d
~
]
]
,
where IVIFW
A
w
(
α
~
1
,
α
~
2
,
…
,
α
~
n
)
=
[
[
a
~
,
b
~
]
,
[
c
~
,
d
~
]
]
=
〈
[
a
~
,
b
~
]
,
[
1
-
d
~
,
1
-
c
~
]
〉 is an interval-valued intuitionistic fuzzy value;a
~, b
~, c
~, and d
~ are calculated by the Karnik-Mendel algorithms [35].Example 4.
Letα
~
1
=
〈
[
0.3,0.6
]
,
[
0.1,0.2
]
〉 and α
~
2
=
〈
[
0.4,0.6
]
,
[
0.1,0.3
]
〉 be two IVIFNs, and w
1
=
0.3
,
w
2
=
0.5. According to (2),
(3)
IVIFW
A
w
(
α
~
1
,
α
~
2
)
=
[
[
0.3
×
0.3
+
0.4
×
0.5
0.3
+
0.5
,
0.6
×
0.3
+
0.6
×
0.6
0.3
+
0.5
]
,
[
(
1
-
0.2
)
×
0.3
+
(
1
-
0.3
)
×
0.5
0.3
+
0.5
,
(
1
-
0.1
)
×
0.3
+
(
1
-
0.1
)
×
0.5
0.3
+
0.5
]
]
=
[
[
0.3625,0.6750
]
,
[
0.7375,0.9000
]
]
=
〈
[
0.3625,0.6750
]
,
[
1
-
0.9000,1
-
0.7375
]
〉
=
〈
[
0.3625,0.6750
]
,
[
0.1000,0.2625
]
〉
.Definition 5 (see [36]).
Letα
~
=
〈
[
a
,
b
]
,
[
c
,
d
]
〉 be an IVIFN, and then an accuracy function L
(
α
~
) can be defined as follows:
(4)
L
(
α
~
)
=
a
+
b
-
d
(
1
-
b
)
-
c
(
1
-
a
)
2
,
where L
(
α
~
)
∈
[
-
1,1
] and 1
≤
i
≤
n.Definition 6 (see [36]).
Letα
~
1 and α
~
2 be two IVIFNs, and then the following comparison method must exist.(1)
IfL
(
α
~
1
)
>
L
(
α
~
2
), then α
~
1
>
α
~
2.
(2)
IfL
(
α
~
1
)
=
L
(
α
~
2
), then α
~
1
=
α
~
2.Example 7.
Letα
~
1
=
〈
[
0.4,0.6
]
,
[
0.1,0.2
]
〉 and α
~
2
=
〈
[
0.5,0.6
]
,
[
0.2,0.3
]
〉 be two IVIFNs. According to (4), L
(
α
~
1
)
=
(
0.4
+
0.6
-
0.2
×
(
1
-
0.6
)
-
0.1
×
(
1
-
0.4
)
)
/
2
=
0.43 and L
(
α
~
2
)
=
0.44. L
(
α
~
2
)
>
L
(
α
~
1
) can be obtained, so the optimal one(s) is α
~
2.Definition 8 (see [37–39]).
A functionT
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-norm if it satisfies the following conditions:(1)
for allx
∈
[
0,1
]
,
T
(
1
,
x
)
=
x;
(2)
for allx
,
y
∈
[
0,1
]
,
T
(
x
,
y
)
=
T
(
y
,
x
);
(3)
for allx
,
y
,
z
∈
[
0,1
]
,
T
(
x
,
T
(
y
,
z
)
)
=
T
(
T
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then T
(
x
,
y
)
≤
T
(
x
′
,
y
′
).Definition 9 (see [37–39]).
A functionS
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-conorm if it satisfies the following conditions:(1)
for allx
∈
[
0,1
]
,
S
(
0
,
x
)
=
x;
(2)
for allx
,
y
∈
[
0,1
]
,
S
(
x
,
y
)
=
S
(
y
,
x
);
(3)
for allx
,
y
,
z
∈
[
0,1
]
,
S
(
x
,
S
(
y
,
z
)
)
=
S
(
S
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then S
(
x
,
y
)
≤
S
(
x
′
,
y
′
).There are some well-known Archimedean t-conorms and t-norms [39, 40].(1)
Letk
(
t
)
=
-
In
⁡
t, l
(
t
)
=
-
In
⁡
(
1
-
t
), k
-
1
(
t
)
=
e
-
t, l
-
1
(
t
)
=
1
-
e
-
t, and then algebraic t-conorms and t-norms are obtained as follows: T
(
x
,
y
)
=
x
y, S
(
x
,
y
)
=
1
-
(
1
-
x
)
(
1
-
y
).
(2)
Letk
(
t
)
=
In
⁡
(
(
2
-
t
)
/
t
), l
(
t
)
=
In
⁡
(
(
2
-
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
2
/
(
e
t
+
1
), l
-
1
(
t
)
=
1
-
(
2
/
(
e
t
+
1
)
), and then Einstein t-conorms and t-norms are obtained as follows: T
(
x
,
y
)
=
x
y
/
(
1
+
(
1
-
x
)
(
1
-
y
)
), S
(
x
,
y
)
=
(
x
+
y
)
/
(
1
+
x
y
).
(3)
Letk
(
t
)
=
In
⁡
(
(
γ
-
(
1
-
γ
)
t
)
/
t
), γ
>
0, l
(
t
)
=
In
⁡
(
(
γ
-
(
1
-
γ
)
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
γ
/
(
e
t
+
γ
-
1
), l
-
1
(
t
)
=
1
-
(
γ
/
(
e
t
+
γ
-
1
)
), and then Hamacher t-conorms and t-norms are obtained as follows:
(5)
T
(
x
,
y
)
=
x
y
γ
+
(
1
-
γ
)
(
x
+
y
-
x
y
)
,
γ
>
0
,
S
(
x
,
y
)
=
x
+
y
-
x
y
-
(
1
-
γ
)
x
y
1
-
(
1
-
γ
)
x
y
,
γ
>
0
.
Based on the Archimedean t-conorms and t-norms, some operations of IVIFSs are discussed as follows.Definition 10.
Letα
~
=
〈
[
a
,
b
]
,
[
c
,
d
]
〉, α
~
1
=
〈
[
a
1
,
b
1
]
,
[
c
1
,
d
1
]
〉, α
~
2
=
〈
[
a
2
,
b
2
]
,
[
c
2
,
d
2
]
〉 be three IVIFNs, λ
≥
0, and then their operations could be defined as follows [19, 41–43]: (1)
α
~
λ
=
〈
[
k
-
1
(
λ
k
(
a
)
)
,
k
-
1
(
λ
k
(
b
)
)
]
,
[
l
-
1
(
λ
l
(
c
)
)
,
l
-
1
(
λ
l
(
d
)
)
]
〉;
(2)
λ
α
~
=
〈
[
l
-
1
(
λ
l
(
a
)
)
,
l
-
1
(
λ
l
(
b
)
)
]
,
[
k
-
1
(
λ
k
(
c
)
), k
-
1
(
λ
k
(
d
)
)
]
〉, λ
>
0;
(3)
α
~
1
⊕
α
~
2
=
〈
[
l
-
1
(
l
(
a
1
)
+
l
(
a
2
)
)
,
l
-
1
(
l
(
b
1
)
+
l
(
b
2
)
)
]
,
[
k
-
1
(
k
(
c
1
)
+
k
(
c
2
)
)
,
k
-
1
(
k
(
d
1
)
+
k
(
d
2
)
)
]
〉;
(4)
a
~
⊗
b
~
=
〈
[
k
-
1
(
k
(
a
1
)
+
k
(
a
2
)
)
,
k
-
1
(
k
(
b
1
)
+
k
(
b
2
)
)
]
,
[
l
-
1
(
l
(
c
1
)
+
l
(
c
2
)
)
,
l
-
1
(
l
(
d
1
)
+
l
(
d
2
)
)
]
〉.Here, l
(
t
)
=
k
(
1
-
t
), and k
:
[
0,1
]
→
[
0
,
∞
) is a strictly decreasing function.


### 2.3. HFSs

Definition 11 (see [44]).
LetX be a universal set, and a HFS on X is in terms of a function that when applied to X will return a subset of [
0,1
], which can be represented as follows:
(6)
E
=
{
〈
x
,
h
E
(
x
)
〉
∣
x
∈
X
}
,
where h
E
(
x
) is a set of values in [
0
,
1
], denoting the possible membership degrees of the element x
∈
X to the set E. h
E
(
x
) is called a hesitant fuzzy element (HFE) [23], and H is the set of all HFEs. It is noteworthy that if X contains only one element, then E is called a hesitant fuzzy number (HFN), briefly denoted by E
=
{
h
E
(
x
)
}. The set of all hesitant fuzzy numbers is represented as HFNS.
Torra [44] defined some operations on HFNs, and Xia and Xu [19, 22] defined some new operations on HFNs and the score function.Definition 12 (see [43]).
Leth
,
h
1, and h
2 be three HFNs, λ
≥
0, and then four operations are defined as follows:(1)
h
λ
=
⋃
γ
∈
h
{
k
-
1
(
λ
k
(
γ
)
)
};
(2)
λ
h
=
⋃
γ
∈
h
{
l
-
1
(
λ
l
(
γ
)
)
};
(3)
h
1
⊕
h
2
=
⋃
γ
1
∈
h
1
,
γ
2
∈
h
2
{
l
-
1
(
l
(
γ
1
)
+
l
(
γ
2
)
)
};
(4)
h
1
⊗
h
2
=
⋃
γ
1
∈
h
1
,
γ
2
∈
h
2
{
k
-
1
(
k
(
γ
1
)
+
k
(
γ
2
)
)
}.Here, l
(
t
)
=
k
(
1
-
t
), and k
:
[
0,1
]
→
[
0
,
∞
) is a strictly decreasing function.Definition 13 (see [19]).
Leth
∈
HFNs, and s
(
h
)
=
(
1
/
#
h
)
∑
γ
∈
h
γ is called the score function of h, where #
h is the number of elements in h. For two HFNs h
1 and h
2, if s
(
h
1
)
>
s
(
h
2
), then h
1
>
h
2; if s
(
h
1
)
=
s
(
h
2
), then h
1
=
h
2.Example 14.
Leth
1
=
{
0.3,0.5,0.6
}
,
h
2
=
{
0.4,0.7
} be two HFNs. According to Definition 13, s
(
h
1
)
=
(
1
/
3
)
×
(
0.3
+
0.5
+
0.6
)
=
0.4667
,
s
(
h
2
)
=
0.55, s
(
h
2
)
>
s
(
h
1
), so h
2
>
h
1.
Furthermore, Torra and Narukawa [18, 44] proposed an aggregation principle for HFEs.Definition 15 (see [18, 44]).
LetE
=
{
h
1
,
h
2
,
…
,
h
n
} be a set of n HFEs, let ϑ be a function on E, and let ϑ
:
[
0,1
]
n
→
[
0,1
], and then
(7)
ϑ
E
=
⋃
γ
∈
h
1
×
h
2
×
⋯
×
h
n
{
ϑ
(
γ
)
}
.


## 2.1. Interval Numbers and Their Operations

Definition 1 (see [32–34]).
Leta
~
=
[
a
L
,
a
U
]
=
{
x
∣
a
L
≤
x
≤
a
U
}; then a
~ is called an interval number. In particular, if 0
≤
a
L
≤
x
≤
a
U, then a
~ is reduced to a positive interval number.
Consider any two interval fuzzy numbersa
~
=
[
a
L
,
a
U
] and b
~
=
[
b
L
,
b
U
], and their operations are defined as follows:(1)
a
~
=
b
~
⇔
a
L
=
b
L
,
a
U
=
b
U;
(2)
a
~
+
b
~
=
[
a
L
+
b
L
,
a
U
+
b
U
];
(3)
a
~
-
b
~
=
[
a
L
-
b
U
,
a
U
-
b
L
];
(4)
a
~
×
b
~
=
[
min
⁡
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}, max
⁡
⁡
{
a
L
b
L
,
a
L
b
U
,
a
U
b
L
,
a
U
b
U
}
];
(5)
k
a
~
=
[
k
a
L
,
k
a
U
]
,
k
>
0.


## 2.2. IVIFSs

Atanassov first proposed IFSs, being enlargement and development of Zadeh’s fuzzy sets. IFSs contain the degree of nonmembership, which makes it possible for us to model unknown information. The definition of IVIFSs given by Atanassov and Gargov [4] is shown as follows.Definition 2 (see [4]).
LetD
[
0,1
] be the set of all closed subintervals of the interval [
0,1
]. Let X be a given set and X
≠
⌀. An IVIFS in X is an expression given by A
=
{
〈
x
,
μ
A
(
x
)
,
ν
A
(
x
)
〉
∣
x
∈
X
}, where μ
A
:
X
→
D
[
0,1
], ν
A
→
D
[
0,1
] with the condition 0
<
su
p
x
μ
A
(
x
)
+
su
p
x
ν
A
(
x
)
≤
1. The intervals μ
A
(
x
) and ν
A
(
x
) denote the degree of belongingness and nonbelongingness of the element x to the set A, respectively. Thus, for each x
∈
X, μ
A
(
x
) and ν
A
(
x
) are closed intervals whose lower and upper boundaries are denoted by μ
A
L
(
x
)
,
μ
A
U
(
x
) and ν
A
L
(
x
)
,
ν
A
U
(
x
), respectively, and then
(1)
A
=
{
〈
x
,
[
μ
A
L
(
x
)
,
μ
A
U
(
x
)
]
,
[
ν
A
L
(
x
)
,
ν
A
U
(
x
)
]
〉
∣
x
∈
X
}
,
where 0
<
μ
A
U
(
x
)
+
ν
A
U
(
x
)
≤
1, μ
A
L
(
x
)
≥
0
,
ν
A
L
(
x
)
≥
0. For each element x, the hesitancy degree can be calculated as follows: Π
A
(
x
)
=
1
-
μ
A
(
x
)
-
ν
A
(
x
)
=
[
1
-
μ
A
U
(
x
)
-
ν
A
U
(
x
)
,
1
-
μ
A
L
(
x
)
-
ν
A
L
(
x
)
]. The set of all IVIFSs in X is denoted by IVIFS(X). An interval-valued intuitionistic fuzzy number (IVIFN) is denoted by A
=
(
[
a
,
b
]
,
[
c
,
d
]
) and the degree of hesitance is denoted by [
e
,
f
]
=
[
1
-
a
-
d
,
1
-
a
-
c
] for convenience.Definition 3 (see [16]).
Letα
~
i
=
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
(
1
≤
i
≤
n
) be a collection of IVIFNs and let w
i
(
1
≤
i
≤
n
) be the crisp values, where α
~
i
=
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
=
[
[
a
i
,
b
i
]
,
[
1
-
d
i
,
1
-
c
i
]
], 0
≤
a
i
≤
b
i
≤
1, 0
≤
c
i
≤
d
i
≤
1, 0
≤
b
i
+
d
i
≤
1, and 1
≤
i
≤
n, and then the interval-valued intuitionistic fuzzy weighted average operator can be defined as follows:
(2)
IVIFW
A
w
(
α
~
1
,
α
~
2
,
…
,
α
~
n
)
=
∑
i
=
1
n
[
[
a
i
,
b
i
]
,
[
1
-
d
i
,
1
-
c
i
]
]
×
w
i
∑
i
=
1
n
w
i
=
[
[
∑
i
=
1
n
a
i
w
i
∑
i
=
1
n
w
i
,
∑
i
=
1
n
b
i
w
i
∑
i
=
1
n
w
i
]
,
=
=
[
∑
i
=
1
n
(
1
-
d
i
)
w
i
∑
i
=
1
n
w
i
,
∑
i
=
1
n
(
1
-
c
i
)
w
i
∑
i
=
1
n
w
i
]
]
=
[
[
a
~
,
b
~
]
,
[
c
~
,
d
~
]
]
,
where IVIFW
A
w
(
α
~
1
,
α
~
2
,
…
,
α
~
n
)
=
[
[
a
~
,
b
~
]
,
[
c
~
,
d
~
]
]
=
〈
[
a
~
,
b
~
]
,
[
1
-
d
~
,
1
-
c
~
]
〉 is an interval-valued intuitionistic fuzzy value;a
~, b
~, c
~, and d
~ are calculated by the Karnik-Mendel algorithms [35].Example 4.
Letα
~
1
=
〈
[
0.3,0.6
]
,
[
0.1,0.2
]
〉 and α
~
2
=
〈
[
0.4,0.6
]
,
[
0.1,0.3
]
〉 be two IVIFNs, and w
1
=
0.3
,
w
2
=
0.5. According to (2),
(3)
IVIFW
A
w
(
α
~
1
,
α
~
2
)
=
[
[
0.3
×
0.3
+
0.4
×
0.5
0.3
+
0.5
,
0.6
×
0.3
+
0.6
×
0.6
0.3
+
0.5
]
,
[
(
1
-
0.2
)
×
0.3
+
(
1
-
0.3
)
×
0.5
0.3
+
0.5
,
(
1
-
0.1
)
×
0.3
+
(
1
-
0.1
)
×
0.5
0.3
+
0.5
]
]
=
[
[
0.3625,0.6750
]
,
[
0.7375,0.9000
]
]
=
〈
[
0.3625,0.6750
]
,
[
1
-
0.9000,1
-
0.7375
]
〉
=
〈
[
0.3625,0.6750
]
,
[
0.1000,0.2625
]
〉
.Definition 5 (see [36]).
Letα
~
=
〈
[
a
,
b
]
,
[
c
,
d
]
〉 be an IVIFN, and then an accuracy function L
(
α
~
) can be defined as follows:
(4)
L
(
α
~
)
=
a
+
b
-
d
(
1
-
b
)
-
c
(
1
-
a
)
2
,
where L
(
α
~
)
∈
[
-
1,1
] and 1
≤
i
≤
n.Definition 6 (see [36]).
Letα
~
1 and α
~
2 be two IVIFNs, and then the following comparison method must exist.(1)
IfL
(
α
~
1
)
>
L
(
α
~
2
), then α
~
1
>
α
~
2.
(2)
IfL
(
α
~
1
)
=
L
(
α
~
2
), then α
~
1
=
α
~
2.Example 7.
Letα
~
1
=
〈
[
0.4,0.6
]
,
[
0.1,0.2
]
〉 and α
~
2
=
〈
[
0.5,0.6
]
,
[
0.2,0.3
]
〉 be two IVIFNs. According to (4), L
(
α
~
1
)
=
(
0.4
+
0.6
-
0.2
×
(
1
-
0.6
)
-
0.1
×
(
1
-
0.4
)
)
/
2
=
0.43 and L
(
α
~
2
)
=
0.44. L
(
α
~
2
)
>
L
(
α
~
1
) can be obtained, so the optimal one(s) is α
~
2.Definition 8 (see [37–39]).
A functionT
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-norm if it satisfies the following conditions:(1)
for allx
∈
[
0,1
]
,
T
(
1
,
x
)
=
x;
(2)
for allx
,
y
∈
[
0,1
]
,
T
(
x
,
y
)
=
T
(
y
,
x
);
(3)
for allx
,
y
,
z
∈
[
0,1
]
,
T
(
x
,
T
(
y
,
z
)
)
=
T
(
T
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then T
(
x
,
y
)
≤
T
(
x
′
,
y
′
).Definition 9 (see [37–39]).
A functionS
:
[
0,1
]
×
[
0,1
]
→
[
0,1
] is called t-conorm if it satisfies the following conditions:(1)
for allx
∈
[
0,1
]
,
S
(
0
,
x
)
=
x;
(2)
for allx
,
y
∈
[
0,1
]
,
S
(
x
,
y
)
=
S
(
y
,
x
);
(3)
for allx
,
y
,
z
∈
[
0,1
]
,
S
(
x
,
S
(
y
,
z
)
)
=
S
(
S
(
x
,
y
)
,
z
);
(4)
ifx
≤
x
′
,
y
≤
y
′, then S
(
x
,
y
)
≤
S
(
x
′
,
y
′
).There are some well-known Archimedean t-conorms and t-norms [39, 40].(1)
Letk
(
t
)
=
-
In
⁡
t, l
(
t
)
=
-
In
⁡
(
1
-
t
), k
-
1
(
t
)
=
e
-
t, l
-
1
(
t
)
=
1
-
e
-
t, and then algebraic t-conorms and t-norms are obtained as follows: T
(
x
,
y
)
=
x
y, S
(
x
,
y
)
=
1
-
(
1
-
x
)
(
1
-
y
).
(2)
Letk
(
t
)
=
In
⁡
(
(
2
-
t
)
/
t
), l
(
t
)
=
In
⁡
(
(
2
-
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
2
/
(
e
t
+
1
), l
-
1
(
t
)
=
1
-
(
2
/
(
e
t
+
1
)
), and then Einstein t-conorms and t-norms are obtained as follows: T
(
x
,
y
)
=
x
y
/
(
1
+
(
1
-
x
)
(
1
-
y
)
), S
(
x
,
y
)
=
(
x
+
y
)
/
(
1
+
x
y
).
(3)
Letk
(
t
)
=
In
⁡
(
(
γ
-
(
1
-
γ
)
t
)
/
t
), γ
>
0, l
(
t
)
=
In
⁡
(
(
γ
-
(
1
-
γ
)
(
1
-
t
)
)
/
(
1
-
t
)
), k
-
1
(
t
)
=
γ
/
(
e
t
+
γ
-
1
), l
-
1
(
t
)
=
1
-
(
γ
/
(
e
t
+
γ
-
1
)
), and then Hamacher t-conorms and t-norms are obtained as follows:
(5)
T
(
x
,
y
)
=
x
y
γ
+
(
1
-
γ
)
(
x
+
y
-
x
y
)
,
γ
>
0
,
S
(
x
,
y
)
=
x
+
y
-
x
y
-
(
1
-
γ
)
x
y
1
-
(
1
-
γ
)
x
y
,
γ
>
0
.
Based on the Archimedean t-conorms and t-norms, some operations of IVIFSs are discussed as follows.Definition 10.
Letα
~
=
〈
[
a
,
b
]
,
[
c
,
d
]
〉, α
~
1
=
〈
[
a
1
,
b
1
]
,
[
c
1
,
d
1
]
〉, α
~
2
=
〈
[
a
2
,
b
2
]
,
[
c
2
,
d
2
]
〉 be three IVIFNs, λ
≥
0, and then their operations could be defined as follows [19, 41–43]: (1)
α
~
λ
=
〈
[
k
-
1
(
λ
k
(
a
)
)
,
k
-
1
(
λ
k
(
b
)
)
]
,
[
l
-
1
(
λ
l
(
c
)
)
,
l
-
1
(
λ
l
(
d
)
)
]
〉;
(2)
λ
α
~
=
〈
[
l
-
1
(
λ
l
(
a
)
)
,
l
-
1
(
λ
l
(
b
)
)
]
,
[
k
-
1
(
λ
k
(
c
)
), k
-
1
(
λ
k
(
d
)
)
]
〉, λ
>
0;
(3)
α
~
1
⊕
α
~
2
=
〈
[
l
-
1
(
l
(
a
1
)
+
l
(
a
2
)
)
,
l
-
1
(
l
(
b
1
)
+
l
(
b
2
)
)
]
,
[
k
-
1
(
k
(
c
1
)
+
k
(
c
2
)
)
,
k
-
1
(
k
(
d
1
)
+
k
(
d
2
)
)
]
〉;
(4)
a
~
⊗
b
~
=
〈
[
k
-
1
(
k
(
a
1
)
+
k
(
a
2
)
)
,
k
-
1
(
k
(
b
1
)
+
k
(
b
2
)
)
]
,
[
l
-
1
(
l
(
c
1
)
+
l
(
c
2
)
)
,
l
-
1
(
l
(
d
1
)
+
l
(
d
2
)
)
]
〉.Here, l
(
t
)
=
k
(
1
-
t
), and k
:
[
0,1
]
→
[
0
,
∞
) is a strictly decreasing function.


## 2.3. HFSs

Definition 11 (see [44]).
LetX be a universal set, and a HFS on X is in terms of a function that when applied to X will return a subset of [
0,1
], which can be represented as follows:
(6)
E
=
{
〈
x
,
h
E
(
x
)
〉
∣
x
∈
X
}
,
where h
E
(
x
) is a set of values in [
0
,
1
], denoting the possible membership degrees of the element x
∈
X to the set E. h
E
(
x
) is called a hesitant fuzzy element (HFE) [23], and H is the set of all HFEs. It is noteworthy that if X contains only one element, then E is called a hesitant fuzzy number (HFN), briefly denoted by E
=
{
h
E
(
x
)
}. The set of all hesitant fuzzy numbers is represented as HFNS.
Torra [44] defined some operations on HFNs, and Xia and Xu [19, 22] defined some new operations on HFNs and the score function.Definition 12 (see [43]).
Leth
,
h
1, and h
2 be three HFNs, λ
≥
0, and then four operations are defined as follows:(1)
h
λ
=
⋃
γ
∈
h
{
k
-
1
(
λ
k
(
γ
)
)
};
(2)
λ
h
=
⋃
γ
∈
h
{
l
-
1
(
λ
l
(
γ
)
)
};
(3)
h
1
⊕
h
2
=
⋃
γ
1
∈
h
1
,
γ
2
∈
h
2
{
l
-
1
(
l
(
γ
1
)
+
l
(
γ
2
)
)
};
(4)
h
1
⊗
h
2
=
⋃
γ
1
∈
h
1
,
γ
2
∈
h
2
{
k
-
1
(
k
(
γ
1
)
+
k
(
γ
2
)
)
}.Here, l
(
t
)
=
k
(
1
-
t
), and k
:
[
0,1
]
→
[
0
,
∞
) is a strictly decreasing function.Definition 13 (see [19]).
Leth
∈
HFNs, and s
(
h
)
=
(
1
/
#
h
)
∑
γ
∈
h
γ is called the score function of h, where #
h is the number of elements in h. For two HFNs h
1 and h
2, if s
(
h
1
)
>
s
(
h
2
), then h
1
>
h
2; if s
(
h
1
)
=
s
(
h
2
), then h
1
=
h
2.Example 14.
Leth
1
=
{
0.3,0.5,0.6
}
,
h
2
=
{
0.4,0.7
} be two HFNs. According to Definition 13, s
(
h
1
)
=
(
1
/
3
)
×
(
0.3
+
0.5
+
0.6
)
=
0.4667
,
s
(
h
2
)
=
0.55, s
(
h
2
)
>
s
(
h
1
), so h
2
>
h
1.
Furthermore, Torra and Narukawa [18, 44] proposed an aggregation principle for HFEs.Definition 15 (see [18, 44]).
LetE
=
{
h
1
,
h
2
,
…
,
h
n
} be a set of n HFEs, let ϑ be a function on E, and let ϑ
:
[
0,1
]
n
→
[
0,1
], and then
(7)
ϑ
E
=
⋃
γ
∈
h
1
×
h
2
×
⋯
×
h
n
{
ϑ
(
γ
)
}
.


## 3. HIVIFSs and Their Operations

HFSs are the extension of traditional fuzzy sets, and their membership degree of an element is a set of several possible values between 0 and 1. In some cases, decision-makers usually cannot estimate criteria values of alternatives with an exact numerical value when the information is not precisely known. Therefore, interval values in fuzzy sets can represent it better than specific numbers, such as IVFSs and IVIFSs. Furthermore, IVIFSs could describe the object being “neither this nor that,” and the membership degree and nonmembership degree of IVIFSs are interval values, respectively. Thus, precise numerical values in HFSs can be replaced by IVIFSs, which are more flexible in the real world, and this is what this section will solve.Definition 16.
Assume thatX is a finite universal set. A HIVIFS A in X is an object in the following form:
(8)
E
=
{
〈
x
,
H
E
(
x
)
〉
∣
x
∈
X
}
,
where H
E
(
x
) is a finite set of values in IVIFSs, denoting the possible membership degrees and nonmembership degrees of the element x
∈
X to the set E.Based on the definition given above,(9)
H
E
(
x
)
=
{
⋃
i
=
1
n
(
H
E
(
x
)
)
〈
[
μ
E
i
L
(
x
)
,
μ
E
i
U
(
x
)
]
,
[
ν
E
i
L
(
x
)
,
ν
E
i
U
(
x
)
]
〉
}
,
where 0
≤
μ
E
1
L
(
x
)
≤
μ
E
1
U
(
x
)
≤
μ
E
2
L
(
x
)
≤
μ
E
2
U
(
x
)
≤
⋯
μ
n
(
H
E
(
x
)
)
L
(
x
)
≤
μ
n
(
H
E
(
x
)
)
U
(
x
)
≤
1, 0
≤
μ
E
i
U
(
x
)
+
ν
E
i
U
(
x
)
≤
1, μ
E
i
L
(
x
)
≥
0, ν
E
i
L
(
x
)
≥
0, and n
(
H
E
(
x
)
)
≥
1. Actually, HIVIFSs have several possible membership degrees taking the form of IVIFSs instead of FSs in HFSs. If n
(
H
E
(
x
)
)
=
1, then the HIVIFS is reduced to an IVIFS; if μ
E
i
L
(
x
)
=
μ
E
i
U
(
x
)
(
i
=
1,2
,
…
,
n
(
H
E
(
x
)
)
) and ν
E
i
L
(
x
)
=
ν
E
i
U
(
x
)
=
0
(
i
=
1,2
,
…
,
n
(
H
E
(
x
)
)
), then the HIVIFS is reduced to a HFS; if μ
E
i
L
(
x
)
=
μ
E
i
U
(
x
)
(
i
=
1,2
,
…
,
n
(
H
E
(
x
)
)
) or ν
E
i
L
(
x
)
=
ν
E
i
U
(
x
)
(
i
=
1,2
,
…
,
n
(
H
E
(
x
)
)
), then the HIVIFS is reduced to a HIVFS; if μ
E
i
L
(
x
)
=
μ
E
i
U
(
x
)
(
i
=
1,2
,
…
,
n
(
H
E
(
x
)
)
) and ν
E
i
L
(
x
)
=
ν
E
i
U
(
x
)
(
i
=
1,2
,
…
,
n
(
H
E
(
x
)
)
), then the HIVIFS is reduced to a HIFS. Furthermore, H
E
(
x
) is called a hesitant interval-valued intuitionistic fuzzy element (HIVIFE), and E is the set of all HIVIFEs. In particular, if X has only one element, 〈
x
,
H
E
(
x
)
〉 is called a hesitant interval-valued intuitionistic fuzzy number (HIVIFN), briefly denoted by
(10)
H
E
=
{
⋃
i
=
1
n
(
H
E
)
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
}
.
The set of all HIVIFNs is denoted by HIVIFNS.Definition 17.
LetA
∈
HIVIFS
(
X
), A
=
{
〈
x
,
H
A
(
x
)
〉
∣
x
∈
X
}, and for all x
∈
X
,
Π
A
(
x
)
=
⋃
i
=
1
n
(
H
A
(
x
)
)
{
[
1
-
μ
A
i
U
(
x
)
-
ν
A
i
U
(
x
)
,
1
-
μ
A
i
L
(
x
)
-
ν
A
i
L
(
x
)
]
}. Then, Π
A
(
x
) is called the hesitant interval-valued intuitionistic index of x.Example 18.
LetX
=
{
x
1
,
x
2
}, and let A
=
{
〈
x
1
,
{
〈
[
0.3,0.4
]
,
[
0.1,0.2
]
〉
,
〈
0.4,0.2
〉
}
〉, 〈
x
2
,
{
〈
[
0.5,0.6
],[
0.2,0.4
]
〉
}
〉
} be a HIVIFS, and then Π
A
(
x
1
)
=
{
[
0.4,0.6
]
,
0.4
}, Π
A
(
x
2
)
=
{
[
0,0.3
]
}. Thus, Π
A
(
x
)
=
{
〈
x
1
,
{
[
0.4,0.6
]
,
0.4
}
〉
,
〈
x
2
,
{
[
0,0.3
]
}
〉
}.The operations of HIVIFNs are defined as follows.Definition 19.
LetH
1
=
{
⋃
i
1
=
1
n
(
H
1
)
〈
[
a
i
1
,
b
i
1
]
,
[
c
i
1
,
d
i
1
]
〉
} and H
2
=
{
⋃
i
2
=
1
n
(
H
2
)
〈
[
a
i
2
,
b
i
2
]
,
[
c
i
2
,
d
i
2
]
〉
} be two HIVIFNs, λ
≥
0, and four operations are defined as follows:(1)
λ
H
1
=
⋃
i
1
=
1
n
(
H
1
)
{
〈
[
l
-
1
(
λ
l
(
a
i
1
)
)
,
l
-
1
(
λ
l
(
b
i
1
)
)
], [
k
-
1
(
λ
k
(
c
i
1
)
)
,
k
-
1
(
λ
k
(
d
i
1
)
)
]
〉
};
(2)
(
H
1
)
λ
=
⋃
i
=
1
n
(
H
1
)
{
〈
[
k
-
1
(
λ
k
(
a
i
1
)
)
,
k
-
1
(
λ
k
(
b
i
1
)
)
], [
l
-
1
(
λ
l
(
c
i
1
)
)
,
l
-
1
(
λ
l
(
d
i
1
)
)
]
〉
};
(3)
H
1
⊕
H
2
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
l
(
a
i
1
)
+
l
(
a
i
2
)
)
,
l
-
1
(
l
(
b
i
1
)
+
l
(
b
i
2
)
)
]
,
[
k
-
1
(
k
(
c
i
1
)
+
k
(
c
i
2
)
)
,
k
-
1
(
k
(
d
i
1
)
+
k
(
d
i
2
)
)
]
〉
};
(4)
H
1
⊗
H
2
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
k
-
1
(
k
(
a
i
1
)
+
k
(
a
i
2
)
)
,
k
-
1
(
k
(
b
i
1
)
+
k
(
b
i
2
)
)
]
,
[
l
-
1
(
l
(
c
i
1
)
+
l
(
c
i
2
)
)
,
l
-
1
(
l
(
d
i
1
)
+
l
(
d
i
2
)
)
]
〉
}.Here, l
(
t
)
=
k
(
1
-
t
), and k
:
[
0,1
]
→
[
0
,
∞
) is a strictly decreasing function.Example 20.
LetH
1
=
{
〈
[
0.1,0.3
]
,
[
0.2,0.4
]
〉
,
〈
[
0.2,0.3
]
,
[
0.3,0.4
]
〉
} and H
2
=
{
〈
[
0.3,0.4
]
,
[
0.2,0.3
]
〉
} be two HIVIFNs, and k
(
x
)
=
-
In
⁡
x
,
k
-
1
(
x
)
=
e
-
x,  l
(
x
)
=
-
In
⁡
(
1
-
x
), l
-
1
(
x
)
=
1
-
e
-
x, and λ
=
2. The following can be calculated:(1)
2
H
1
=
{
〈
[
1
-
e
-
2
(
-
log
⁡
(
1
-
0.1
)
)
,
1
-
e
-
2
(
-
log
⁡
(
1
-
0.3
)
)
]
,
[
e
-
2
(
-
log
⁡
0.2
)
,
e
-
2
(
-
log
⁡
0.4
)
]
〉, 〈
[
1
-
e
-
2
(
-
log
⁡
(
1
-
0.2
)
),1
-
e
-
2
(
-
log
⁡
(
1
-
0.3
)
)
], [
e
-
2
(
-
log
⁡
0.3
)
,
e
-
2
(
-
log
⁡
0.4
)
]
〉
}
=
{
〈
[
0.19,0.51
], [
0.04,0.16
]
〉,〈
[
0.36,0.51
], [
0.09,0.16
]
〉
};
(2)
(
H
1
)
2
=
{
〈
[
0.01,0.09
]
,
[
0.36,0.64
]
〉
,
〈
[
0.04,0.09
],[
0.51,0.64
]
〉
};
(3)
H
1
⊕
H
2
=
{
〈
[
0.37,0.58
]
,
[
0.04,0.12
]
〉
,
〈
[
0.44,0.58
],[
0.06,0.12
]
〉
};
(4)
H
1
⊗
H
2
=
{
〈
[
0.03,0.12
]
,
[
0.36,0.58
]
〉
,
〈
[
0.06,0.12
],[
0.44,0.58
]
〉
}.Theorem 21.
LetH
1
,
H
2
,
H
3
∈
H
I
V
I
F
N
S, λ
,
λ
1
,
λ
2
>
0, and then(1)
H
1
⊕
H
2
=
H
2
⊕
H
1;
(2)
H
1
⊗
H
2
=
H
2
⊗
H
1;
(3)
λ
H
1
⊕
λ
H
2
=
λ
(
H
1
⊕
H
2
);
(4)
(
H
1
)
λ
⊗
(
H
2
)
λ
=
(
H
1
⊗
H
2
)
λ;
(5)
(
H
1
⊕
H
2
)
⊕
H
3
=
H
1
⊕
(
H
2
⊕
H
3
);
(6)
(
H
1
⊗
H
2
)
⊗
H
3
=
H
1
⊗
(
H
2
⊗
H
3
);
(7)
(
(
H
1
)
λ
1
)
λ
2
=
(
H
1
)
λ
1
λ
2.Proof.
According to Definition19, it is clear that (
1
), (
2
), (
5
), and (
6
) are obvious. (
3
), (
4
), and (
7
) will be proved as follows:
(11)
(
3
)
λ
H
1
⊕
λ
H
2
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
λ
l
(
a
i
1
)
+
λ
l
(
a
i
2
)
)
,
22222222222222
l
-
1
(
λ
l
(
b
i
1
)
+
λ
l
(
b
i
2
)
)
]
,
222222222222
[
k
-
1
(
λ
k
(
c
i
1
)
+
λ
k
(
c
i
2
)
)
,
2222222222222
k
-
1
(
λ
k
(
d
i
1
)
+
λ
k
(
d
i
2
)
)
]
〉
}
=
⋃
i
=
1
n
(
H
1
)
⋃
j
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
λ
(
l
(
a
i
1
)
+
l
(
a
i
2
)
)
)
,
22222222222222
l
-
1
(
λ
(
l
(
b
i
1
)
+
l
(
b
i
2
)
)
)
]
,
222222222222
[
k
-
1
(
λ
(
k
(
c
i
1
)
+
k
(
c
i
2
)
)
)
,
22222222222
k
-
1
(
λ
(
k
(
d
i
1
)
+
k
(
d
i
2
)
)
)
]
〉
}
=
λ
(
H
1
⊕
H
2
)
,
(
4
)
(
H
1
)
λ
⊗
(
H
2
)
λ
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
k
-
1
(
λ
k
(
a
i
1
)
+
λ
k
(
a
i
2
)
)
,
222222222222
k
-
1
(
λ
k
(
b
i
1
)
+
λ
k
(
b
i
2
)
)
]
,
222222222222
[
l
-
1
(
λ
l
(
c
i
1
)
+
λ
l
(
c
i
2
)
)
,
22222222222
l
-
1
(
λ
l
(
d
i
1
)
+
λ
l
(
d
i
2
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
k
-
1
(
λ
(
k
(
a
i
1
)
+
k
(
a
i
2
)
)
)
,
222222222222
k
-
1
(
λ
(
k
(
b
i
1
)
+
k
(
b
i
2
)
)
)
]
,
222222222222
[
l
-
1
(
λ
(
l
(
c
i
1
)
+
l
(
c
i
2
)
)
)
,
22222222222
l
-
1
(
λ
(
l
(
d
i
1
)
+
l
(
d
i
2
)
)
)
]
〉
}
=
(
H
1
⊗
H
2
)
λ
,
(
7
)
(
(
H
1
)
λ
1
)
λ
2
=
⋃
i
1
=
1
n
(
H
)
{
〈
[
k
-
1
(
λ
2
k
(
k
-
1
(
λ
1
k
(
a
i
1
)
)
)
)
,
22222222
k
-
1
(
λ
2
k
(
k
-
1
(
λ
1
k
(
b
i
1
)
)
)
)
]
,
22222222
[
l
-
1
(
λ
2
l
(
l
-
1
(
λ
1
l
(
c
i
1
)
)
)
)
,
22222222
l
-
1
(
λ
2
l
(
l
-
1
(
λ
1
l
(
d
i
1
)
)
)
)
]
〉
}
=
⋃
i
=
1
n
(
H
)
{
〈
[
k
-
1
(
λ
2
λ
1
k
(
a
i
1
)
)
,
2222222
k
-
1
(
λ
2
λ
1
k
(
b
i
1
)
)
]
,
2222222
[
l
-
1
(
λ
2
λ
1
l
(
c
i
1
)
)
,
2222222
l
-
1
(
λ
2
λ
1
l
(
d
i
1
)
)
]
〉
}
=
⋃
i
=
1
n
(
H
)
{
〈
[
k
-
1
(
λ
1
λ
2
k
(
a
i
1
)
)
,
2222222
k
-
1
(
λ
1
λ
2
k
(
b
i
1
)
)
]
,
2222222
[
l
-
1
(
λ
1
λ
2
l
(
c
i
1
)
)
,
2222222
l
-
1
(
λ
1
λ
2
l
(
d
i
1
)
)
]
〉
}
=
(
H
1
)
λ
1
λ
2
.
The proof is completed.Based on Definitions5, 6, and 13, the ranking method for HIVIFNs is defined as follows.Definition 22.
LetH
∈
HIVIFNs, S
~
(
H
)
=
(
1
/
#
H
)
∑
γ
∈
H
γ is called the score function of H, where #
H is the number of the interval-valued intuitionistic fuzzy values in H. For two HIVIFNs H
1 and H
2, if S
~
(
H
1
)
>
S
~
(
H
2
), then H
1
>
H
2; if S
~
(
H
1
)
=
S
~
(
H
2
), then H
1
=
H
2.
Note thatS
~
(
H
1
) and S
~
(
H
2
) could be compared by utilizing Definitions 5 and 6.Example 23.
LetH
1
=
{
〈
[
0.3,0.4
]
,
[
0.1,0.2
]
〉
,
〈
[
0.3,0.5
]
,
[
0.2,0.4
]
〉
} and H
2
=
{
〈
[
0.3,0.4
]
,
[
0.2,0.3
]
〉
} be two HIVIFNs, and then
(12)
S
~
(
H
1
)
=
1
2
×
〈
[
0.3
+
0.3,0.4
+
0.5
]
,
[
0.1
+
0.2,0.2
+
0.4
]
〉
=
〈
[
0.30,0.45
]
,
[
0.15,0.30
]
〉
,
S
~
(
H
2
)
=
〈
[
0.3,0.4
]
,
[
0.2,0.3
]
〉
.
According to Definitions 5 and 6,
(13)
L
(
S
~
(
H
1
)
)
=
0.30
+
0.45
-
0.30
×
(
1
-
0.45
)
-
0.15
×
(
1
-
0.30
)
2
=
0.24
,
L
(
S
~
(
H
2
)
)
=
0.3
+
0.4
-
0.3
×
(
1
-
0.4
)
-
0.2
×
(
1
-
0.3
)
2
=
0.19
.
Hence, S
~
(
H
1
)
>
S
~
(
H
2
), which indicates that H
1 is preferred to H
2.


## 4. HIVIFN Aggregation Operators and Their Applications in MCDM Problems

In this section, HIVIFN aggregation operators are proposed, and some properties of these operators are discussed. In particular, some hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators are proposed based on algebraict-conorms and t-norms. Then, how to utilize these operators to MCDM problems is discussed as well.


### 4.1. HIVIFN Aggregation Operators

Definition 24.
LetH
j (j
=
1,2
,
…
,
n) be a collection of HIVIFNs, and HIVIFNWA: HIVIFN
S
n
→
HIVIFNS, and then
(14)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⨁
j
=
1
n
w
j
H
j
.
The HIVIFNWA operator is called the HIVIFN weighted averaging operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 25.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWA operator is also a HIVIFN, and
(15)
H
I
V
I
F
N
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
a
i
j
)
)
,
111111122111211
l
-
1
(
∑
j
=
1
n
w
j
l
(
b
i
j
)
)
]
,
111111122111211
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
c
i
j
)
)
,
111111122111211
k
-
1
(
∑
j
=
1
n
w
j
k
(
d
i
j
)
)
]
〉
}
.Proof.
By using mathematical induction onn, we have the following.(1)
Forn
=
2, since
(16)
w
1
H
1
=
⋃
i
1
=
1
n
(
H
1
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
)
,
l
-
1
(
w
1
l
(
b
i
1
)
)
]
,
1111111
[
k
-
1
(
w
1
k
(
c
i
1
)
)
,
k
-
1
(
w
1
k
(
d
i
1
)
)
]
〉
}
,
w
2
H
2
=
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
w
2
l
(
a
i
2
)
)
,
l
-
1
(
w
2
l
(
b
i
2
)
)
]
,
1111111
[
k
-
1
(
w
2
k
(
c
i
2
)
)
,
k
-
1
(
w
2
k
(
d
i
2
)
)
]
〉
}
,the following can be obtained:
(17)
HIVIFNW
A
w
(
H
1
,
H
2
)
=
w
1
H
1
⊕
w
2
H
2
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
)
,
222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
)
]
,
22222222222
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
)
,
222222222222
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
)
]
〉
}
.
(
2
) If (15) holds for n
=
k, then
(18)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
k
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
k
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
+
⋯
w
k
l
(
a
i
k
)
)
,


22222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
+
⋯
+
w
k
l
(
b
i
k
)
)
]
,




22222221111111
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
+
⋯
w
k
k
(
c
i
k
)
)
,




22222221111111
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
2222222222222222222
+
⋯
w
k
k
(
d
i
k
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
k
)
{
〈
[
l
-
1
(
∑
j
=
1
k
w
j
l
(
a
i
j
)
)
,
222222222222222222
l
-
1
(
∑
j
=
1
k
w
j
l
(
b
i
j
)
)
]
,
1111111221112111
[
k
-
1
(
∑
j
=
1
k
w
j
k
(
c
i
j
)
)
,
22222222222222222
k
-
1
(
∑
j
=
1
k
w
j
k
(
d
i
j
)
)
]
〉
}
.
Whenn
=
k
+
1, in terms of (1) and (3) in Definition 19,
(19)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
k
,
H
k
+
1
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
k
)
⋃
i
k
+
1
=
1
n
(
H
k
+
1
)
{
〈
[
l
-
1
(
l
(
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
l
(
a
i
k
)
)
)
22222222222222222222222
+
w
k
+
1
l
(
a
i
k
+
1
)
)
,
22222222222222222222
l
-
1
(
l
(
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
l
(
b
i
k
)
)
)
22222222222222222222222
+
w
k
+
1
l
(
μ
b
i
k
+
1
)
)
]
,
333333333333333333
[
k
-
1
(
k
(
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
k
(
c
i
k
)
)
)
2222222222222222222222
+
w
k
+
1
k
(
c
i
k
+
1
)
)
,
2222222222222222222
k
-
1
(
k
(
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
k
(
d
i
k
)
)
)
22222222222222222222222
+
w
k
+
1
k
(
d
i
k
+
1
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
+
1
=
1
n
(
H
k
+
1
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
+
⋯
+
2222222222222222222
w
k
l
(
a
i
k
)
+
w
k
+
1
l
(
a
i
k
+
1
)
)
,
2222222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
+
⋯
+
22222222222222222
w
k
l
(
b
i
k
)
+
w
k
+
1
l
(
b
i
k
+
1
)
)
]
,
2222222222222222
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
+
⋯
+
222222222222222222
w
k
k
(
c
i
k
)
+
w
k
+
1
k
(
c
i
k
+
1
)
)
,
2222222222222222
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
+
⋯
+
222222222222222222
w
k
k
(
d
i
k
)
+
w
k
+
1
k
(
d
i
k
+
1
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
+
1
=
1
n
(
H
k
+
1
)
{
〈
[
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
a
i
j
)
)
,
22222222222212222
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
b
i
j
)
)
]
,
1111111221111111
[
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
c
i
j
)
)
,
22222222222212222
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
d
i
j
)
)
]
〉
}
,
that is, (15) holds for n
=
k
+
1; thus, (15) holds for all n. Then,
(20)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
+
⋯
w
n
l
(
a
i
n
)
)
,
22222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
+
⋯
+
w
n
l
(
b
i
n
)
)
]
,
22222221111111
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
+
⋯
w
n
k
(
c
i
n
)
)
,
22222221111111
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
2222222222222222222
+
⋯
w
n
k
(
d
i
n
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
a
i
j
)
)
,
22222222222212222
l
-
1
(
∑
j
=
1
n
w
j
l
(
b
i
j
)
)
]
,
1111111221111111
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
c
i
j
)
)
,
22222222222212222
k
-
1
(
∑
j
=
1
n
w
j
k
(
d
i
j
)
)
]
〉
}
.Definition 26.
LetH
j
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, HIVIFNWG: HIVIFN
S
n
→
HIVIFNS, and then
(21)
HIVIFNW
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⨂
j
=
1
n
(
H
j
)
w
j
.
The HIVIFNWG operator is called the HIVIFN weighted geometric operator of dimension n, and w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Similarly, the following theorems can be obtained.Theorem 27.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWG operator is also a HIVIFN, and
(22)
H
I
V
I
F
N
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
a
i
j
)
)
,
22222222222222
k
-
1
(
∑
j
=
1
n
w
j
k
(
b
i
j
)
)
]
,
11111112211111
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
c
i
j
)
)
,
222222222222222
l
-
1
(
∑
j
=
1
n
w
j
l
(
d
i
j
)
)
]
〉
}
.Definition 28.
LetH
j
(
j
=
1,2
,
…
,
n) be a collection of HIVIFNs, HIVIFNWAA: HIVIFN
S
n
→
HIVIFNS, and then
(23)
HIVIFNWA
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
(
⨁
j
=
1
n
w
j
(
H
j
)
2
)
1
/
2
.
The HIVIFNWAA operator is called the HIVIFN weighted arithmetic averaging operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 29.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWAA operator is also a HIVIFN, and(24)
H
I
V
I
F
N
W
A
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
a
i
j
)
)
)
)
)
)
,
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
c
i
j
)
)
)
)
)
)
,
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
.Definition 30.
LetH
j
(
j
=
1,2
,
…
,
n) be a collection of HIVIFNs, HIVIFNWAG: HIVIFN
S
n
→
HIVIFNS, and then
(25)
HIVIFNWA
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
1
2
(
⨂
j
=
1
n
(
2
H
j
)
w
j
)
.
The HIVIFNWAG operator is called the HIVIFN weighted arithmetic geometric operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 31.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWAG operator is also a HIVIFN, and(26)
H
I
V
I
F
N
W
A
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
a
i
j
)
)
)
)
)
)
,
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
c
i
j
)
)
)
)
)
)
,
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
d
i
j
)
)
)
)
)
)
]
〉
}
.Definition 32.
LetH
j
(
j
=
1,2
,
…
,
n) be a collection of HIVIFNs, GHIVIFNWA: HIVIFN
S
n
→
HIVIFNS, and then
(27)
GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
(
⨁
j
=
1
n
w
j
(
H
j
)
λ
)
1
/
λ
.
The GHIVIFNWA operator is called the generalized HIVIFN weighted averaging operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. If λ
=
1, the GHIVIFNWA operator is reduced to the HIVIFNWA operator. If λ
=
2, the GHIVIFNWA operator is reduced to the HIVIFNWAA operator.Theorem 33.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0  (
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the GHIVIFNWA operator is also a HIVIFN, and(28)
G
H
I
V
I
F
N
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
.Definition 34.
LetH
j (j
=
1,2
,
…
,
n) be a collection of HIVIFNs, GHIVIFNWG: HIVIFN
S
n
→
HIVIFNS, and then
(29)
GHIVIFNW
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
1
λ
(
⨂
j
=
1
n
(
λ
H
j
)
w
j
)
.
The GHIVIFNWG operator is called the generalized HIVIFN weighted geometric operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. If λ
=
1, the GHIVIFNWG operator is reduced to the HIVIFNWG operator. If λ
=
2, then the GHIVIFNWG operator is reduced to the HIVIFNWAG operator.Theorem 35.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0  (
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the GHIVIFNWG operator is also a HIVIFN, and(30)
G
H
I
V
I
F
N
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
a
i
j
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
c
i
j
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
v
H
j
L
d
i
j
)
)
)
)
)
)
]
〉
}
.Note that Theorems27–35 could be proved by using the mathematical induction method and are omitted here.Based on these hesitant interval-valued intuitionistic fuzzy aggregation operators, it is easy to obtain the following properties.Property 1 (idempotency).
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs. If H
j
=
H
=
{
⋃
i
=
1
n
(
H
)
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
} for all i
=
1,2
,
…
,
n, then
(31)
GHIVIFNWA
(
H
1
,
H
2
,
…
,
H
n
)
=
H
,
GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
)
=
H
.Proof.
According to Theorem33 and H
j
=
H
=
{
⋃
i
=
1
n
(
H
)
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
} for all i
=
1,2
,
…
,
n,(32)
GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
)
⋯
⋃
i
=
1
n
(
H
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
)
)
)
)
)
)
]
〉
}
.Since ∑
j
=
1
n
w
j
=
1,
(33)
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
)
)
=
k
-
1
(
1
λ
k
(
l
-
1
(
l
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
)
)
=
k
-
1
(
1
λ
k
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
=
k
-
1
(
1
λ
(
λ
k
(
a
i
)
)
)
=
k
-
1
(
1
λ
λ
k
(
a
i
)
)
=
k
-
1
(
k
(
a
i
)
)
=
a
i
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
)
)
)
)
)
)
=
b
i
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
)
)
)
)
)
)
=
c
i
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
)
)
)
)
)
)
=
d
i
.
Hence, GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
=
1
n
(
H
)
{
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
}
=
H.
Similarly,GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
)
=
H.Property 2 (commutativity).
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let H
~
j
=
{
⋃
i
j
=
1
n
(
H
~
j
)
〈
[
a
~
i
j
,
b
~
i
j
]
,
[
c
~
i
j
,
d
~
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be any permutation of H
j, and then
(34)
GHIVIFNWA
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
=
GHIVIFNWA
(
H
1
,
H
2
,
…
,
H
n
)
,
GHIVIFNWG
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
=
GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
)
.Proof.
SinceH
~
j
=
{
⋃
i
j
=
1
n
(
H
~
j
)
〈
[
a
~
i
j
,
b
~
i
j
]
,
[
c
~
i
j
,
d
~
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) is any permutation of H
j,(35)
GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
~
1
)
⋃
i
2
=
1
n
(
H
2
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
a
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
1111111111221111111111
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222221122222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
c
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
222222222222211222221
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
d
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
,
=
⋃
i
1
=
1
n
(
H
~
1
)
⋃
i
2
=
1
n
(
H
~
2
)
⋃
i
3
=
1
n
(
H
3
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
a
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
a
~
i
2
)
)
)
+
∑
j
=
2
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
1111111111112221111
222222
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222111222222222221
[
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
c
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
c
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
222222222111222222222222
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
d
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
d
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}




=
⋯
=
⋃
i
1
=
1
n
(
H
~
1
)
⋯
⋃
i
n
=
1
n
(
H
~
n
)
{
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
a
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
a
~
i
2
)
)
)
+
⋯
+
w
n
l
(
k
-
1
(
λ
k
(
a
~
i
n
)
)
)
)
)
)
,
222222222112222222221
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
⋯
+
w
n
l
(
k
-
1
(
λ
k
(
b
~
i
n
)
)
)
)
)
)
]
,
222222222112222222221
[
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
c
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
c
~
i
2
)
)
)
+
⋯
+
w
n
k
(
l
-
1
(
λ
l
(
c
~
i
n
)
)
)
)
)
)
,
222222222112222222221
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
d
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
d
~
i
2
)
)
)
+
⋯
+
w
n
k
(
l
-
1
(
λ
l
(
d
~
i
n
)
)
)
)
)
)
]
〉
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
}
=
GHIVIFNW
A
w
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
.
Similarly,GHIVIFNWG
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
=
GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
).Property 3 (boundary).
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, and then
(36)
H
-
≤
GHIVIFAWA
(
H
1
,
H
2
,
…
,
H
n
)
≤
H
+
,
H
-
≤
GHIVIFAWG
(
H
1
,
H
2
,
…
,
H
n
)
≤
H
+
,
where H
-
=
{
(
[
0,0
]
,
[
1,1
]
)
} and H
+
=
{
(
[
1,1
]
,
[
0,0
]
)
}.Proof.
The process is omitted here.


### 4.2. HIVIFN Algebraic Aggregation Operators and HIVIFN Einstein Aggregation Operators

Obviously, differentt-conorms and t-norms may lead to different aggregation operators. In the following, HIVIFN algebraic aggregation operators and Einstein aggregation operators are presented based on algebraic norms and Einstein norms.Theorem 36.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, let w
=
(
w
1
,
w
2
,
…
,
w
n
)
T be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0
(
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1, k
(
x
)
=
-
ln
⁡
(
x
), and k
-
1
(
x
)
=
e
-
x
,
l
(
x
)
=
-
ln
⁡
(
1
-
x
)
,
l
-
1
(
x
)
=
1
-
e
-
x
,
T
(
x
,
y
)
=
x
y, and S
(
x
,
y
)
=
1
-
(
(
1
-
x
)
(
1
-
y
)
) be algebraic t-conorm and t-norm. Then, some HIVIFN algebraic aggregation operators could be obtained as follows.
(1) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted averaging operator is as follows:(37)
H
I
V
I
F
N
A
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
1
-
∏
j
=
1
n
(
1
-
a
i
j
)
w
j
,
1
-
∏
j
=
1
n
(
1
-
b
i
j
)
w
j
]
,



0000000000000000
[
∏
j
=
1
n
(
c
i
j
)
w
j
,
∏
j
=
1
n
(
d
i
j
)
w
j
]
〉
}
.
(2) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted geometric operator is as follows:(38)
H
I
V
I
F
N
A
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
∏
j
=
1
n
(
a
i
j
)
w
j
,
∏
j
=
1
n
(
b
i
j
)
w
j
]
,
0000000000000000
[
1
-
∏
j
=
1
n
(
1
-
c
i
j
)
w
j
,
00000000000000000
1
-
∏
j
=
1
n
(
1
-
d
i
j
)
w
j
]
〉
}
.
(3) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted arithmetic averaging operator is as follows:(39)
H
I
V
I
F
N
A
W
A
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
(
1
-
∏
j
=
1
n
(
1
-
(
a
i
j
)
2
)
w
j
)
1
/
2
,
(
1
-
∏
j
=
1
n
(
1
-
(
b
i
j
)
2
)
w
j
)
1
/
2
]
,
22
222222222222222
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
c
i
j
)
2
)
w
j
)
1
/
2
,
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
d
i
j
)
2
)
w
j
)
1
/
2
]
〉
}
.
(4) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted arithmetic geometric operator is as follows:(40)
H
I
V
I
F
N
A
W
A
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
a
i
j
)
2
)
w
j
)
1
/
2
,
00000000000000001
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
b
i
j
)
2
)
w
j
)
1
/
2
]
,
00000000000000001
[
(
1
-
∏
j
=
1
n
(
1
-
(
c
i
j
)
2
)
w
j
)
1
/
2
,
000000000000000101
(
1
-
∏
j
=
1
n
(
1
-
(
d
i
j
)
2
)
w
j
)
1
/
2
]
〉
}
.
(5) Generalized hesitant interval-valued intuitionistic fuzzy number algebraic weighted averaging operator is as follows:(41)
G
H
I
V
I
F
N
A
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
a
i
j
)
λ
)
w
j
)
1
/
λ
,
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
b
i
j
)
λ
)
w
j
)
1
/
λ
]
,
00000000000000001
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
c
i
j
)
λ
)
w
j
)
1
/
λ
,
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
d
i
j
)
λ
)
w
j
)
1
/
λ
]
〉
}
.
(6) Generalized hesitant interval-valued intuitionistic fuzzy number algebraic weighted geometric operator is as follows:(42)
G
H
I
V
I
F
N
A
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
a
i
j
)
λ
)
w
j
)
1
/
λ
,
00000000000000001
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
b
i
j
)
λ
)
w
j
)
1
/
λ
]
,
00000000000000001
[
(
1
-
∏
j
=
1
n
(
1
-
(
c
i
j
)
λ
)
w
j
)
1
/
λ
,
00000000000000001
(
1
-
∏
j
=
1
n
(
1
-
(
d
i
j
)
λ
)
w
j
)
1
/
λ
]
〉
}
.
In particular, if λ
=
1, then (41) is reduced to (37) and (42) is reduced to (38); if λ
=
2, then (41) is reduced to (39) and (42) is reduced to (40).Example 37.
LetH
1
=
{
〈
[
0.2,0.3
]
,
[
0.1,0.2
]
〉
,
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
〉
} and H
2
=
{
〈
[
0.1,0.3
]
,
[
0.2,0.4
]
〉
} be two HIVIFNs, and let w
=
(
0.4,0.6
) be the weight of them, and λ
=
1,2
,
5. According to Theorem 36, the following can be calculated:
(
1
)  HIVIFNAW
A
w
(
H
1
,
H
2
)
=
{
〈
[
1
-
(
1
-
0.2
)
0.4
×
(
1
-
0.1
)
0.6
,
1
-
(
1
-
0.3
)
0.4
×
(
1
-
0.3
)
0.6
]
,
[
0
.
1
0.4
×
0
.
2
0.6
,
0
.
2
0.4
×
0
.
4
0.6
]
,
[
1
-
(
1
-
0.4
)
0.4
×
(
1
-
0.1
)
0.6
,
1
-
(
1
-
0.5
)
0.4
×
(
1
-
0.3
)
0.6
]
,
[
0
.
2
0.4
×
0
.
2
0.6
,
0
.
3
0.4
×
0
.
4
0.6
]
〉
}
=
{
〈
[
0.1414,0.3000
]
,
[
0.1516,0.3031
]
〉
,
〈
[
0.2347,0.3881
],[
0.2000,0.3565
]
〉
}, Consider
(43)
HIVIFNAW
G
w
(
H
1
,
H
2
)
=
{
〈
[
0.1320,0.3000
]
,
[
0.1614,0.3268
]
〉
,
222
〈
[
0.1741,0.3680
]
,
[
0.2000,0.3618
]
〉
}
.
According to Definitions 24, 6, and 8, Consider the following:
(44)
S
~
(
HIVIFNAW
A
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1881,0.3441
]
,
[
0.1758,0.3298
]
〉
}
,
S
~
(
HIVIFNAW
G
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1531,0.3340
]
,
[
0.1807,0.3443
]
〉
}
.
L
(
S
~
(
HIVIFNAW
A
w
(
H
1
,
H
2
)
)
)
=
0.0866
,
L
(
S
~
(
HIVIFNAW
G
w
(
H
1
,
H
2
)
)
)
=
0.0524. Thus,
(45)
HIVIFNAW
A
w
(
H
1
,
H
2
)
>
HIVIFNAW
G
w
(
H
1
,
H
2
)
.
(
2
)  HIVIFNAWA
A
w
(
H
1
,
H
2
)
=
{
〈
[
0.1487,0.3000
]
,
[
0.1508,0.2989
]
〉
,
〈
[
0.2701,0.3972
],[
0.2000,0.3554
]
〉
};
(46)
HIVIFNAWA
G
w
(
H
1
,
H
2
)
=
{
〈
[
0.1313,0.3000
]
,
[
0.1677,0.3375
]
〉
,
222
〈
[
0.1686,0.3637
]
,
[
0.2000,0.3642
]
〉
}
.
According to Definitions 22, 5, and 6, Consider the following:
(47)
S
~
(
HIVIFNAWA
A
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.2094,0.3486
]
,
[
0.1754,0.3272
]
〉
}
,
S
~
(
HIVIFNAWA
G
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1500,0.3319
]
,
[
0.1839,0.3509
]
〉
}
.
Consider L
(
S
~
(
HIVIFNAWA
A
w
(
H
1
,
H
2
)
)
)
=
0.1031
,
L
(
S
~
(
HIVIFNAWA
G
w
(
H
1
,
H
2
)
)
)
=
0.0456. Thus,
(48)
HIVIFNAWA
A
w
(
H
1
,
H
2
)
>
HIVIFNAWA
G
w
(
H
1
,
H
2
)
.
(
3
)  GHIVIFNAW
A
w
(
H
1
,
H
2
)
=
{
〈
[
0.1680,0.3000
]
,
[
0.1481,0.2847
]
〉
,
〈
[
0.3333,0.4262
],[
0.2000,0.3512
]
〉
};
(49)
GHIVIFNAW
G
w
(
H
1
,
H
2
)
=
{
〈
[
0.1292,0.3000
]
,
[
0.1813,0.3628
]
〉
,
222
〈
[
0.1540,0.3502
]
,
[
0.2000,0.3720
]
〉
}
.
According to Definitions 22, 5, and 6,
(50)
S
~
(
GHIVIFNAW
A
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.2507,0.3631
]
,
[
0.1741,0.3180
]
〉
}
,
S
~
(
GHIVIFNAW
G
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1416,0.3251
]
,
[
0.1907,0.3674
]
〉
}
.
Consider L
(
S
~
(
GHIVIFNAW
A
w
(
H
1
,
H
2
)
)
)
=
0.1404
,
L
(
S
~
(
GHIVIFNAW
G
w
(
H
1
,
H
2
)
)
)
=
0.0459. Thus,
(51)
GHIVIFNAW
A
w
(
H
1
,
H
2
)
>
GHIVIFNAW
G
w
(
H
1
,
H
2
)
.
In the three cases listed above, the aggregation results by using the GHIVIFNAWA operator are greater than the aggregation results by utilizing the GHIVIFNAWG operator.Theorem 38.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, and let w
=
(
w
1
,
w
2
,
…
,
w
n
)
T be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0  (
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1, k
(
x
)
=
ln
⁡
(
(
2
-
x
)
/
x
), and k
-
1
(
x
)
=
2
/
(
e
x
+
1
), l
(
x
)
=
ln
⁡
(
(
2
-
(
1
-
x
)
)
/
(
1
-
x
)
), l
-
1
(
x
)
=
1
-
(
2
/
(
e
x
+
1
)
),T
(
x
,
y
)
=
x
y
/
(
1
+
(
1
-
x
)
(
1
-
y
)
), and S
(
x
,
y
)
=
(
x
+
y
)
/
(
1
+
x
y
) be the Einstein t-conorm and t-norm, respectively. Then, some HIVIFN Einstein aggregation operators could be obtained as follows.
(
1
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted averaging operator is as follows:
(52)
H
I
V
I
F
N
E
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
∏
j
=
1
n
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
w
j
+
1
,
33333333333323
∏
j
=
1
n
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
w
j
+
1
]
,
33333333333333
[
2
∏
j
=
1
n
(
(
2
-
c
i
j
)
/
c
i
j
)
w
j
+
1
,
33333333333323
2
2
∏
j
=
1
n
(
(
2
-
d
i
j
)
/
d
i
j
)
w
j
+
1
]
}
.
(
2
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted geometric operator is as follows:
(53)
H
I
V
I
F
N
E
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
2
∏
j
=
1
n
(
(
2
-
a
i
j
)
/
a
i
j
)
w
j
+
1
,
2222222222222222
2
∏
j
=
1
n
(
(
2
-
b
i
j
)
/
b
i
j
)
w
j
+
1
]
,
222222222222222
[
∏
j
=
1
n
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
w
j
+
1
,
2222222222222222
∏
j
=
1
n
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
w
j
+
1
]
}
.
(
3
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted arithmetic averaging operator is as follows:(54)
H
I
V
I
F
N
E
W
A
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
2
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
2
+
1
]
,
222222222222222
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
2
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
2
+
1
]
}
,where
(55)
α
i
j
=
(
a
i
j
2
-
a
i
j
+
1
1
-
a
i
j
)
,
β
i
j
=
(
b
i
j
2
-
b
i
j
+
1
1
-
b
i
j
)
,
μ
i
j
=
(
c
i
j
2
-
c
i
j
+
1
c
i
j
)
,
ν
i
j
=
(
d
i
j
2
-
d
i
j
+
1
d
i
j
)
.
(
4
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted arithmetic geometric operator is as follows:(56)
H
I
V
I
F
N
E
W
A
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
2
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
2
+
1
]
,
222222222222222
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
2
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
2
+
1
]
}
,where
(57)
μ
i
j
=
(
a
i
j
2
-
a
i
j
+
1
a
i
j
)
,
ν
i
j
=
(
b
i
j
2
-
b
i
j
+
1
b
i
j
)
,
α
i
j
=
(
c
i
j
2
-
c
i
j
+
1
1
-
c
i
j
)
,
β
i
j
=
(
d
i
j
2
-
d
i
j
+
1
1
-
d
i
j
)
.
(
5
) Generalized hesitant interval-valued intuitionistic fuzzy number Einstein weighted averaging operator is as follows:(58)
G
H
I
V
I
F
N
E
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
,
222222222222222
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
}
,where
(59)
α
i
j
=
(
1
+
(
2
/
(
(
(
2
-
a
i
j
)
/
a
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
a
i
j
)
/
a
i
j
)
λ
+
1
)
)
)
,
β
i
j
=
(
1
+
(
2
/
(
(
(
2
-
b
i
j
)
/
b
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
b
i
j
)
/
b
i
j
)
λ
+
1
)
)
)
,
μ
i
j
=
(
1
+
(
2
/
(
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
λ
+
1
)
)
)
,
ν
i
j
=
(
1
+
(
2
/
(
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
λ
+
1
)
)
)
.
(
6
) Generalized hesitant interval-valued intuitionistic fuzzy number Einstein weighted geometric operator is as follows:(60)
G
H
I
V
I
F
N
E
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
,
222222222222222
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
}
,where
(61)
μ
i
j
=
(
1
+
(
2
/
(
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
λ
+
1
)
)
)
,
ν
i
j
=
(
1
+
(
2
/
(
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
λ
+
1
)
)
)
,
α
i
j
=
(
1
+
(
2
/
(
(
(
2
-
c
i
j
)
/
c
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
c
i
j
)
/
c
i
j
)
λ
+
1
)
)
)
,
β
i
j
=
(
1
+
(
2
/
(
(
(
2
-
d
i
j
)
/
d
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
d
i
j
)
/
d
i
j
)
λ
+
1
)
)
)
.
In particular, if λ
=
1, then (58) is reduced to (52) and (60) is reduced to (53); if λ
=
2, then (58) is reduced to (54) and (60) is reduced to (56).


### 4.3. The MCDM Approach Based on the GHIVIFNWA and GHIVIFNWG Operators

LetA
=
{
a
1
,
a
2
,
…,a
m
} be a finite set of alternatives, and let C
=
{
c
1
,
c
2
,
…,c
n
} be a finite set of criteria, whose criteria weight vector is w
=
(
w
1
,
w
2
,
…
,
w
n
), where w
j
≥
0 (j
=
1,2
,
…
,
n), ∑
j
=
1
n
w
j
=
1. Let R
=
(
α
~
i
j
)
m
×
n be the hesitant interval-valued intuitionistic fuzzy decision matrix, where α
~
i
j is a criterion value, denoted by HIVIFNs. The characteristics of the alternatives a
i
(
i
=
1,2
,
…
,
m
) with respect to the attributes c
j
(
j
=
1,2
,
…
,
n
) can be denoted by α
~
i
j
=
{
⋃
r
=
1
n
(
α
~
i
j
)
〈
[
a
α
~
i
j
r
,
b
α
~
i
j
r
]
,
[
c
α
~
i
j
r
,
d
α
~
i
j
r
]
〉
}. In the following, we propose one approach to rank and select the most desirable alternative(s). The procedure of this approach is shown as follows.Step 1.
Aggregate the HIVIFNsα
~
i
j
(
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
n
) of the alternative a
i
(
i
=
1,2
,
…
,
m
).
Utilize the GHIVIFNWA or GHIVIFNWG operator to obtain the overall valuesy
i for the alternatives a
i (i
=
1,2
,
…
,
m), respectively; that is,(62)
y
i
=
GHIVIFNW
A
w
(
α
~
i
1
,
α
~
i
2
,
…
,
α
~
i
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
r
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
r
)
)
)
)
)
)
]
,
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
1
=
1
n
(
H
1
)
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
r
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
r
)
)
)
)
)
)
]
〉
}
or
(63)
y
i
=
GHIVIFNW
G
w
(
α
~
i
1
,
α
~
i
2
,
…
,
α
~
i
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
a
i
j
r
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
b
i
j
r
)
)
)
)
)
)
]
,
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
1
=
1
n
(
H
1
)
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
c
i
j
r
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
d
i
j
r
)
)
)
)
)
)
]
〉
}
.Step 2.
Calculate the score values. According to Definition22, the score of overall values S
~
(
y
i
) (i
=
1,2
,
…
,
m) could be calculated.Step 3.
Rank the preference order of all alternativesa
i (i
=
1,2
,
…
,
m). L
(
S
~
(
y
i
)
)
(
i
=
1,2
,
…
,
m
) could be obtained according to Definition 5. The greater the value of L
(
S
~
(
y
i
)
) is, the better the alternative a
i
(
i
=
1,2
,
…
,
m
) will be.Step 4.
Select the optimal one(s).


## 4.1. HIVIFN Aggregation Operators

Definition 24.
LetH
j (j
=
1,2
,
…
,
n) be a collection of HIVIFNs, and HIVIFNWA: HIVIFN
S
n
→
HIVIFNS, and then
(14)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⨁
j
=
1
n
w
j
H
j
.
The HIVIFNWA operator is called the HIVIFN weighted averaging operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 25.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWA operator is also a HIVIFN, and
(15)
H
I
V
I
F
N
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
a
i
j
)
)
,
111111122111211
l
-
1
(
∑
j
=
1
n
w
j
l
(
b
i
j
)
)
]
,
111111122111211
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
c
i
j
)
)
,
111111122111211
k
-
1
(
∑
j
=
1
n
w
j
k
(
d
i
j
)
)
]
〉
}
.Proof.
By using mathematical induction onn, we have the following.(1)
Forn
=
2, since
(16)
w
1
H
1
=
⋃
i
1
=
1
n
(
H
1
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
)
,
l
-
1
(
w
1
l
(
b
i
1
)
)
]
,
1111111
[
k
-
1
(
w
1
k
(
c
i
1
)
)
,
k
-
1
(
w
1
k
(
d
i
1
)
)
]
〉
}
,
w
2
H
2
=
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
w
2
l
(
a
i
2
)
)
,
l
-
1
(
w
2
l
(
b
i
2
)
)
]
,
1111111
[
k
-
1
(
w
2
k
(
c
i
2
)
)
,
k
-
1
(
w
2
k
(
d
i
2
)
)
]
〉
}
,the following can be obtained:
(17)
HIVIFNW
A
w
(
H
1
,
H
2
)
=
w
1
H
1
⊕
w
2
H
2
=
⋃
i
1
=
1
n
(
H
1
)
⋃
i
2
=
1
n
(
H
2
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
)
,
222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
)
]
,
22222222222
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
)
,
222222222222
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
)
]
〉
}
.
(
2
) If (15) holds for n
=
k, then
(18)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
k
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
k
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
+
⋯
w
k
l
(
a
i
k
)
)
,


22222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
+
⋯
+
w
k
l
(
b
i
k
)
)
]
,




22222221111111
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
+
⋯
w
k
k
(
c
i
k
)
)
,




22222221111111
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
2222222222222222222
+
⋯
w
k
k
(
d
i
k
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
k
)
{
〈
[
l
-
1
(
∑
j
=
1
k
w
j
l
(
a
i
j
)
)
,
222222222222222222
l
-
1
(
∑
j
=
1
k
w
j
l
(
b
i
j
)
)
]
,
1111111221112111
[
k
-
1
(
∑
j
=
1
k
w
j
k
(
c
i
j
)
)
,
22222222222222222
k
-
1
(
∑
j
=
1
k
w
j
k
(
d
i
j
)
)
]
〉
}
.
Whenn
=
k
+
1, in terms of (1) and (3) in Definition 19,
(19)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
k
,
H
k
+
1
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
k
)
⋃
i
k
+
1
=
1
n
(
H
k
+
1
)
{
〈
[
l
-
1
(
l
(
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
l
(
a
i
k
)
)
)
22222222222222222222222
+
w
k
+
1
l
(
a
i
k
+
1
)
)
,
22222222222222222222
l
-
1
(
l
(
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
l
(
b
i
k
)
)
)
22222222222222222222222
+
w
k
+
1
l
(
μ
b
i
k
+
1
)
)
]
,
333333333333333333
[
k
-
1
(
k
(
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
k
(
c
i
k
)
)
)
2222222222222222222222
+
w
k
+
1
k
(
c
i
k
+
1
)
)
,
2222222222222222222
k
-
1
(
k
(
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
2222222222222222222222222222
+
⋯
+
w
k
k
(
d
i
k
)
)
)
22222222222222222222222
+
w
k
+
1
k
(
d
i
k
+
1
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
+
1
=
1
n
(
H
k
+
1
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
+
⋯
+
2222222222222222222
w
k
l
(
a
i
k
)
+
w
k
+
1
l
(
a
i
k
+
1
)
)
,
2222222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
+
⋯
+
22222222222222222
w
k
l
(
b
i
k
)
+
w
k
+
1
l
(
b
i
k
+
1
)
)
]
,
2222222222222222
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
+
⋯
+
222222222222222222
w
k
k
(
c
i
k
)
+
w
k
+
1
k
(
c
i
k
+
1
)
)
,
2222222222222222
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
+
⋯
+
222222222222222222
w
k
k
(
d
i
k
)
+
w
k
+
1
k
(
d
i
k
+
1
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
+
1
=
1
n
(
H
k
+
1
)
{
〈
[
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
a
i
j
)
)
,
22222222222212222
l
-
1
(
∑
j
=
1
k
+
1
w
j
l
(
b
i
j
)
)
]
,
1111111221111111
[
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
c
i
j
)
)
,
22222222222212222
k
-
1
(
∑
j
=
1
k
+
1
w
j
k
(
d
i
j
)
)
]
〉
}
,
that is, (15) holds for n
=
k
+
1; thus, (15) holds for all n. Then,
(20)
HIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
w
1
l
(
a
i
1
)
+
w
2
l
(
a
i
2
)
+
⋯
w
n
l
(
a
i
n
)
)
,
22222222222222
l
-
1
(
w
1
l
(
b
i
1
)
+
w
2
l
(
b
i
2
)
+
⋯
+
w
n
l
(
b
i
n
)
)
]
,
22222221111111
[
k
-
1
(
w
1
k
(
c
i
1
)
+
w
2
k
(
c
i
2
)
+
⋯
w
n
k
(
c
i
n
)
)
,
22222221111111
k
-
1
(
w
1
k
(
d
i
1
)
+
w
2
k
(
d
i
2
)
2222222222222222222
+
⋯
w
n
k
(
d
i
n
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
a
i
j
)
)
,
22222222222212222
l
-
1
(
∑
j
=
1
n
w
j
l
(
b
i
j
)
)
]
,
1111111221111111
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
c
i
j
)
)
,
22222222222212222
k
-
1
(
∑
j
=
1
n
w
j
k
(
d
i
j
)
)
]
〉
}
.Definition 26.
LetH
j
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, HIVIFNWG: HIVIFN
S
n
→
HIVIFNS, and then
(21)
HIVIFNW
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⨂
j
=
1
n
(
H
j
)
w
j
.
The HIVIFNWG operator is called the HIVIFN weighted geometric operator of dimension n, and w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Similarly, the following theorems can be obtained.Theorem 27.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWG operator is also a HIVIFN, and
(22)
H
I
V
I
F
N
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
k
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
∑
j
=
1
n
w
j
k
(
a
i
j
)
)
,
22222222222222
k
-
1
(
∑
j
=
1
n
w
j
k
(
b
i
j
)
)
]
,
11111112211111
[
l
-
1
(
∑
j
=
1
n
w
j
l
(
c
i
j
)
)
,
222222222222222
l
-
1
(
∑
j
=
1
n
w
j
l
(
d
i
j
)
)
]
〉
}
.Definition 28.
LetH
j
(
j
=
1,2
,
…
,
n) be a collection of HIVIFNs, HIVIFNWAA: HIVIFN
S
n
→
HIVIFNS, and then
(23)
HIVIFNWA
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
(
⨁
j
=
1
n
w
j
(
H
j
)
2
)
1
/
2
.
The HIVIFNWAA operator is called the HIVIFN weighted arithmetic averaging operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 29.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWAA operator is also a HIVIFN, and(24)
H
I
V
I
F
N
W
A
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
a
i
j
)
)
)
)
)
)
,
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
c
i
j
)
)
)
)
)
)
,
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
.Definition 30.
LetH
j
(
j
=
1,2
,
…
,
n) be a collection of HIVIFNs, HIVIFNWAG: HIVIFN
S
n
→
HIVIFNS, and then
(25)
HIVIFNWA
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
1
2
(
⨂
j
=
1
n
(
2
H
j
)
w
j
)
.
The HIVIFNWAG operator is called the HIVIFN weighted arithmetic geometric operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1.Theorem 31.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with w
j
≥
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the HIVIFNWAG operator is also a HIVIFN, and(26)
H
I
V
I
F
N
W
A
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
a
i
j
)
)
)
)
)
)
,
l
-
1
(
1
2
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
2
l
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
c
i
j
)
)
)
)
)
)
,
k
-
1
(
1
2
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
2
k
(
d
i
j
)
)
)
)
)
)
]
〉
}
.Definition 32.
LetH
j
(
j
=
1,2
,
…
,
n) be a collection of HIVIFNs, GHIVIFNWA: HIVIFN
S
n
→
HIVIFNS, and then
(27)
GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
(
⨁
j
=
1
n
w
j
(
H
j
)
λ
)
1
/
λ
.
The GHIVIFNWA operator is called the generalized HIVIFN weighted averaging operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. If λ
=
1, the GHIVIFNWA operator is reduced to the HIVIFNWA operator. If λ
=
2, the GHIVIFNWA operator is reduced to the HIVIFNWAA operator.Theorem 33.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0  (
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the GHIVIFNWA operator is also a HIVIFN, and(28)
G
H
I
V
I
F
N
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
.Definition 34.
LetH
j (j
=
1,2
,
…
,
n) be a collection of HIVIFNs, GHIVIFNWG: HIVIFN
S
n
→
HIVIFNS, and then
(29)
GHIVIFNW
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
1
λ
(
⨂
j
=
1
n
(
λ
H
j
)
w
j
)
.
The GHIVIFNWG operator is called the generalized HIVIFN weighted geometric operator of dimension n, where w
=
(
w
1
,
w
2
,
…
,
w
n
) is the weight vector of H
j
(
j
=
1,2
,
…
,
n
), with w
j
>
0
(
j
=
1,2
,
…
,
n
) and ∑
j
=
1
n
w
j
=
1. If λ
=
1, the GHIVIFNWG operator is reduced to the HIVIFNWG operator. If λ
=
2, then the GHIVIFNWG operator is reduced to the HIVIFNWAG operator.Theorem 35.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let w
=
(
w
1
,
w
2
,
…
,
w
n
) be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0  (
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1. Then, the aggregated result using the GHIVIFNWG operator is also a HIVIFN, and(30)
G
H
I
V
I
F
N
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
a
i
j
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
c
i
j
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
v
H
j
L
d
i
j
)
)
)
)
)
)
]
〉
}
.Note that Theorems27–35 could be proved by using the mathematical induction method and are omitted here.Based on these hesitant interval-valued intuitionistic fuzzy aggregation operators, it is easy to obtain the following properties.Property 1 (idempotency).
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs. If H
j
=
H
=
{
⋃
i
=
1
n
(
H
)
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
} for all i
=
1,2
,
…
,
n, then
(31)
GHIVIFNWA
(
H
1
,
H
2
,
…
,
H
n
)
=
H
,
GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
)
=
H
.Proof.
According to Theorem33 and H
j
=
H
=
{
⋃
i
=
1
n
(
H
)
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
} for all i
=
1,2
,
…
,
n,(32)
GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
=
⋃
i
1
=
1
n
(
H
)
⋯
⋃
i
=
1
n
(
H
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
)
)
)
)
)
)
]
,
222222222222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
)
)
)
)
)
)
]
〉
}
.Since ∑
j
=
1
n
w
j
=
1,
(33)
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
)
)
=
k
-
1
(
1
λ
k
(
l
-
1
(
l
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
)
)
=
k
-
1
(
1
λ
k
(
k
-
1
(
λ
k
(
a
i
)
)
)
)
=
k
-
1
(
1
λ
(
λ
k
(
a
i
)
)
)
=
k
-
1
(
1
λ
λ
k
(
a
i
)
)
=
k
-
1
(
k
(
a
i
)
)
=
a
i
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
)
)
)
)
)
)
=
b
i
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
)
)
)
)
)
)
=
c
i
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
)
)
)
)
)
)
=
d
i
.
Hence, GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
=
1
n
(
H
)
{
〈
[
a
i
,
b
i
]
,
[
c
i
,
d
i
]
〉
}
=
H.
Similarly,GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
)
=
H.Property 2 (commutativity).
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs and let H
~
j
=
{
⋃
i
j
=
1
n
(
H
~
j
)
〈
[
a
~
i
j
,
b
~
i
j
]
,
[
c
~
i
j
,
d
~
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be any permutation of H
j, and then
(34)
GHIVIFNWA
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
=
GHIVIFNWA
(
H
1
,
H
2
,
…
,
H
n
)
,
GHIVIFNWG
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
=
GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
)
.Proof.
SinceH
~
j
=
{
⋃
i
j
=
1
n
(
H
~
j
)
〈
[
a
~
i
j
,
b
~
i
j
]
,
[
c
~
i
j
,
d
~
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) is any permutation of H
j,(35)
GHIVIFNW
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
~
1
)
⋃
i
2
=
1
n
(
H
2
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
a
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
1111111111221111111111
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222221122222222
[
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
c
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
222222222222211222221
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
d
~
i
1
)
)
)
+
∑
j
=
2
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}
,
=
⋃
i
1
=
1
n
(
H
~
1
)
⋃
i
2
=
1
n
(
H
~
2
)
⋃
i
3
=
1
n
(
H
3
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
a
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
a
~
i
2
)
)
)
+
∑
j
=
2
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
)
)
)
)
)
)
,
1111111111112221111
222222
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
,
222222222111222222222221
[
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
c
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
c
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
)
)
)
)
)
)
,
222222222111222222222222
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
d
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
d
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
)
)
)
)
)
)
]
〉
}




=
⋯
=
⋃
i
1
=
1
n
(
H
~
1
)
⋯
⋃
i
n
=
1
n
(
H
~
n
)
{
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
a
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
a
~
i
2
)
)
)
+
⋯
+
w
n
l
(
k
-
1
(
λ
k
(
a
~
i
n
)
)
)
)
)
)
,
222222222112222222221
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
⋯
+
w
n
l
(
k
-
1
(
λ
k
(
b
~
i
n
)
)
)
)
)
)
]
,
222222222112222222221
[
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
c
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
c
~
i
2
)
)
)
+
⋯
+
w
n
k
(
l
-
1
(
λ
l
(
c
~
i
n
)
)
)
)
)
)
,
222222222112222222221
l
-
1
(
1
λ
l
(
k
-
1
(
w
1
k
(
l
-
1
(
λ
l
(
d
~
i
1
)
)
)
+
w
2
k
(
l
-
1
(
λ
l
(
d
~
i
2
)
)
)
+
⋯
+
w
n
k
(
l
-
1
(
λ
l
(
d
~
i
n
)
)
)
)
)
)
]
〉
k
-
1
(
1
λ
k
(
l
-
1
(
w
1
l
(
k
-
1
(
λ
k
(
b
~
i
1
)
)
)
+
w
2
l
(
k
-
1
(
λ
k
(
b
~
i
2
)
)
)
+
∑
j
=
3
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
)
)
)
)
)
)
]
}
=
GHIVIFNW
A
w
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
.
Similarly,GHIVIFNWG
(
H
~
1
,
H
~
2
,
…
,
H
~
n
)
=
GHIVIFNWG
(
H
1
,
H
2
,
…
,
H
n
).Property 3 (boundary).
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, and then
(36)
H
-
≤
GHIVIFAWA
(
H
1
,
H
2
,
…
,
H
n
)
≤
H
+
,
H
-
≤
GHIVIFAWG
(
H
1
,
H
2
,
…
,
H
n
)
≤
H
+
,
where H
-
=
{
(
[
0,0
]
,
[
1,1
]
)
} and H
+
=
{
(
[
1,1
]
,
[
0,0
]
)
}.Proof.
The process is omitted here.


## 4.2. HIVIFN Algebraic Aggregation Operators and HIVIFN Einstein Aggregation Operators

Obviously, differentt-conorms and t-norms may lead to different aggregation operators. In the following, HIVIFN algebraic aggregation operators and Einstein aggregation operators are presented based on algebraic norms and Einstein norms.Theorem 36.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, let w
=
(
w
1
,
w
2
,
…
,
w
n
)
T be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0
(
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1, k
(
x
)
=
-
ln
⁡
(
x
), and k
-
1
(
x
)
=
e
-
x
,
l
(
x
)
=
-
ln
⁡
(
1
-
x
)
,
l
-
1
(
x
)
=
1
-
e
-
x
,
T
(
x
,
y
)
=
x
y, and S
(
x
,
y
)
=
1
-
(
(
1
-
x
)
(
1
-
y
)
) be algebraic t-conorm and t-norm. Then, some HIVIFN algebraic aggregation operators could be obtained as follows.
(1) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted averaging operator is as follows:(37)
H
I
V
I
F
N
A
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
1
-
∏
j
=
1
n
(
1
-
a
i
j
)
w
j
,
1
-
∏
j
=
1
n
(
1
-
b
i
j
)
w
j
]
,



0000000000000000
[
∏
j
=
1
n
(
c
i
j
)
w
j
,
∏
j
=
1
n
(
d
i
j
)
w
j
]
〉
}
.
(2) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted geometric operator is as follows:(38)
H
I
V
I
F
N
A
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
∏
j
=
1
n
(
a
i
j
)
w
j
,
∏
j
=
1
n
(
b
i
j
)
w
j
]
,
0000000000000000
[
1
-
∏
j
=
1
n
(
1
-
c
i
j
)
w
j
,
00000000000000000
1
-
∏
j
=
1
n
(
1
-
d
i
j
)
w
j
]
〉
}
.
(3) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted arithmetic averaging operator is as follows:(39)
H
I
V
I
F
N
A
W
A
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
(
1
-
∏
j
=
1
n
(
1
-
(
a
i
j
)
2
)
w
j
)
1
/
2
,
(
1
-
∏
j
=
1
n
(
1
-
(
b
i
j
)
2
)
w
j
)
1
/
2
]
,
22
222222222222222
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
c
i
j
)
2
)
w
j
)
1
/
2
,
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
d
i
j
)
2
)
w
j
)
1
/
2
]
〉
}
.
(4) Hesitant interval-valued intuitionistic fuzzy number algebraic weighted arithmetic geometric operator is as follows:(40)
H
I
V
I
F
N
A
W
A
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
a
i
j
)
2
)
w
j
)
1
/
2
,
00000000000000001
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
b
i
j
)
2
)
w
j
)
1
/
2
]
,
00000000000000001
[
(
1
-
∏
j
=
1
n
(
1
-
(
c
i
j
)
2
)
w
j
)
1
/
2
,
000000000000000101
(
1
-
∏
j
=
1
n
(
1
-
(
d
i
j
)
2
)
w
j
)
1
/
2
]
〉
}
.
(5) Generalized hesitant interval-valued intuitionistic fuzzy number algebraic weighted averaging operator is as follows:(41)
G
H
I
V
I
F
N
A
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
a
i
j
)
λ
)
w
j
)
1
/
λ
,
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
b
i
j
)
λ
)
w
j
)
1
/
λ
]
,
00000000000000001
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
c
i
j
)
λ
)
w
j
)
1
/
λ
,
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
d
i
j
)
λ
)
w
j
)
1
/
λ
]
〉
}
.
(6) Generalized hesitant interval-valued intuitionistic fuzzy number algebraic weighted geometric operator is as follows:(42)
G
H
I
V
I
F
N
A
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
a
i
j
)
λ
)
w
j
)
1
/
λ
,
00000000000000001
1
-
(
1
-
∏
j
=
1
n
(
1
-
(
1
-
b
i
j
)
λ
)
w
j
)
1
/
λ
]
,
00000000000000001
[
(
1
-
∏
j
=
1
n
(
1
-
(
c
i
j
)
λ
)
w
j
)
1
/
λ
,
00000000000000001
(
1
-
∏
j
=
1
n
(
1
-
(
d
i
j
)
λ
)
w
j
)
1
/
λ
]
〉
}
.
In particular, if λ
=
1, then (41) is reduced to (37) and (42) is reduced to (38); if λ
=
2, then (41) is reduced to (39) and (42) is reduced to (40).Example 37.
LetH
1
=
{
〈
[
0.2,0.3
]
,
[
0.1,0.2
]
〉
,
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
〉
} and H
2
=
{
〈
[
0.1,0.3
]
,
[
0.2,0.4
]
〉
} be two HIVIFNs, and let w
=
(
0.4,0.6
) be the weight of them, and λ
=
1,2
,
5. According to Theorem 36, the following can be calculated:
(
1
)  HIVIFNAW
A
w
(
H
1
,
H
2
)
=
{
〈
[
1
-
(
1
-
0.2
)
0.4
×
(
1
-
0.1
)
0.6
,
1
-
(
1
-
0.3
)
0.4
×
(
1
-
0.3
)
0.6
]
,
[
0
.
1
0.4
×
0
.
2
0.6
,
0
.
2
0.4
×
0
.
4
0.6
]
,
[
1
-
(
1
-
0.4
)
0.4
×
(
1
-
0.1
)
0.6
,
1
-
(
1
-
0.5
)
0.4
×
(
1
-
0.3
)
0.6
]
,
[
0
.
2
0.4
×
0
.
2
0.6
,
0
.
3
0.4
×
0
.
4
0.6
]
〉
}
=
{
〈
[
0.1414,0.3000
]
,
[
0.1516,0.3031
]
〉
,
〈
[
0.2347,0.3881
],[
0.2000,0.3565
]
〉
}, Consider
(43)
HIVIFNAW
G
w
(
H
1
,
H
2
)
=
{
〈
[
0.1320,0.3000
]
,
[
0.1614,0.3268
]
〉
,
222
〈
[
0.1741,0.3680
]
,
[
0.2000,0.3618
]
〉
}
.
According to Definitions 24, 6, and 8, Consider the following:
(44)
S
~
(
HIVIFNAW
A
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1881,0.3441
]
,
[
0.1758,0.3298
]
〉
}
,
S
~
(
HIVIFNAW
G
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1531,0.3340
]
,
[
0.1807,0.3443
]
〉
}
.
L
(
S
~
(
HIVIFNAW
A
w
(
H
1
,
H
2
)
)
)
=
0.0866
,
L
(
S
~
(
HIVIFNAW
G
w
(
H
1
,
H
2
)
)
)
=
0.0524. Thus,
(45)
HIVIFNAW
A
w
(
H
1
,
H
2
)
>
HIVIFNAW
G
w
(
H
1
,
H
2
)
.
(
2
)  HIVIFNAWA
A
w
(
H
1
,
H
2
)
=
{
〈
[
0.1487,0.3000
]
,
[
0.1508,0.2989
]
〉
,
〈
[
0.2701,0.3972
],[
0.2000,0.3554
]
〉
};
(46)
HIVIFNAWA
G
w
(
H
1
,
H
2
)
=
{
〈
[
0.1313,0.3000
]
,
[
0.1677,0.3375
]
〉
,
222
〈
[
0.1686,0.3637
]
,
[
0.2000,0.3642
]
〉
}
.
According to Definitions 22, 5, and 6, Consider the following:
(47)
S
~
(
HIVIFNAWA
A
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.2094,0.3486
]
,
[
0.1754,0.3272
]
〉
}
,
S
~
(
HIVIFNAWA
G
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1500,0.3319
]
,
[
0.1839,0.3509
]
〉
}
.
Consider L
(
S
~
(
HIVIFNAWA
A
w
(
H
1
,
H
2
)
)
)
=
0.1031
,
L
(
S
~
(
HIVIFNAWA
G
w
(
H
1
,
H
2
)
)
)
=
0.0456. Thus,
(48)
HIVIFNAWA
A
w
(
H
1
,
H
2
)
>
HIVIFNAWA
G
w
(
H
1
,
H
2
)
.
(
3
)  GHIVIFNAW
A
w
(
H
1
,
H
2
)
=
{
〈
[
0.1680,0.3000
]
,
[
0.1481,0.2847
]
〉
,
〈
[
0.3333,0.4262
],[
0.2000,0.3512
]
〉
};
(49)
GHIVIFNAW
G
w
(
H
1
,
H
2
)
=
{
〈
[
0.1292,0.3000
]
,
[
0.1813,0.3628
]
〉
,
222
〈
[
0.1540,0.3502
]
,
[
0.2000,0.3720
]
〉
}
.
According to Definitions 22, 5, and 6,
(50)
S
~
(
GHIVIFNAW
A
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.2507,0.3631
]
,
[
0.1741,0.3180
]
〉
}
,
S
~
(
GHIVIFNAW
G
w
(
H
1
,
H
2
)
)
=
{
〈
[
0.1416,0.3251
]
,
[
0.1907,0.3674
]
〉
}
.
Consider L
(
S
~
(
GHIVIFNAW
A
w
(
H
1
,
H
2
)
)
)
=
0.1404
,
L
(
S
~
(
GHIVIFNAW
G
w
(
H
1
,
H
2
)
)
)
=
0.0459. Thus,
(51)
GHIVIFNAW
A
w
(
H
1
,
H
2
)
>
GHIVIFNAW
G
w
(
H
1
,
H
2
)
.
In the three cases listed above, the aggregation results by using the GHIVIFNAWA operator are greater than the aggregation results by utilizing the GHIVIFNAWG operator.Theorem 38.
LetH
j
=
{
⋃
i
j
=
1
n
(
H
j
)
〈
[
a
i
j
,
b
i
j
]
,
[
c
i
j
,
d
i
j
]
〉
}
(
j
=
1,2
,
…
,
n
) be a collection of HIVIFNs, and let w
=
(
w
1
,
w
2
,
…
,
w
n
)
T be the weight vector of A
j
(
j
=
1,2
,
…
,
n
), with λ
>
0, w
j
≥
0  (
j
=
1,2
,
…
,
n
), and ∑
j
=
1
n
w
j
=
1, k
(
x
)
=
ln
⁡
(
(
2
-
x
)
/
x
), and k
-
1
(
x
)
=
2
/
(
e
x
+
1
), l
(
x
)
=
ln
⁡
(
(
2
-
(
1
-
x
)
)
/
(
1
-
x
)
), l
-
1
(
x
)
=
1
-
(
2
/
(
e
x
+
1
)
),T
(
x
,
y
)
=
x
y
/
(
1
+
(
1
-
x
)
(
1
-
y
)
), and S
(
x
,
y
)
=
(
x
+
y
)
/
(
1
+
x
y
) be the Einstein t-conorm and t-norm, respectively. Then, some HIVIFN Einstein aggregation operators could be obtained as follows.
(
1
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted averaging operator is as follows:
(52)
H
I
V
I
F
N
E
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
∏
j
=
1
n
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
w
j
+
1
,
33333333333323
∏
j
=
1
n
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
w
j
+
1
]
,
33333333333333
[
2
∏
j
=
1
n
(
(
2
-
c
i
j
)
/
c
i
j
)
w
j
+
1
,
33333333333323
2
2
∏
j
=
1
n
(
(
2
-
d
i
j
)
/
d
i
j
)
w
j
+
1
]
}
.
(
2
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted geometric operator is as follows:
(53)
H
I
V
I
F
N
E
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
2
∏
j
=
1
n
(
(
2
-
a
i
j
)
/
a
i
j
)
w
j
+
1
,
2222222222222222
2
∏
j
=
1
n
(
(
2
-
b
i
j
)
/
b
i
j
)
w
j
+
1
]
,
222222222222222
[
∏
j
=
1
n
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
w
j
+
1
,
2222222222222222
∏
j
=
1
n
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
w
j
-
1
∏
j
=
1
n
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
w
j
+
1
]
}
.
(
3
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted arithmetic averaging operator is as follows:(54)
H
I
V
I
F
N
E
W
A
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
2
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
2
+
1
]
,
222222222222222
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
2
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
2
+
1
]
}
,where
(55)
α
i
j
=
(
a
i
j
2
-
a
i
j
+
1
1
-
a
i
j
)
,
β
i
j
=
(
b
i
j
2
-
b
i
j
+
1
1
-
b
i
j
)
,
μ
i
j
=
(
c
i
j
2
-
c
i
j
+
1
c
i
j
)
,
ν
i
j
=
(
d
i
j
2
-
d
i
j
+
1
d
i
j
)
.
(
4
) Hesitant interval-valued intuitionistic fuzzy number Einstein weighted arithmetic geometric operator is as follows:(56)
H
I
V
I
F
N
E
W
A
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
2
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
2
+
1
]
,
222222222222222
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
2
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
2
+
1
]
}
,where
(57)
μ
i
j
=
(
a
i
j
2
-
a
i
j
+
1
a
i
j
)
,
ν
i
j
=
(
b
i
j
2
-
b
i
j
+
1
b
i
j
)
,
α
i
j
=
(
c
i
j
2
-
c
i
j
+
1
1
-
c
i
j
)
,
β
i
j
=
(
d
i
j
2
-
d
i
j
+
1
1
-
d
i
j
)
.
(
5
) Generalized hesitant interval-valued intuitionistic fuzzy number Einstein weighted averaging operator is as follows:(58)
G
H
I
V
I
F
N
E
W
A
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
,
222222222222222
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
}
,where
(59)
α
i
j
=
(
1
+
(
2
/
(
(
(
2
-
a
i
j
)
/
a
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
a
i
j
)
/
a
i
j
)
λ
+
1
)
)
)
,
β
i
j
=
(
1
+
(
2
/
(
(
(
2
-
b
i
j
)
/
b
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
b
i
j
)
/
b
i
j
)
λ
+
1
)
)
)
,
μ
i
j
=
(
1
+
(
2
/
(
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
c
i
j
)
/
(
1
-
c
i
j
)
)
λ
+
1
)
)
)
,
ν
i
j
=
(
1
+
(
2
/
(
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
d
i
j
)
/
(
1
-
d
i
j
)
)
λ
+
1
)
)
)
.
(
6
) Generalized hesitant interval-valued intuitionistic fuzzy number Einstein weighted geometric operator is as follows:(60)
G
H
I
V
I
F
N
E
W
G
w
(
H
1
,
H
2
,
…
,
H
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
[
1
-
2
(
(
∏
j
=
1
n
μ
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
μ
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
1
-
2
(
(
∏
j
=
1
n
ν
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
ν
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
,
222222222222222
[
2
(
(
∏
j
=
1
n
α
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
α
i
j
w
j
-
1
)
)
1
/
λ
+
1
,
2
(
(
∏
j
=
1
n
β
i
j
w
j
+
3
)
/
(
∏
j
=
1
n
β
i
j
w
j
-
1
)
)
1
/
λ
+
1
]
}
,where
(61)
μ
i
j
=
(
1
+
(
2
/
(
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
a
i
j
)
/
(
1
-
a
i
j
)
)
λ
+
1
)
)
)
,
ν
i
j
=
(
1
+
(
2
/
(
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
1
+
b
i
j
)
/
(
1
-
b
i
j
)
)
λ
+
1
)
)
)
,
α
i
j
=
(
1
+
(
2
/
(
(
(
2
-
c
i
j
)
/
c
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
c
i
j
)
/
c
i
j
)
λ
+
1
)
)
)
,
β
i
j
=
(
1
+
(
2
/
(
(
(
2
-
d
i
j
)
/
d
i
j
)
λ
+
1
)
)
1
-
(
2
/
(
(
(
2
-
d
i
j
)
/
d
i
j
)
λ
+
1
)
)
)
.
In particular, if λ
=
1, then (58) is reduced to (52) and (60) is reduced to (53); if λ
=
2, then (58) is reduced to (54) and (60) is reduced to (56).


## 4.3. The MCDM Approach Based on the GHIVIFNWA and GHIVIFNWG Operators

LetA
=
{
a
1
,
a
2
,
…,a
m
} be a finite set of alternatives, and let C
=
{
c
1
,
c
2
,
…,c
n
} be a finite set of criteria, whose criteria weight vector is w
=
(
w
1
,
w
2
,
…
,
w
n
), where w
j
≥
0 (j
=
1,2
,
…
,
n), ∑
j
=
1
n
w
j
=
1. Let R
=
(
α
~
i
j
)
m
×
n be the hesitant interval-valued intuitionistic fuzzy decision matrix, where α
~
i
j is a criterion value, denoted by HIVIFNs. The characteristics of the alternatives a
i
(
i
=
1,2
,
…
,
m
) with respect to the attributes c
j
(
j
=
1,2
,
…
,
n
) can be denoted by α
~
i
j
=
{
⋃
r
=
1
n
(
α
~
i
j
)
〈
[
a
α
~
i
j
r
,
b
α
~
i
j
r
]
,
[
c
α
~
i
j
r
,
d
α
~
i
j
r
]
〉
}. In the following, we propose one approach to rank and select the most desirable alternative(s). The procedure of this approach is shown as follows.Step 1.
Aggregate the HIVIFNsα
~
i
j
(
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
n
) of the alternative a
i
(
i
=
1,2
,
…
,
m
).
Utilize the GHIVIFNWA or GHIVIFNWG operator to obtain the overall valuesy
i for the alternatives a
i (i
=
1,2
,
…
,
m), respectively; that is,(62)
y
i
=
GHIVIFNW
A
w
(
α
~
i
1
,
α
~
i
2
,
…
,
α
~
i
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
a
i
j
r
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
b
i
j
r
)
)
)
)
)
)
]
,
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
1
=
1
n
(
H
1
)
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
c
i
j
r
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
d
i
j
r
)
)
)
)
)
)
]
〉
}
or
(63)
y
i
=
GHIVIFNW
G
w
(
α
~
i
1
,
α
~
i
2
,
…
,
α
~
i
n
)
=
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
n
=
1
n
(
H
n
)
{
〈
[
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
a
i
j
r
)
)
)
)
)
)
,
l
-
1
(
1
λ
l
(
k
-
1
(
∑
j
=
1
n
w
j
k
(
l
-
1
(
λ
l
(
b
i
j
r
)
)
)
)
)
)
]
,
⋃
i
1
=
1
n
(
H
1
)
⋯
⋃
i
1
=
1
n
(
H
1
)
[
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
c
i
j
r
)
)
)
)
)
)
,
k
-
1
(
1
λ
k
(
l
-
1
(
∑
j
=
1
n
w
j
l
(
k
-
1
(
λ
k
(
d
i
j
r
)
)
)
)
)
)
]
〉
}
.Step 2.
Calculate the score values. According to Definition22, the score of overall values S
~
(
y
i
) (i
=
1,2
,
…
,
m) could be calculated.Step 3.
Rank the preference order of all alternativesa
i (i
=
1,2
,
…
,
m). L
(
S
~
(
y
i
)
)
(
i
=
1,2
,
…
,
m
) could be obtained according to Definition 5. The greater the value of L
(
S
~
(
y
i
)
) is, the better the alternative a
i
(
i
=
1,2
,
…
,
m
) will be.Step 4.
Select the optimal one(s).


## 5. Illustrative Example

In this section, the proposed approach and one existing method are utilized to evaluate four companies with hesitant interval-valued intuitionistic fuzzy information.The enterprise’s board of directors intends to find an automobile company and establish a foundation for deeper and more extensive cooperation with it in the following five years. Suppose there are four possible projectsa
i (i
=
1,2
,
3,4) to be evaluated. It is necessary to compare these companies and rank them in terms of their importance. Four criteria, suggested by the Balanced Scorecard methodology, could be taken into account (it should be noted that all of them are of the maximization type): c
1: economy, c
2: comfort, c
3: design, and c
4: safety. And suppose that the weight vector of the criteria is w
=
(
0.2,0.3,0.15,0.35
). The decision-makers are required to provide their evaluation of the company a
i under the criterion c
j (i
=
1,2
,
3,4, j
=
1,2
,
3,4). The hesitant interval-valued intuitionistic fuzzy decision matrix R
=
(
α
~
i
j
)
4
×
4 is shown in Table 1, where α
~
i
j (i
=
1,2
,
3,4, j
=
1,2
,
3,4) are in the form of HIVIFNs.Table 1
Hesitant interval-valued intuitionistic fuzzy decision matrixR
=
(
α
~
i
j
)
4
×
4.
c
1
c
2
c
3
c
4
a
1
{
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
〉
}
{
〈
[
0.1,0.2
]
,
[
0.3,0.4
]
〉, 〈
0.7,0.3
〉
}
{
〈
[
0.5,0.6
]
,
[
0.3,0.4
]
〉
}
{
〈
0.4,0.2
〉
}
a
2
{
〈
[
0.7,0.8
]
,
[
0.1,0.2
]
〉
}
{
〈
[
0.3,0.4
]
,
[
0.2,0.3
]
〉, 〈
[
0.6,0.7
]
,
[
0.1,0.3
]
〉
}
{
〈
[
0.5,0.6
]
,
[
0.2,0.4
]
〉
}
{
〈
[
0.6,0.7
]
,
[
0.1,0.3
]
〉
}
a
3
{
〈
[
0.4,0.5
]
,
[
0.3,0.4
]
〉
}
{
〈
[
0.4,0.5
]
,
[
0.2,0.3
]
〉
}
{
〈
[
0.7,0.8
]
,
[
0.1,0.2
]
〉
}
{
〈
[
0.6,0.7
]
,
[
0.1,0.3
]
〉
}
a
4
{
〈
[
0.5,0.6
]
,
[
0.2,0.3
]
〉
}
{
〈
0.6,0.3
〉
}
{
〈
[
0.2,0.3
]
,
[
0.1,0.2
]
〉,
〈
[
0.5,0.6
]
,
[
0.2,0.3
]
〉
}
{
〈
[
0.7,0.8
]
,
[
0.1,0.2
]
〉
}


### 5.1. Illustration of the Proposed Approach

In order to get the optimal alternative(s), the following steps are involved.Step 1.
Aggregate the HIVIFNsα
~
i
j
(
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
n
) of the alternative a
i
(
i
=
1,2
,
…
,
m
).
For the convenience of analysis and computation, we use hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators to fuse the attribute values which are represented in the form of HIVIFNs in MCDM problems. Letk
(
x
)
=
-
ln
⁡
(
x
), and let k
-
1
(
x
)
=
e
-
x
,
l
(
x
)
=
-
ln
⁡
(
1
-
x
)
,
l
-
1
(
x
)
=
1
-
e
-
x, and T
(
x
,
y
)
=
x
y, and S
(
x
,
y
)
=
1
-
(
(
1
-
x
)
(
1
-
y
)
) be algebraic t-conorm and t-norm. Then, the GHIVIFNWA or GHIVIFNWG operators are, respectively, reduced to the GHIVIFNAWA or GHIVIFNAWG operators, and (62) and (63) are reduced to the following expression; that is,(64)
y
i
=
GHIVIFNAWA
(
α
~
i
1
,
α
~
i
2
,
α
~
i
3
,
α
~
i
4
)
=
⋃
i
1
=
1
n
(
α
~
i
1
)
⋯
⋃
i
4
=
1
n
(
α
~
i
4
)
{
〈
[
(
1
-
∏
j
=
1
4
(
1
-
(
a
i
j
k
)
λ
)
w
j
)
1
/
λ
,
(
1
-
∏
j
=
1
4
(
1
-
(
b
i
j
k
)
λ
)
w
j
)
1
/
λ
]
,
2222222222222222
[
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
c
i
j
k
)
λ
)
w
j
)
1
/
λ
,
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
d
i
j
k
)
λ
)
w
j
)
1
/
λ
]
〉
}
(
i
=
1,2
,
3,4
)
,
or
(65)
y
i
=
GHIVIFAWG
(
α
~
i
1
,
α
~
i
2
,
α
~
i
3
,
α
~
i
4
)
=
⋃
i
1
=
1
n
(
α
~
i
1
)
⋯
⋃
i
4
=
1
n
(
α
~
i
4
)
{
〈
[
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
a
i
j
k
)
λ
)
w
j
)
1
/
λ
,
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
b
i
j
k
)
λ
)
w
j
)
1
/
λ
]
,
2222222222222222
[
(
1
-
∏
j
=
1
4
(
1
-
(
c
i
j
k
)
λ
)
w
j
)
1
/
λ
,
(
1
-
∏
j
=
1
4
(
1
-
(
d
i
j
k
)
λ
)
w
j
)
1
/
λ
]
〉
}
(
i
=
1,2
,
3,4
)
.Letλ
=
2, and according to the formula listed above, the overall HIVIFNs y
i of the alternatives a
i
(
i
=
1,2
,
3,4
) could be obtained and shown in Table 2.Table 2
The overall HIVIFNs of alternatives.
λ
=
2
GHIVIFAWA (HIVIFAWA)
GHIVIFNWG (HIVIFAWG)
y
1
{
〈
[
0.3925,0.4601
]
,
[
0.1712,0.2389
]
〉,
〈
[
0.5376,0.5668
]
,
[
0.2391,0.2700
]
〉
}
{
〈
[
0.3373,0.4415
]
,
[
0.1971,0.2628
]
〉,
〈
[
0.4788,0.5150
]
,
[
0.2507,0.2896
]
〉
}
y
2
{
〈
[
0.5513,0.6545
]
,
[
0.1359,0.2874
]
〉,
〈
[
0.6113,0.7126
]
,
[
0.1107,0.2874
]
〉
}
{
〈
[
0.4732,0.5731
]
,
[
0.1537,0.3020
]
〉,
〈
[
0.5990,0.6980
]
,
[
0.1207,0.3020
]
〉
}
y
3
{
〈
[
0.5398,0.6427
]
,
[
0.1517,0.2975
]
〉
}
{
〈
[
0.4921,0.5911
]
,
[
0.1884,0.3118
]
〉
}
y
4
{
〈
[
0.5929,0.6696
]
,
[
0.1576,0.2440
]
〉,
〈
[
0.6125,0.6905
]
,
[
0.1751,0.2594
]
〉
}
{
〈
[
0.5880,0.6539
]
,
[
0.2123,0.2698
]
〉,
〈
[
0.4938,0.5348
]
,
[
0.2016,0.2556
]
〉
}Step 2.
Based on Definition22 and Table 2, the score values of overall HIVIFNs S
~
(
y
i
) (i
=
1,2
,
3,4) can be obtained and shown in Table 3.Table 3
The score values of overall HIVIFNs.
GHIVIFAWA
λ
=
2 (HIVIFAWA)
GHIVIFAWG
λ
=
2 (HIVIFAWG)
S
~
(
y
1
)
{
〈
[
0.4651,0.5135
]
,
[
0.2052,0.2545
]
〉
}
S
~
(
y
1
)
{
〈
[
0.4081,0.4783
]
,
[
0.2239,0.2762
]
〉
}
S
~
(
y
2
)
{
〈
[
0.5813,0.6836
]
,
[
0.1233,0.2874
]
〉
}
S
~
(
y
2
)
{
〈
[
0.5361,0.6356
]
,
[
0.1372,0.3020
]
〉
}
S
~
(
y
3
)
{
〈
[
0.5398,0.6427
]
,
[
0.1517,0.2975
]
〉
}
S
~
(
y
3
)
{
〈
[
0.4921,0.5911
]
,
[
0.1884,0.3118
]
〉
}
S
~
(
y
4
)
{
〈
[
0.6027,0.6801
]
,
[
0.1664,0.2517
]
〉
}
S
~
(
y
4
)
{
〈
[
0.5409,0.5944
]
,
[
0.2070,0.2627
]
〉
}Step 3.
Rank all the alternativesa
i
(
i
=
1,2
,
3,4
) in accordance with the scores S
~
(
y
i
)
(
i
=
1,2
,
3,4
) of the aggregated hesitant interval-valued intuitionistic fuzzy values by using Definitions 5 and 6. From Table 3, the following results can be obtained.Case 1.
The GHIVIFAWA operator is as follows:(66)
L
(
S
~
(
y
1
)
)
=
0.3725
,
L
(
S
~
(
y
2
)
)
=
0.5612
,
L
(
S
~
(
y
3
)
)
=
0.5032
,
L
(
S
~
(
y
4
)
)
=
0.5681
.
So the final ranking of alternatives is a
4
≻
a
2
≻
a
3
≻
a
1.Case 2.
The GHIVIFAWG operator is as follows:(67)
L
(
S
~
(
y
1
)
)
=
0.3049
,
L
(
S
~
(
y
2
)
)
=
0.4990
,
L
(
S
~
(
y
3
)
)
=
0.4300
;
L
(
S
~
(
y
4
)
)
=
0.4669
.
So the final ranking of alternatives is a
2
≻
a
4
≻
a
3
≻
a
1.Step 4.
Select the best one(s). In Step3, if the GHIVIFNAWA operator is utilized, then the optimal alternative is a
2 while the worst alternative is a
1; if the GHIVIFNAWG operator is used, then the optimal alternative is a
4 while the worst alternative is a
1.


### 5.2. Sensitivity Analysis

In Step1, two aggregation operators can be used and the sensitivity analysis will be conducted in these following cases.(
1
) The hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators in Step 1  are illustrated as follows.In order to investigate the influence ofλ on the ranking of alternatives, different λ are utilized. The ranking results are shown in Tables 4 and 5.Table 4
Rankings obtained using the GHIVIFNAWA operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.3627
0.5529
0.4927
0.5581
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
2
0.3725
0.5612
0.5032
0.5681
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
5
0.3914
0.5836
0.5363
0.5940
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
10
0.4493
0.6105
0.5804
0.6263
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
20
0.4949
0.6443
0.6287
0.6624
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
30
0.5152
0.6642
0.6537
0.6788
a
4
≻
a
2
≻
a
3
≻
a
1Table 5
Rankings obtained using the GHIVIFNAWG operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.3291
0.5148
0.4329
0.4482
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
2
0.3049
0.4990
0.4300
0.4669
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
5
0.2819
0.4517
0.3804
0.4076
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
10
0.2428
0.3995
0.2877
0.3338
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
20
0.2071
0.3523
0.2824
0.2993
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
30
0.1858
0.3372
0.2608
0.2699
a
2
≻
a
4
≻
a
3
≻
a
1From Tables4 and 5, the GHIVIFNAWA and GHIVIFNAWG operators have produced different rankings of the alternatives. However, for each operator, the rankings obtained are consistent as λ changes. Moreover, a
4 or a
2 is always the optimal one while the worst one is always a
1.(
2
) The hesitant interval-valued intuitionistic fuzzy Einstein aggregation operators in Step 1  are illustrated as follows.Letk
(
x
)
=
ln
⁡
(
(
2
-
x
)
/
x
), and let k
-
1
(
x
)
=
2
/
(
e
x
+
1
)
,
l
(
x
)
=
ln
⁡
(
(
2
-
(
1
-
x
)
)
/
(
1
-
x
)
), l
-
1
(
x
)
=
1
-
(
2
/
(
e
x
+
1
)
)
,
T
(
x
,
y
)
=
x
y
/
(
1
+
(
1
-
x
)
(
1
-
y
)
), and S
(
x
,
y
)
=
(
x
+
y
)
/
(
1
+
x
y
) be the Einstein t-conorm and t-norm, respectively. Then, the GHIVIFNWA and GHIVIFNWG operators are, respectively, reduced to the GHIVIFNEWA and GHIVIFNEWG operators. According to (58) and (60), the following results could be obtained and shown in Tables 6 and 7.Table 6
Rankings obtained using the GHIVIFNEWA operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.4143
0.5478
0.4864
0.5515
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
2
0.3708
0.5586
0.4994
0.5641
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
5
0.2752
0.5955
0.5559
0.6075
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
10
0.4751
0.6317
0.6113
0.6505
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
20
0.5146
0.6669
0.6571
0.6812
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
30
0.5295
0.6825
0.6759
0.6925
a
4
≻
a
2
≻
a
3
≻
a
1Table 7
Rankings obtained using the GHIVIFNEWG operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.3342
0.5213
0.4551
0.5127
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
2
0.3156
0.4967
0.4093
0.4274
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
5
0.2669
0.4315
0.3622
0.3760
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
10
0.2262
0.3767
0.3048
0.3184
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
20
0.1951
0.3414
0.2905
0.2986
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
30
0.1745
0.3034
0.2578
0.2602
a
2
≻
a
4
≻
a
3
≻
a
1From Tables6 and 7, the GHIVIFNEWA and GHIVIFNEWG operators have produced different rankings of the alternatives. Furthermore, for each operator, the aggregation parameter λ also leads to different aggregation results, but the final rankings of alternatives are the same as the parameter changes. What is more, regardless of using the GHIVIFNEWA and GHIVIFNEWG operators, is that a
4 or a
2 is always the optimal one while the worst one is always a
1.It can be concluded from the sensitivity analysis that differentt-conorms and t-norms could lead to different aggregation results. However, the rankings using each operator are consistent.


### 5.3. Comparison Analysis

Based on the same decision-making problem, if the method of Chen et al. [16] is employed, HIVIFNs are transformed to IVIFNs by using the score function firstly, and then IVIFNs could be aggregated by the interval-valued intuitionistic fuzzy weighted aggregation operators, proposed by Chen et al. [16].Based on Definition3 and ∑
i
=
1
4
w
i
=
1, the interval-valued intuitionistic fuzzy weighted average values of all alternatives could be obtained as follows:
(68)
IVIFW
A
w
(
a
11
,
a
12
,
a
13
,
a
14
)
=
∑
i
=
1
4
[
[
a
1
i
,
b
1
i
]
,
[
1
-
d
1
i
,
1
-
c
1
i
]
]
×
w
i
∑
i
=
1
n
w
i
=
[
[
∑
i
=
1
4
a
1
i
w
i
,
∑
i
=
1
4
b
1
i
w
i
]
,
[
∑
i
=
1
n
(
1
-
d
1
i
)
w
i
,
∑
i
=
1
n
(
1
-
c
1
i
)
w
i
]
]
=
[
[
0.4
×
0.2
+
0.3
+
0.7
2
×
0.3
+
0.5
×
0.15
+
0.4
×
0.35
,
22222
0.5
×
0.2
+
0.4
+
0.7
2
×
0.3
+
0.6
×
0.15
+
0.4
×
0.35
0.3
+
0.7
2
]
,
222
[
(
1
-
0.3
)
×
0.2
+
(
1
-
0.2
+
0.3
2
)
×
0.3
+
(
1
-
0.4
)
2222
×
0.15
+
(
1
-
0.2
)
×
0.35
,
(
1
-
0.2
)
×
0.2
22222
+
(
1
-
0.1
+
0.3
2
)
×
0.3
+
(
1
-
0.3
)
×
0.15
22222
+
(
1
-
0.2
)
×
0.35
0.3
+
0.7
2
]
]
=
[
[
0.445,0.495
]
,
[
0.735,0.785
]
]
=
〈
[
0.445,0.495
]
,
[
1
-
0.785,1
-
0.735
]
〉
=
〈
[
0.445,0.495
]
,
[
0.215,0.265
]
〉
,
IVIFW
A
w
(
a
21
,
a
22
,
a
23
,
a
24
)
=
[
[
0.560,0.660
]
,
[
0.635,0.87
]
]
=
〈
[
0.560,0.660
]
,
[
0.13,0.365
]
〉
,
IVIFW
A
w
(
a
31
,
a
32
,
a
33
,
a
34
)
=
[
[
0.515,0.615
]
,
[
0.695,0.830
]
]
=
〈
[
0.515,0.615
]
,
[
0.170,0.305
]
〉
,
IVIFW
A
w
(
a
41
,
a
42
,
a
43
,
a
44
)
=
[
[
0.578,0.648
]
,
[
0.743,0.813
]
]
=
〈
[
0.578,0.648
]
,
[
0.187,0.257
]
〉
.
According to Definitions 5 and 6,
(69)
L
(
IVIFW
A
w
(
a
11
,
a
12
,
a
13
,
a
14
)
)
=
0.343
,
L
(
IVIFW
A
w
(
a
21
,
a
22
,
a
23
,
a
24
)
)
=
0.519
,
L
(
IVIFW
A
w
(
a
31
,
a
32
,
a
33
,
a
34
)
)
=
0.486
,
L
(
IVIFW
A
w
(
a
41
,
a
42
,
a
43
,
a
44
)
)
=
0.528
.
So a
4
≻
a
2
≻
a
3
≻
a
1 and the best optimal one is a
4. The ranking here is the same as the result using the GHIVIFNAWA and GHIVIFNAWA operators.According to the calculation results, although the existing method can produce the same result as the proposed method, the method being compared has a problem that how to transform HIVIFNs to IVIFNs in the first step could avoid information loss in the process of transformation. By contrast, the proposed approach based on differentt-conorms and t-norms can be used to deal with different relationships among the aggregated arguments, could handle MCDM problems in a flexible and objective manner under hesitant interval-valued intuitionistic fuzzy environment, and can provide more choices for decision-makers. Additionally, different t-conorms and t-norms and aggregation operators could be chosen in the practical decision-making process. At the same time, different results may be produced, which reflected the preferences of decision-makers. Therefore, the developed approach can produce better results than the existing method.


## 5.1. Illustration of the Proposed Approach

In order to get the optimal alternative(s), the following steps are involved.Step 1.
Aggregate the HIVIFNsα
~
i
j
(
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
n
) of the alternative a
i
(
i
=
1,2
,
…
,
m
).
For the convenience of analysis and computation, we use hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators to fuse the attribute values which are represented in the form of HIVIFNs in MCDM problems. Letk
(
x
)
=
-
ln
⁡
(
x
), and let k
-
1
(
x
)
=
e
-
x
,
l
(
x
)
=
-
ln
⁡
(
1
-
x
)
,
l
-
1
(
x
)
=
1
-
e
-
x, and T
(
x
,
y
)
=
x
y, and S
(
x
,
y
)
=
1
-
(
(
1
-
x
)
(
1
-
y
)
) be algebraic t-conorm and t-norm. Then, the GHIVIFNWA or GHIVIFNWG operators are, respectively, reduced to the GHIVIFNAWA or GHIVIFNAWG operators, and (62) and (63) are reduced to the following expression; that is,(64)
y
i
=
GHIVIFNAWA
(
α
~
i
1
,
α
~
i
2
,
α
~
i
3
,
α
~
i
4
)
=
⋃
i
1
=
1
n
(
α
~
i
1
)
⋯
⋃
i
4
=
1
n
(
α
~
i
4
)
{
〈
[
(
1
-
∏
j
=
1
4
(
1
-
(
a
i
j
k
)
λ
)
w
j
)
1
/
λ
,
(
1
-
∏
j
=
1
4
(
1
-
(
b
i
j
k
)
λ
)
w
j
)
1
/
λ
]
,
2222222222222222
[
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
c
i
j
k
)
λ
)
w
j
)
1
/
λ
,
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
d
i
j
k
)
λ
)
w
j
)
1
/
λ
]
〉
}
(
i
=
1,2
,
3,4
)
,
or
(65)
y
i
=
GHIVIFAWG
(
α
~
i
1
,
α
~
i
2
,
α
~
i
3
,
α
~
i
4
)
=
⋃
i
1
=
1
n
(
α
~
i
1
)
⋯
⋃
i
4
=
1
n
(
α
~
i
4
)
{
〈
[
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
a
i
j
k
)
λ
)
w
j
)
1
/
λ
,
1
-
(
1
-
∏
j
=
1
4
(
1
-
(
1
-
b
i
j
k
)
λ
)
w
j
)
1
/
λ
]
,
2222222222222222
[
(
1
-
∏
j
=
1
4
(
1
-
(
c
i
j
k
)
λ
)
w
j
)
1
/
λ
,
(
1
-
∏
j
=
1
4
(
1
-
(
d
i
j
k
)
λ
)
w
j
)
1
/
λ
]
〉
}
(
i
=
1,2
,
3,4
)
.Letλ
=
2, and according to the formula listed above, the overall HIVIFNs y
i of the alternatives a
i
(
i
=
1,2
,
3,4
) could be obtained and shown in Table 2.Table 2
The overall HIVIFNs of alternatives.
λ
=
2
GHIVIFAWA (HIVIFAWA)
GHIVIFNWG (HIVIFAWG)
y
1
{
〈
[
0.3925,0.4601
]
,
[
0.1712,0.2389
]
〉,
〈
[
0.5376,0.5668
]
,
[
0.2391,0.2700
]
〉
}
{
〈
[
0.3373,0.4415
]
,
[
0.1971,0.2628
]
〉,
〈
[
0.4788,0.5150
]
,
[
0.2507,0.2896
]
〉
}
y
2
{
〈
[
0.5513,0.6545
]
,
[
0.1359,0.2874
]
〉,
〈
[
0.6113,0.7126
]
,
[
0.1107,0.2874
]
〉
}
{
〈
[
0.4732,0.5731
]
,
[
0.1537,0.3020
]
〉,
〈
[
0.5990,0.6980
]
,
[
0.1207,0.3020
]
〉
}
y
3
{
〈
[
0.5398,0.6427
]
,
[
0.1517,0.2975
]
〉
}
{
〈
[
0.4921,0.5911
]
,
[
0.1884,0.3118
]
〉
}
y
4
{
〈
[
0.5929,0.6696
]
,
[
0.1576,0.2440
]
〉,
〈
[
0.6125,0.6905
]
,
[
0.1751,0.2594
]
〉
}
{
〈
[
0.5880,0.6539
]
,
[
0.2123,0.2698
]
〉,
〈
[
0.4938,0.5348
]
,
[
0.2016,0.2556
]
〉
}Step 2.
Based on Definition22 and Table 2, the score values of overall HIVIFNs S
~
(
y
i
) (i
=
1,2
,
3,4) can be obtained and shown in Table 3.Table 3
The score values of overall HIVIFNs.
GHIVIFAWA
λ
=
2 (HIVIFAWA)
GHIVIFAWG
λ
=
2 (HIVIFAWG)
S
~
(
y
1
)
{
〈
[
0.4651,0.5135
]
,
[
0.2052,0.2545
]
〉
}
S
~
(
y
1
)
{
〈
[
0.4081,0.4783
]
,
[
0.2239,0.2762
]
〉
}
S
~
(
y
2
)
{
〈
[
0.5813,0.6836
]
,
[
0.1233,0.2874
]
〉
}
S
~
(
y
2
)
{
〈
[
0.5361,0.6356
]
,
[
0.1372,0.3020
]
〉
}
S
~
(
y
3
)
{
〈
[
0.5398,0.6427
]
,
[
0.1517,0.2975
]
〉
}
S
~
(
y
3
)
{
〈
[
0.4921,0.5911
]
,
[
0.1884,0.3118
]
〉
}
S
~
(
y
4
)
{
〈
[
0.6027,0.6801
]
,
[
0.1664,0.2517
]
〉
}
S
~
(
y
4
)
{
〈
[
0.5409,0.5944
]
,
[
0.2070,0.2627
]
〉
}Step 3.
Rank all the alternativesa
i
(
i
=
1,2
,
3,4
) in accordance with the scores S
~
(
y
i
)
(
i
=
1,2
,
3,4
) of the aggregated hesitant interval-valued intuitionistic fuzzy values by using Definitions 5 and 6. From Table 3, the following results can be obtained.Case 1.
The GHIVIFAWA operator is as follows:(66)
L
(
S
~
(
y
1
)
)
=
0.3725
,
L
(
S
~
(
y
2
)
)
=
0.5612
,
L
(
S
~
(
y
3
)
)
=
0.5032
,
L
(
S
~
(
y
4
)
)
=
0.5681
.
So the final ranking of alternatives is a
4
≻
a
2
≻
a
3
≻
a
1.Case 2.
The GHIVIFAWG operator is as follows:(67)
L
(
S
~
(
y
1
)
)
=
0.3049
,
L
(
S
~
(
y
2
)
)
=
0.4990
,
L
(
S
~
(
y
3
)
)
=
0.4300
;
L
(
S
~
(
y
4
)
)
=
0.4669
.
So the final ranking of alternatives is a
2
≻
a
4
≻
a
3
≻
a
1.Step 4.
Select the best one(s). In Step3, if the GHIVIFNAWA operator is utilized, then the optimal alternative is a
2 while the worst alternative is a
1; if the GHIVIFNAWG operator is used, then the optimal alternative is a
4 while the worst alternative is a
1.


## 5.2. Sensitivity Analysis

In Step1, two aggregation operators can be used and the sensitivity analysis will be conducted in these following cases.(
1
) The hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators in Step 1  are illustrated as follows.In order to investigate the influence ofλ on the ranking of alternatives, different λ are utilized. The ranking results are shown in Tables 4 and 5.Table 4
Rankings obtained using the GHIVIFNAWA operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.3627
0.5529
0.4927
0.5581
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
2
0.3725
0.5612
0.5032
0.5681
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
5
0.3914
0.5836
0.5363
0.5940
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
10
0.4493
0.6105
0.5804
0.6263
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
20
0.4949
0.6443
0.6287
0.6624
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
30
0.5152
0.6642
0.6537
0.6788
a
4
≻
a
2
≻
a
3
≻
a
1Table 5
Rankings obtained using the GHIVIFNAWG operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.3291
0.5148
0.4329
0.4482
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
2
0.3049
0.4990
0.4300
0.4669
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
5
0.2819
0.4517
0.3804
0.4076
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
10
0.2428
0.3995
0.2877
0.3338
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
20
0.2071
0.3523
0.2824
0.2993
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
30
0.1858
0.3372
0.2608
0.2699
a
2
≻
a
4
≻
a
3
≻
a
1From Tables4 and 5, the GHIVIFNAWA and GHIVIFNAWG operators have produced different rankings of the alternatives. However, for each operator, the rankings obtained are consistent as λ changes. Moreover, a
4 or a
2 is always the optimal one while the worst one is always a
1.(
2
) The hesitant interval-valued intuitionistic fuzzy Einstein aggregation operators in Step 1  are illustrated as follows.Letk
(
x
)
=
ln
⁡
(
(
2
-
x
)
/
x
), and let k
-
1
(
x
)
=
2
/
(
e
x
+
1
)
,
l
(
x
)
=
ln
⁡
(
(
2
-
(
1
-
x
)
)
/
(
1
-
x
)
), l
-
1
(
x
)
=
1
-
(
2
/
(
e
x
+
1
)
)
,
T
(
x
,
y
)
=
x
y
/
(
1
+
(
1
-
x
)
(
1
-
y
)
), and S
(
x
,
y
)
=
(
x
+
y
)
/
(
1
+
x
y
) be the Einstein t-conorm and t-norm, respectively. Then, the GHIVIFNWA and GHIVIFNWG operators are, respectively, reduced to the GHIVIFNEWA and GHIVIFNEWG operators. According to (58) and (60), the following results could be obtained and shown in Tables 6 and 7.Table 6
Rankings obtained using the GHIVIFNEWA operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.4143
0.5478
0.4864
0.5515
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
2
0.3708
0.5586
0.4994
0.5641
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
5
0.2752
0.5955
0.5559
0.6075
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
10
0.4751
0.6317
0.6113
0.6505
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
20
0.5146
0.6669
0.6571
0.6812
a
4
≻
a
2
≻
a
3
≻
a
1
λ
=
30
0.5295
0.6825
0.6759
0.6925
a
4
≻
a
2
≻
a
3
≻
a
1Table 7
Rankings obtained using the GHIVIFNEWG operator.
λ
a
1
a
2
a
3
a
4
Rankings
λ
=
1
0.3342
0.5213
0.4551
0.5127
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
2
0.3156
0.4967
0.4093
0.4274
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
5
0.2669
0.4315
0.3622
0.3760
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
10
0.2262
0.3767
0.3048
0.3184
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
20
0.1951
0.3414
0.2905
0.2986
a
2
≻
a
4
≻
a
3
≻
a
1
λ
=
30
0.1745
0.3034
0.2578
0.2602
a
2
≻
a
4
≻
a
3
≻
a
1From Tables6 and 7, the GHIVIFNEWA and GHIVIFNEWG operators have produced different rankings of the alternatives. Furthermore, for each operator, the aggregation parameter λ also leads to different aggregation results, but the final rankings of alternatives are the same as the parameter changes. What is more, regardless of using the GHIVIFNEWA and GHIVIFNEWG operators, is that a
4 or a
2 is always the optimal one while the worst one is always a
1.It can be concluded from the sensitivity analysis that differentt-conorms and t-norms could lead to different aggregation results. However, the rankings using each operator are consistent.


## 5.3. Comparison Analysis

Based on the same decision-making problem, if the method of Chen et al. [16] is employed, HIVIFNs are transformed to IVIFNs by using the score function firstly, and then IVIFNs could be aggregated by the interval-valued intuitionistic fuzzy weighted aggregation operators, proposed by Chen et al. [16].Based on Definition3 and ∑
i
=
1
4
w
i
=
1, the interval-valued intuitionistic fuzzy weighted average values of all alternatives could be obtained as follows:
(68)
IVIFW
A
w
(
a
11
,
a
12
,
a
13
,
a
14
)
=
∑
i
=
1
4
[
[
a
1
i
,
b
1
i
]
,
[
1
-
d
1
i
,
1
-
c
1
i
]
]
×
w
i
∑
i
=
1
n
w
i
=
[
[
∑
i
=
1
4
a
1
i
w
i
,
∑
i
=
1
4
b
1
i
w
i
]
,
[
∑
i
=
1
n
(
1
-
d
1
i
)
w
i
,
∑
i
=
1
n
(
1
-
c
1
i
)
w
i
]
]
=
[
[
0.4
×
0.2
+
0.3
+
0.7
2
×
0.3
+
0.5
×
0.15
+
0.4
×
0.35
,
22222
0.5
×
0.2
+
0.4
+
0.7
2
×
0.3
+
0.6
×
0.15
+
0.4
×
0.35
0.3
+
0.7
2
]
,
222
[
(
1
-
0.3
)
×
0.2
+
(
1
-
0.2
+
0.3
2
)
×
0.3
+
(
1
-
0.4
)
2222
×
0.15
+
(
1
-
0.2
)
×
0.35
,
(
1
-
0.2
)
×
0.2
22222
+
(
1
-
0.1
+
0.3
2
)
×
0.3
+
(
1
-
0.3
)
×
0.15
22222
+
(
1
-
0.2
)
×
0.35
0.3
+
0.7
2
]
]
=
[
[
0.445,0.495
]
,
[
0.735,0.785
]
]
=
〈
[
0.445,0.495
]
,
[
1
-
0.785,1
-
0.735
]
〉
=
〈
[
0.445,0.495
]
,
[
0.215,0.265
]
〉
,
IVIFW
A
w
(
a
21
,
a
22
,
a
23
,
a
24
)
=
[
[
0.560,0.660
]
,
[
0.635,0.87
]
]
=
〈
[
0.560,0.660
]
,
[
0.13,0.365
]
〉
,
IVIFW
A
w
(
a
31
,
a
32
,
a
33
,
a
34
)
=
[
[
0.515,0.615
]
,
[
0.695,0.830
]
]
=
〈
[
0.515,0.615
]
,
[
0.170,0.305
]
〉
,
IVIFW
A
w
(
a
41
,
a
42
,
a
43
,
a
44
)
=
[
[
0.578,0.648
]
,
[
0.743,0.813
]
]
=
〈
[
0.578,0.648
]
,
[
0.187,0.257
]
〉
.
According to Definitions 5 and 6,
(69)
L
(
IVIFW
A
w
(
a
11
,
a
12
,
a
13
,
a
14
)
)
=
0.343
,
L
(
IVIFW
A
w
(
a
21
,
a
22
,
a
23
,
a
24
)
)
=
0.519
,
L
(
IVIFW
A
w
(
a
31
,
a
32
,
a
33
,
a
34
)
)
=
0.486
,
L
(
IVIFW
A
w
(
a
41
,
a
42
,
a
43
,
a
44
)
)
=
0.528
.
So a
4
≻
a
2
≻
a
3
≻
a
1 and the best optimal one is a
4. The ranking here is the same as the result using the GHIVIFNAWA and GHIVIFNAWA operators.According to the calculation results, although the existing method can produce the same result as the proposed method, the method being compared has a problem that how to transform HIVIFNs to IVIFNs in the first step could avoid information loss in the process of transformation. By contrast, the proposed approach based on differentt-conorms and t-norms can be used to deal with different relationships among the aggregated arguments, could handle MCDM problems in a flexible and objective manner under hesitant interval-valued intuitionistic fuzzy environment, and can provide more choices for decision-makers. Additionally, different t-conorms and t-norms and aggregation operators could be chosen in the practical decision-making process. At the same time, different results may be produced, which reflected the preferences of decision-makers. Therefore, the developed approach can produce better results than the existing method.


## 6. Conclusion

HFSs are the extension of traditional fuzzy sets, and their membership degree of an element is a set of several possible values between 0 and 1. IVIFSs can describe the fuzzy concept “neither this nor that,” and the membership degrees and nonmembership degrees of IVIFSs are not only real numbers but interval values, respectively. Precise numerical values in HFSs can be replaced by IVIFSs, which provide more preference information for decision-makers. In this paper, the definition of HIVIFSs was developed and applied to the MCDM problems, in which the evaluation values of alternatives on criteria were expressed with HIVIFNs. Furthermore, based ont-conorms and t-norms, some aggregation operators, namely, the HIVIFNWA and HIVIFNWG, HIVIFNWAA and HIVIFNWGA, and GHIVIFNWA and GHIVIFNWG operators, were proposed, respectively. Their properties were discussed in detail as well. In particular, the corresponding hesitant interval-valued intuitionistic fuzzy algebraic aggregation operators based on algebraic t-conorm and t-norm and hesitant interval-valued intuitionistic fuzzy Einstein aggregation operators based on Einstein t-conorm and t-norm were presented. In addition, different aggregation operators were utilized to fuse the hesitant interval-valued intuitionistic fuzzy information to get the overall HIVIFNs of alternatives and the ranking of all given alternatives. At last, the example was presented to illustrate the fuzzy decision-making process, and the sensitivity analysis and comparison analysis were conducted to enrich the paper. The prominent feature of the proposed method is that it could provide a useful and flexible way to efficiently facilitate decision-makers under a hesitant interval-valued intuitionistic fuzzy environment, and the related calculations are simple. Hence, it has enriched and developed the theories and methods of MCDM problems and also has provided a new idea for solving MCDM problems. In the future research, the distance and similarity measure of HIVIFSs will be studied to solve MCDM problems.



---

*Source: 868515-2014-03-27.xml*