# Generalized Grey Target Decision Method for Mixed Attributes Based on Connection Number

Authors: Jinshan Ma; Changsheng Ji
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

Grey target decision model for mixed attributes including real numbers, interval numbers, triangular fuzzy numbers, and trapezoidal fuzzy numbers is complex for its data processing in different ways and information distortion in handling fuzzy numbers. To solve these problems, the binary connection number proposed in set pair analysis is applied to unify different types of index values with their parameters’ average values and standard deviations as determinacy-uncertainty vectors. Then the target center index vectors are determined by the modules of index vectors of all alternatives under different attributes. So the similarity of each index vector and its target center index vector called nearness degree can be calculated. Following, all the nearness degrees are normalized in linear method in order to be compared with each other. Finally, the optimal alternative can be determined by the minimum of all integrated nearness degrees. Case study demonstrated that this approach can not only unify different types of numbers, and simplify the calculation but also reduce the information distortion in operating fuzzy numbers.


---

## Body

## 1. Introduction

The grey target decision method has been widely used in many fields since Professor Deng established it [1–7]. However grey target decision method involving mixed attributes including real numbers, interval numbers, triangular fuzzy numbers, and trapezoidal fuzzy numbers is hard to deal with. Mixed attributes based decision making by the reported grey target decision method depends on the following steps: first, normalize different types of numbers individually; second, obtain the target center indices; third, calculate every alternative’s distance to the target center; finally, make decision by alternatives’ target center distances [8–11]. As far as the reported method is concerned, it is complex for different data processing ways. Besides it has deficiency in handling fuzzy numbers in two aspects: one is for distorting the information of the fuzzy numbers while normalizing them and the other is for enlarging the uncertainty between the fuzzy numbers when computing the alternatives’ distances to target center. Thus an approach is required urgently to simplify the calculation, reduce the information distortion, and lower the uncertainty in dealing with fuzzy numbers. So the binary A
+
B
i connection number proposed in set pair analysis (SPA) is employed to conduct this work [12, 13]. The average values and standard deviations of all the index values of different types of numbers can be regarded as binary connection numbers’ deterministic and uncertain terms. Furthermore these binary connection numbers can also be thought as the determinacy-uncertainty vectors. Based on the special vectors and the similarity theory, the generalized grey target decision model can be constructed.Evaluating feasible alternatives may have no criterions, which is a challenging task to the decision makers. However, grey target decision method provides the decision makers a useful tool to solve this problem. Though grey target decision method has been advanced by some scholars, the method handling mixed attributes including real numbers and fuzzy numbers needs to be further studied. The proposed approach unifies the calculation ways of different types of numbers with binary connection number, does not normalize the raw data of all alternatives, and calculates alternatives’ nearness degrees instead of target center distances, as is superior in theory and in practice. So the proposed approach unifying the calculation ways, reducing the information distortion, and lowering the uncertainty in operating the fuzzy numbers may have wide use in decision making.The remainder of this paper is organized as follows. Some basic concepts about the proposed approach are given in Section2. Section 3 discusses the proposed approach. And the case study is presented in Section 4. Finally, Section 5 gives the conclusions.


## 2. Preliminaries

### 2.1. Fuzzy Number

The index values of all alternatives may be real numbers or fuzzy numbers for optimal decision making. The fuzzy number is more meaningful than that of real number, and this paper only involves interval number, triangular fuzzy number, and trapezoidal fuzzy number [14–19].Definition 1.
LetR be a set of real numbers; if x
~
=
[
x
-
,
x
+
], then x
~ is called interval number, where x
-, x
+
∈
R, x
-
<
x
+.Definition 2.
LetR be a set of real numbers; if x
~
=
[
x
L
,
x
M
,
x
N
], then x
~ is called triangular fuzzy number, where x
L
,
x
M
,
x
N
∈
R, 0
<
x
L
<
x
M
<
x
N
,
x
L, and x
N are the triangular fuzzy number’s lower limits and upper limits, respectively, while x
M is the medium value.Definition 3.
LetR be a set of real numbers; if x
~
=
[
x
L
,
x
M
,
x
N
,
x
U
], then x
~ is called trapezoidal fuzzy number, where x
L
,
x
M
,
x
N
,
x
U
∈
R, 0
<
x
L
<
x
M
<
x
N
<
x
U
,
x
L, and x
U are the trapezoidal fuzzy number’s lower limits and upper limits, respectively, while [
x
M
,
x
N
] is the medium interval.


### 2.2. Connection Number

The connection number is a key concept in set pair analysis founded by Zhao in 1989. It unifies the related two sets with identity, discrepancy, and contrary [12, 13]. Now, the connection number has been used in many fields such as artificial intelligence. And the binary connection number considering the determinacy and uncertainty about two sets has also been widely used [20].Definition 4.
LetR be a set of real numbers; then A
+
B
i is called binary connection number, where A, B
∈
R
,
i
∈
[
-
1,1
], A denotes the deterministic term, B denotes the uncertain term, and i is a variable term unifying the determinacy and the uncertainty of a set pair.


### 2.3. Transform Fuzzy Number into Connection Number

Zhao proposed that a fuzzy number with uncertainty can be expressed as a binary connection number. In Zhao’s viewpoint, the average value and standard deviation in statistics are also the parameters of fuzzy numbers (interval number, triangular fuzzy number, or trapezoidal fuzzy number). Thus, the fuzzy number can be characterized as the binary “average value + standard deviation” connection number [14].Supposex
~ is a fuzzy number (interval number, triangular fuzzy number, or trapezoidal fuzzy number); if its parameters can be seen as n (n
≥
2) observed values, then the fuzzy number’s average value and standard deviation are as follows:
(1)
x
¯
=
1
n
∑
t
=
1
n
x
t
,
s
=
1
(
n
-
1
)
∑
t
=
1
n
(
x
t
-
x
¯
)
2
.According to the SPA, the average valuex
¯ and the standard deviation s reflect 2 parameters of n observed values for the same object x, so they can be regarded as the related two sets and form the set pair H
=
(
x
¯
,
s
), where x
¯ and s can also be thought as the relative deterministic (concentration) measure and the relative uncertain (dispersion) measure of n observed values about x. So H
=
(
x
¯
,
s
) is a determinacy-uncertainty set pair and the relationship of x
¯ and s denoted by the binary connection number A
+
B
i.Definition 5.
Letx
¯ and s be the average value and the standard deviation of n (n
≥
2) observed values of the same object x, respectively; then
(2)
u
(
x
¯
,
s
)
=
A
+
B
i
=
x
¯
+
s
i
(
i
∈
[
-
1,1
]
)
is called the average value-standard deviation connection number of n observed value of the object x or connection number for short.Definition 6.
The mutual interaction ofx
¯ and s of the average value-standard deviation connection number u
(
x
¯
,
s
) can be mapped to the binary determinacy-uncertainty space (D-U space) based on SPA. If u
(
x
¯
,
s
)
=
x
¯
+
s
i represents the vector in the D-U space, then the “i” only denotes the signal of the uncertain term without representing the variable value.Figure1 is a D-U space. The U axis represents the relative uncertain measure, while the D axis is the relative deterministic measure. Seen from Figure 1, x
¯ and s interact with each other, and the space reflection is the vector O
E
¯ from O to E, and the degree of interaction means the module of the vector O
E
¯ denoted by r [14].Figure 1
Determinacy-uncertainty space.


### 2.4. Similarity Measure between Vectors

Measure between vectors includes distance method [21] and similarity method [22], and this paper only refers to the latter.Definition 7.
LetX
=
(
x
1
,
x
2
,
…
,
x
n
) be a vector; then
(3)
|
X
|
=
∑
t
=
1
n
x
t
2
is called the module of X.Definition 8.
LetX
=
(
x
1
,
x
2
,
…
,
x
n
) and Y
=
(
y
1
,
y
2
,
…
,
y
n
) be two vectors; then
(4)
sim
(
X
,
Y
)
=
cos
⁡
(
X
,
Y
)
=
∑
t
=
1
n
x
t
y
t
∑
t
=
1
n
x
t
2
∑
t
=
1
n
y
t
2
is the cosine of X and Y. The cosine value reflects the similarity of X and Y, and the bigger of the cosine value is the more similarity of them.Definition 9.
LetX
=
(
x
1
,
x
2
,
…
,
x
n
) and Y
=
(
y
1
,
y
2
,
…
,
y
n
) be two vectors; then
(5)
Pr
j
Y
(
X
)
=
∑
t
=
1
n
x
t
y
t
∑
t
=
1
n
x
t
2
∑
t
=
1
n
y
t
2
∑
t
=
1
n
x
t
2
=
∑
t
=
1
n
x
t
y
t
∑
t
=
1
n
y
t
2
is the projection of X on Y. Obviously, the bigger value of Pr
j
Y
(
X
) is the more similarity between X and Y [23].


### 2.5. Grey Target Decision Method and Its Generalized Method

Seeking for the satisfied alternative is the essence of grey target decision method. Actually, it is impossible to obtain the absolute optimal alternative, so the satisfied one is accepted. The definitions of grey target decision method and its generalized method are as follows.Definition 10.
When evaluating multiattribute alternatives without standard model, a grey target is set and the target center is derived from it in order to calculate every alternative’s distance to target center for decision making, which is called grey target decision method.Definition 11.
Based on the grey target decision theory, however, the method of procedure and handling technique that is different from the classical one is called generalized grey target decision method. Compared with the traditional model, the generalized method has two differences: needless to normalize the index values and difference of target center distance calculation.The proposed generalized approach for handling mixed attributes has its advantages over the previous reported method. First, it uses the uniform way to handle different types of numbers, which is easy to operate for decision makers. Second, it will reduce the information distortion in normalizing the fuzzy numbers and lower the uncertainty in calculating the target center distances, which may improve the accuracy of decision making. Third, the proposed approach which is a generalized method can be further improved and applied in a wide range fields. The generalized grey target decision method based on connection number will be presented next. However, the interested readers who want to learn the previous reported method can see the literature [8–11, 24].


## 2.1. Fuzzy Number

The index values of all alternatives may be real numbers or fuzzy numbers for optimal decision making. The fuzzy number is more meaningful than that of real number, and this paper only involves interval number, triangular fuzzy number, and trapezoidal fuzzy number [14–19].Definition 1.
LetR be a set of real numbers; if x
~
=
[
x
-
,
x
+
], then x
~ is called interval number, where x
-, x
+
∈
R, x
-
<
x
+.Definition 2.
LetR be a set of real numbers; if x
~
=
[
x
L
,
x
M
,
x
N
], then x
~ is called triangular fuzzy number, where x
L
,
x
M
,
x
N
∈
R, 0
<
x
L
<
x
M
<
x
N
,
x
L, and x
N are the triangular fuzzy number’s lower limits and upper limits, respectively, while x
M is the medium value.Definition 3.
LetR be a set of real numbers; if x
~
=
[
x
L
,
x
M
,
x
N
,
x
U
], then x
~ is called trapezoidal fuzzy number, where x
L
,
x
M
,
x
N
,
x
U
∈
R, 0
<
x
L
<
x
M
<
x
N
<
x
U
,
x
L, and x
U are the trapezoidal fuzzy number’s lower limits and upper limits, respectively, while [
x
M
,
x
N
] is the medium interval.


## 2.2. Connection Number

The connection number is a key concept in set pair analysis founded by Zhao in 1989. It unifies the related two sets with identity, discrepancy, and contrary [12, 13]. Now, the connection number has been used in many fields such as artificial intelligence. And the binary connection number considering the determinacy and uncertainty about two sets has also been widely used [20].Definition 4.
LetR be a set of real numbers; then A
+
B
i is called binary connection number, where A, B
∈
R
,
i
∈
[
-
1,1
], A denotes the deterministic term, B denotes the uncertain term, and i is a variable term unifying the determinacy and the uncertainty of a set pair.


## 2.3. Transform Fuzzy Number into Connection Number

Zhao proposed that a fuzzy number with uncertainty can be expressed as a binary connection number. In Zhao’s viewpoint, the average value and standard deviation in statistics are also the parameters of fuzzy numbers (interval number, triangular fuzzy number, or trapezoidal fuzzy number). Thus, the fuzzy number can be characterized as the binary “average value + standard deviation” connection number [14].Supposex
~ is a fuzzy number (interval number, triangular fuzzy number, or trapezoidal fuzzy number); if its parameters can be seen as n (n
≥
2) observed values, then the fuzzy number’s average value and standard deviation are as follows:
(1)
x
¯
=
1
n
∑
t
=
1
n
x
t
,
s
=
1
(
n
-
1
)
∑
t
=
1
n
(
x
t
-
x
¯
)
2
.According to the SPA, the average valuex
¯ and the standard deviation s reflect 2 parameters of n observed values for the same object x, so they can be regarded as the related two sets and form the set pair H
=
(
x
¯
,
s
), where x
¯ and s can also be thought as the relative deterministic (concentration) measure and the relative uncertain (dispersion) measure of n observed values about x. So H
=
(
x
¯
,
s
) is a determinacy-uncertainty set pair and the relationship of x
¯ and s denoted by the binary connection number A
+
B
i.Definition 5.
Letx
¯ and s be the average value and the standard deviation of n (n
≥
2) observed values of the same object x, respectively; then
(2)
u
(
x
¯
,
s
)
=
A
+
B
i
=
x
¯
+
s
i
(
i
∈
[
-
1,1
]
)
is called the average value-standard deviation connection number of n observed value of the object x or connection number for short.Definition 6.
The mutual interaction ofx
¯ and s of the average value-standard deviation connection number u
(
x
¯
,
s
) can be mapped to the binary determinacy-uncertainty space (D-U space) based on SPA. If u
(
x
¯
,
s
)
=
x
¯
+
s
i represents the vector in the D-U space, then the “i” only denotes the signal of the uncertain term without representing the variable value.Figure1 is a D-U space. The U axis represents the relative uncertain measure, while the D axis is the relative deterministic measure. Seen from Figure 1, x
¯ and s interact with each other, and the space reflection is the vector O
E
¯ from O to E, and the degree of interaction means the module of the vector O
E
¯ denoted by r [14].Figure 1
Determinacy-uncertainty space.


## 2.4. Similarity Measure between Vectors

Measure between vectors includes distance method [21] and similarity method [22], and this paper only refers to the latter.Definition 7.
LetX
=
(
x
1
,
x
2
,
…
,
x
n
) be a vector; then
(3)
|
X
|
=
∑
t
=
1
n
x
t
2
is called the module of X.Definition 8.
LetX
=
(
x
1
,
x
2
,
…
,
x
n
) and Y
=
(
y
1
,
y
2
,
…
,
y
n
) be two vectors; then
(4)
sim
(
X
,
Y
)
=
cos
⁡
(
X
,
Y
)
=
∑
t
=
1
n
x
t
y
t
∑
t
=
1
n
x
t
2
∑
t
=
1
n
y
t
2
is the cosine of X and Y. The cosine value reflects the similarity of X and Y, and the bigger of the cosine value is the more similarity of them.Definition 9.
LetX
=
(
x
1
,
x
2
,
…
,
x
n
) and Y
=
(
y
1
,
y
2
,
…
,
y
n
) be two vectors; then
(5)
Pr
j
Y
(
X
)
=
∑
t
=
1
n
x
t
y
t
∑
t
=
1
n
x
t
2
∑
t
=
1
n
y
t
2
∑
t
=
1
n
x
t
2
=
∑
t
=
1
n
x
t
y
t
∑
t
=
1
n
y
t
2
is the projection of X on Y. Obviously, the bigger value of Pr
j
Y
(
X
) is the more similarity between X and Y [23].


## 2.5. Grey Target Decision Method and Its Generalized Method

Seeking for the satisfied alternative is the essence of grey target decision method. Actually, it is impossible to obtain the absolute optimal alternative, so the satisfied one is accepted. The definitions of grey target decision method and its generalized method are as follows.Definition 10.
When evaluating multiattribute alternatives without standard model, a grey target is set and the target center is derived from it in order to calculate every alternative’s distance to target center for decision making, which is called grey target decision method.Definition 11.
Based on the grey target decision theory, however, the method of procedure and handling technique that is different from the classical one is called generalized grey target decision method. Compared with the traditional model, the generalized method has two differences: needless to normalize the index values and difference of target center distance calculation.The proposed generalized approach for handling mixed attributes has its advantages over the previous reported method. First, it uses the uniform way to handle different types of numbers, which is easy to operate for decision makers. Second, it will reduce the information distortion in normalizing the fuzzy numbers and lower the uncertainty in calculating the target center distances, which may improve the accuracy of decision making. Third, the proposed approach which is a generalized method can be further improved and applied in a wide range fields. The generalized grey target decision method based on connection number will be presented next. However, the interested readers who want to learn the previous reported method can see the literature [8–11, 24].


## 3. Generalized Grey Target Decision Method for Mixed Attributes

In this section, the basic work for constructing the generalized grey target decision model is first conducted and then the algorithm of the approach is concluded.


### 3.1. Transform Index Values into Connection Numbers

LetC
=
{
C
1
,
C
2
,
…
,
C
n
} be an alternative set and let A
=
{
A
1
,
A
2
,
…
,
A
m
} be an attribute set; then the index of alternative C
s under attribute A
t is v
s
t (s
=
1,2
,
…
,
n; t
=
1,2
,
…
,
m). Here the mixed attributes may be expressed as real numbers and fuzzy numbers. And the benefit type index set and cost type index set are denoted by J
+ and J
-, respectively.Using the equations from (1) to (2), the different types of index values can be converted into binary A
+
B
i connection numbers thought as the vectors in the D-U space. Note that the converted binary connection number for real number is the form A
+
0
i, which means the deterministic term is the real number itself and the uncertain term is 0
i. The transformed index vector can be expressed as
(6)
U
s
t
=
A
s
t
+
B
s
t
i
(
s
=
1,2
,
…
,
n
;
t
=
1,2
,
…
,
m
)
,
where A
s
t and B
s
t denote the average value and standard deviation of v
s
t, respectively. And the module of U
s
t can be calculated using the following equation:
(7)
|
U
s
t
|
=
A
s
t
2
+
B
s
t
2
(
s
=
1,2
,
…
,
n
;
t
=
1,2
,
…
,
m
)
.


### 3.2. Determine the Target Center Index Vectors

Having got the binary connection numbers converted from all index values using (6), the target center index vectors can be determined according to the following equation:
(8)
C
t
0
=
{
{
U
s
t
∣
max
⁡
{
|
U
s
t
|
}
,
U
s
t
∈
J
+
}
{
U
s
t
∣
min
⁡
{
|
U
s
t
|
}
,
U
s
t
∈
J
-
}
,
m
m
s
=
1,2
,
…
,
n
,
t
=
1,2
,
…
,
m
.However, if the index vectors corresponding tomax
⁡
{
|
U
s
t
|
} or min
⁡
{
|
U
s
t
|
} are not unique, then choose the vector with the minimum uncertain term B
s
t
i of U
s
t such that min
⁡
{
|
B
s
t
|
} is target center index vector. The equation is as follows:
(9)
C
t
0
=
{
{
U
s
t
∣
max
⁡
{
|
U
s
t
|
}
,
min
⁡
{
|
B
s
t
|
}
,
U
s
t
∈
J
+
}
{
U
s
t
∣
min
⁡
{
|
U
s
t
|
}
,
min
⁡
{
|
B
s
t
|
}
,
U
s
t
∈
J
-
}
,
m
m
m
m
m
m
m
m
s
=
1,2
,
…
,
n
,
t
=
1,2
,
…
,
m
.Equations (8) and (9) tell that the target center index vector under attribute t is that the index vector with the maximum module for benefit type indices and that with the minimum module for cost type indices. However, if the vectors to the maximum or the minimum module are not unique, the target center index vector is the one with the minimum uncertain term of these index vectors.


### 3.3. Nearness Degrees Calculation

(1) The Deficiency of Using Distance to Measure the Fuzzy Numbers. The decision making may not be as accurate as expected with the fuzzy numbers operated by distance which actually enlarges the uncertainty of them. Two aspects lead to the uncertainty: one is the information distortion when normalizing the fuzzy numbers, and the other is the operation of calculating the distances between the fuzzy numbers. However, the measure of the fuzzy numbers by vector similarity is superior to that by distance in theory for it is not normalizing the fuzzy numbers and also considering the fuzzy number’s determinacy-uncertainty with connection number.(2) Method Selection for the Similarity between Vectors. The cosine value reflects the similarity of the two vectors. Taking the vectors X and Y for an example, the bigger the value is, the more the similarity of the two vectors is. Due to the gap difference of index vectors for each attribute, the similarity between the vectors cannot always be done well only by cosine value. And the vector projection method also has its disadvantage. Figure 2 illustrates the use of cosine value and vector projection.Figure 2
The relationship of different types of index vectors and the baseline index vector.Figure2 is a D-U space. In the D-U space, O
E
¯ is a baseline vector (target center index vector), O
B
¯ has the angle 0 with O
E
¯, O
M
¯ is an entirely deterministic vector, and O
N
¯ has a small angle with O
E
¯. Judging from the cosine value, O
B
¯ is the nearest to O
E
¯, O
N
¯ is nearer to O
E
¯, and O
M
¯ is the furthest to O
E
¯. But this relationship does not reflect the different indices near the target center index. So the vectors O
M
¯, O
N
¯, and O
B
¯ should be projected to the baseline vector O
E
¯ with the points M
1, N
1, and B, respectively. Thus each index near the target center index can be decided by the projection values, O
N
¯ is the nearest to O
E
¯, O
M
¯ is nearer to O
E
¯, and O
B
¯ is the furthest to O
E
¯. Note that the above conclusion using projection values to judge the indices’ distances performs well only when all the projection values are smaller than the module of the baseline vector. In Figure 2, if O
B
¯ is the baseline vector, then the vectors O
M
¯, O
N
¯, and O
E
¯ can be projected to O
B
¯ with the points M
1, N
1, and E, respectively (the points M
1, N
1, and E can be seen as on the extended line of O
B
¯). Then the projection value of O
E
¯ on O
B
¯ is the biggest among the projections, but the index distance between O
E
¯ and O
B
¯ is the furthest. So the effective method must be provided to conduct this work.(3) Effective Method for Measuring the Similarity between Vectors. A new method was proposed to overcome the cosine value method and the projection value method cannot effectively solve the problem shown above. First, each index vector must be projected to the baseline vector, so the projection value can be obtained. Then, the distance between the module of baseline vector and the projection value can be calculated. And the special distance can be used to judge the distance of the two indices [25].Definition 12.
Supposer is the module of the vector Y and p
r is the projection value of the vector X on the vector Y; then
(10)
d
n
=
|
r
-
p
r
|
is the distance of projection value p
r and the module r of the vector Y is called nearness degree. When the baseline index vector and the index vector are all transformed from real numbers, d
n is degraded to Hamming distance.


### 3.4. Nearness Degrees Normalization

The index values of all alternatives are not normalized; thus the nearness degrees of all index values under different attributes cannot be compared with each other directly, so the nearness degreed
s
t must be normalized. The linear normalized method is adopted to keep the information of nearness degrees (generalized target center distances). The normalized nearness degree Z
s
t can be obtained by the following equation:
(11)
Z
s
t
=
d
s
t
∑
s
=
1
n
d
s
t
,
s
=
1
,
…
,
n
;
t
=
1
,
…
,
m
,
where d
s
t and Z
s
t denote the nearness degree and normalized nearness degree of v
s
t, respectively and d
s
t is calculated by (10).


### 3.5. Weights Determination

The weights of all attributes can be determined by the deviation of the normalized nearness degrees objectively. The weight model is as follows [26].For any two alternativesC
s and C
t, under the attribute j, the deviation of nearness degree is denoted by z
s
t
j
=
z
s
j
-
z
t
j; thus all the deviations of all alternatives under attribute j are as follows:
(12)
z
j
=
∑
s
=
1
n
-
1
∑
t
=
s
+
1
n
z
s
j
=
∑
s
=
1
n
-
1
∑
t
=
s
+
1
n
(
z
s
j
-
z
i
j
)
.The attribute weights can be obtained through maximizing the entire deviations, so the following model can be constructed:(13)
max
⁡
f
=
∑
j
=
1
m
z
j
ω
j
1
/
2
s
.
t
.
m
∑
j
=
1
m
ω
j
=
1
,
ω
j
≥
0
,
j
=
1
,
…
,
m
.To solve the nonlinear program (13) via the Lagrange function, the weights can be obtained as follows:
(14)
ω
j
=
z
j
2
∑
j
=
1
m
z
j
2
,
j
=
1,2
,
…
,
m
,
where ω
j is the weight of attribute j.


### 3.6. Decision Making

Every alternative’s integrated nearness degree can be aggregated with every attribute’s weight; the equation is as follows:(15)
w
i
=
ω
j
z
i
j
,
i
=
1
,
…
,
n
,
j
=
1
,
…
,
m
.So the decision making can be obtained according to the valuew
i; and the smaller value of it means the better alternative.


### 3.7. Algorithm of the Proposed Approach

The algorithm of the proposed approach includes the following steps.Step 1 (measure all the feasible alternatives).
The measures of feasible alternatives could be expressed as real numbers or fuzzy numbers appropriately by decision makers.Step 2 (transform index values of all alternatives into connection numbers).
The average values and standard deviations of all alternatives’ indices with different types of numbers can be computed and converted into the binaryA
+
B
i connection numbers using (1) and (2).Step 3 (determine the target center index vectors).
The target center index vectors can be determined by comparing with the modules of index vectors of all alternatives under different attributes using (7) and (8) or (9).Step 4 (calculate the nearness degrees).
The nearness degree of every alternative’s index vector to target center index vector can be calculated using (10).Step 5 (normalize the nearness degrees).
The nearness degree of every alternative’s index vector to its target center index vector can be calculated using (11).Step 6 (determine the weights of attributes).
The weights may be determined by objective method or subjective method; if the subjective method is selected, then the equations from (12) to (14) perform well.Step 7.
Aggregate the normalized nearness degrees under all attributes and the relative optimal alternative can be obtained by the minimum integrated nearness degree considering every attribute’s weight use (15).


## 3.1. Transform Index Values into Connection Numbers

LetC
=
{
C
1
,
C
2
,
…
,
C
n
} be an alternative set and let A
=
{
A
1
,
A
2
,
…
,
A
m
} be an attribute set; then the index of alternative C
s under attribute A
t is v
s
t (s
=
1,2
,
…
,
n; t
=
1,2
,
…
,
m). Here the mixed attributes may be expressed as real numbers and fuzzy numbers. And the benefit type index set and cost type index set are denoted by J
+ and J
-, respectively.Using the equations from (1) to (2), the different types of index values can be converted into binary A
+
B
i connection numbers thought as the vectors in the D-U space. Note that the converted binary connection number for real number is the form A
+
0
i, which means the deterministic term is the real number itself and the uncertain term is 0
i. The transformed index vector can be expressed as
(6)
U
s
t
=
A
s
t
+
B
s
t
i
(
s
=
1,2
,
…
,
n
;
t
=
1,2
,
…
,
m
)
,
where A
s
t and B
s
t denote the average value and standard deviation of v
s
t, respectively. And the module of U
s
t can be calculated using the following equation:
(7)
|
U
s
t
|
=
A
s
t
2
+
B
s
t
2
(
s
=
1,2
,
…
,
n
;
t
=
1,2
,
…
,
m
)
.


## 3.2. Determine the Target Center Index Vectors

Having got the binary connection numbers converted from all index values using (6), the target center index vectors can be determined according to the following equation:
(8)
C
t
0
=
{
{
U
s
t
∣
max
⁡
{
|
U
s
t
|
}
,
U
s
t
∈
J
+
}
{
U
s
t
∣
min
⁡
{
|
U
s
t
|
}
,
U
s
t
∈
J
-
}
,
m
m
s
=
1,2
,
…
,
n
,
t
=
1,2
,
…
,
m
.However, if the index vectors corresponding tomax
⁡
{
|
U
s
t
|
} or min
⁡
{
|
U
s
t
|
} are not unique, then choose the vector with the minimum uncertain term B
s
t
i of U
s
t such that min
⁡
{
|
B
s
t
|
} is target center index vector. The equation is as follows:
(9)
C
t
0
=
{
{
U
s
t
∣
max
⁡
{
|
U
s
t
|
}
,
min
⁡
{
|
B
s
t
|
}
,
U
s
t
∈
J
+
}
{
U
s
t
∣
min
⁡
{
|
U
s
t
|
}
,
min
⁡
{
|
B
s
t
|
}
,
U
s
t
∈
J
-
}
,
m
m
m
m
m
m
m
m
s
=
1,2
,
…
,
n
,
t
=
1,2
,
…
,
m
.Equations (8) and (9) tell that the target center index vector under attribute t is that the index vector with the maximum module for benefit type indices and that with the minimum module for cost type indices. However, if the vectors to the maximum or the minimum module are not unique, the target center index vector is the one with the minimum uncertain term of these index vectors.


## 3.3. Nearness Degrees Calculation

(1) The Deficiency of Using Distance to Measure the Fuzzy Numbers. The decision making may not be as accurate as expected with the fuzzy numbers operated by distance which actually enlarges the uncertainty of them. Two aspects lead to the uncertainty: one is the information distortion when normalizing the fuzzy numbers, and the other is the operation of calculating the distances between the fuzzy numbers. However, the measure of the fuzzy numbers by vector similarity is superior to that by distance in theory for it is not normalizing the fuzzy numbers and also considering the fuzzy number’s determinacy-uncertainty with connection number.(2) Method Selection for the Similarity between Vectors. The cosine value reflects the similarity of the two vectors. Taking the vectors X and Y for an example, the bigger the value is, the more the similarity of the two vectors is. Due to the gap difference of index vectors for each attribute, the similarity between the vectors cannot always be done well only by cosine value. And the vector projection method also has its disadvantage. Figure 2 illustrates the use of cosine value and vector projection.Figure 2
The relationship of different types of index vectors and the baseline index vector.Figure2 is a D-U space. In the D-U space, O
E
¯ is a baseline vector (target center index vector), O
B
¯ has the angle 0 with O
E
¯, O
M
¯ is an entirely deterministic vector, and O
N
¯ has a small angle with O
E
¯. Judging from the cosine value, O
B
¯ is the nearest to O
E
¯, O
N
¯ is nearer to O
E
¯, and O
M
¯ is the furthest to O
E
¯. But this relationship does not reflect the different indices near the target center index. So the vectors O
M
¯, O
N
¯, and O
B
¯ should be projected to the baseline vector O
E
¯ with the points M
1, N
1, and B, respectively. Thus each index near the target center index can be decided by the projection values, O
N
¯ is the nearest to O
E
¯, O
M
¯ is nearer to O
E
¯, and O
B
¯ is the furthest to O
E
¯. Note that the above conclusion using projection values to judge the indices’ distances performs well only when all the projection values are smaller than the module of the baseline vector. In Figure 2, if O
B
¯ is the baseline vector, then the vectors O
M
¯, O
N
¯, and O
E
¯ can be projected to O
B
¯ with the points M
1, N
1, and E, respectively (the points M
1, N
1, and E can be seen as on the extended line of O
B
¯). Then the projection value of O
E
¯ on O
B
¯ is the biggest among the projections, but the index distance between O
E
¯ and O
B
¯ is the furthest. So the effective method must be provided to conduct this work.(3) Effective Method for Measuring the Similarity between Vectors. A new method was proposed to overcome the cosine value method and the projection value method cannot effectively solve the problem shown above. First, each index vector must be projected to the baseline vector, so the projection value can be obtained. Then, the distance between the module of baseline vector and the projection value can be calculated. And the special distance can be used to judge the distance of the two indices [25].Definition 12.
Supposer is the module of the vector Y and p
r is the projection value of the vector X on the vector Y; then
(10)
d
n
=
|
r
-
p
r
|
is the distance of projection value p
r and the module r of the vector Y is called nearness degree. When the baseline index vector and the index vector are all transformed from real numbers, d
n is degraded to Hamming distance.


## 3.4. Nearness Degrees Normalization

The index values of all alternatives are not normalized; thus the nearness degrees of all index values under different attributes cannot be compared with each other directly, so the nearness degreed
s
t must be normalized. The linear normalized method is adopted to keep the information of nearness degrees (generalized target center distances). The normalized nearness degree Z
s
t can be obtained by the following equation:
(11)
Z
s
t
=
d
s
t
∑
s
=
1
n
d
s
t
,
s
=
1
,
…
,
n
;
t
=
1
,
…
,
m
,
where d
s
t and Z
s
t denote the nearness degree and normalized nearness degree of v
s
t, respectively and d
s
t is calculated by (10).


## 3.5. Weights Determination

The weights of all attributes can be determined by the deviation of the normalized nearness degrees objectively. The weight model is as follows [26].For any two alternativesC
s and C
t, under the attribute j, the deviation of nearness degree is denoted by z
s
t
j
=
z
s
j
-
z
t
j; thus all the deviations of all alternatives under attribute j are as follows:
(12)
z
j
=
∑
s
=
1
n
-
1
∑
t
=
s
+
1
n
z
s
j
=
∑
s
=
1
n
-
1
∑
t
=
s
+
1
n
(
z
s
j
-
z
i
j
)
.The attribute weights can be obtained through maximizing the entire deviations, so the following model can be constructed:(13)
max
⁡
f
=
∑
j
=
1
m
z
j
ω
j
1
/
2
s
.
t
.
m
∑
j
=
1
m
ω
j
=
1
,
ω
j
≥
0
,
j
=
1
,
…
,
m
.To solve the nonlinear program (13) via the Lagrange function, the weights can be obtained as follows:
(14)
ω
j
=
z
j
2
∑
j
=
1
m
z
j
2
,
j
=
1,2
,
…
,
m
,
where ω
j is the weight of attribute j.


## 3.6. Decision Making

Every alternative’s integrated nearness degree can be aggregated with every attribute’s weight; the equation is as follows:(15)
w
i
=
ω
j
z
i
j
,
i
=
1
,
…
,
n
,
j
=
1
,
…
,
m
.So the decision making can be obtained according to the valuew
i; and the smaller value of it means the better alternative.


## 3.7. Algorithm of the Proposed Approach

The algorithm of the proposed approach includes the following steps.Step 1 (measure all the feasible alternatives).
The measures of feasible alternatives could be expressed as real numbers or fuzzy numbers appropriately by decision makers.Step 2 (transform index values of all alternatives into connection numbers).
The average values and standard deviations of all alternatives’ indices with different types of numbers can be computed and converted into the binaryA
+
B
i connection numbers using (1) and (2).Step 3 (determine the target center index vectors).
The target center index vectors can be determined by comparing with the modules of index vectors of all alternatives under different attributes using (7) and (8) or (9).Step 4 (calculate the nearness degrees).
The nearness degree of every alternative’s index vector to target center index vector can be calculated using (10).Step 5 (normalize the nearness degrees).
The nearness degree of every alternative’s index vector to its target center index vector can be calculated using (11).Step 6 (determine the weights of attributes).
The weights may be determined by objective method or subjective method; if the subjective method is selected, then the equations from (12) to (14) perform well.Step 7.
Aggregate the normalized nearness degrees under all attributes and the relative optimal alternative can be obtained by the minimum integrated nearness degree considering every attribute’s weight use (15).


## 4. Case Study

### 4.1. Background

In order to exemplify the proposed generalized grey target decision method, the data are derived from the literature [8] and the results are also compared with those of the literature [8].To evaluate the tactical missiles, six indices, namely, hit accuracy (km), warhead payload (kg), mobility(
km
·
h
-
1
), price (106 g), reliability, and maintainability, are considered denoted by A
1
~
A
6. For all the data type of the attributes, A
1 and A
2 are real numbers, A
3 and A
4 are interval numbers, and A
5 and A
6 are triangular fuzzy numbers. Among these attributes A
1 and A
4 are cost type indices and the others are benefit type indices. There are four feasible alternatives denoted by C
1
~
C
4. The data are shown in Table 1.Table 1
Index values of every alternative.
C
t
A
1
A
2
A
3
A
4
A
5
A
6
C
1
2.0
500
[
55
56
]
[
4.7
5.7
]
[
0.4
0.5
0.6
]
[
0.8
0.9
1.0
]
C
2
2.5
540
[
30
40
]
[
4.2
5.2
]
[
0.2
0.3
0.4
]
[
0.4
0.5
0.6
]
C
3
1.8
480
[
50
60
]
[
5
6
]
[
0.6
0.7
0.8
]
[
0.6
0.7
0.8
]
C
4
2.2
520
[
35
45
]
[
4.5
5.5
]
[
0.4
0.5
0.6
]
[
0.4
0.5
0.6
]


### 4.2. Process to Decision Making

(1) Calculate the Average Value and the Standard Deviation of Every Index. The average value and the standard deviation of every index can be calculated using (1), and the results are shown in Table 2. In Table 2, E
i and s
i
(
i
=
1
,
…
,
4
) represent the ith alternative’s average values and standard deviations of all indices under all attributes. Note that the average values and the standard deviations of real numbers are themselves and 0, respectively.Table 2
The average value and the standard deviation of every index.
A
t
C
1
C
2
C
3
C
4
E
1
S
1
E
2
S
2
E
3
S
3
E
4
S
4
A
1
2.0
0
2.5
0
1.8
0
2.2
0
A
2
500
0
540
0
480
0
520
0
A
3
55.5
0.707107
35
7.071068
55
7.071068
40
7.071068
A
4
5.2
0.707107
4.7
0.707107
5.5
0.707107
5
0.707107
A
5
0.5
0.1
0.3
0.1
0.7
0.1
0.5
0.1
A
6
0.9
0.1
0.5
0.1
0.7
0.1
0.5
0.1(2) Transform Index Values into Binary Connection Numbers. Having got the average value and the standard deviation of every index shown in Table 2, every index value can be transformed into binary connection number using (2), and the results are shown in Table 3. Moreover, every binary connection number in Table 3 can be regarded as a vector in the D-U space. Note that the form of the real number is expressed as the form A
+
0
i (A
∈
R).Table 3
The binary connection numbers transformed from all index values.
A
t
C
1
C
2
C
3
C
4
A
1
2.0
+
0
i
2.5
+
0
i
1.8
+
0
i
2.2
+
0
i
A
2
500
+
0
i
540
+
0
i
480
+
0
i
520
+
0
i
A
3
55.5
+
0.707107
i
35
+
7.0710
68
i
55
+
7.0710
68
i
40
+
7.0710
68
i
A
4
5.2
+
0.707107
i
4.7
+
0.707107
i
5.5
+
0.707107
i
5
+
0.707107
i
A
5
0.5
+
0.1
i
0.3
+
0.1
i
0.7
+
0.1
i
0.5
+
0.1
i
A
6
0.9
+
0.1
i
0.5
+
0.1
i
0.7
+
0.1
i
0.5
+
0.1
i(3) Determine the Target Center Index Vectors. Using (6), (7), and (8) the target center index vectors can be determined by the modules of all index vectors under different attributes, and the results are shown in Table 4. In Table 4, r
t
s (t
=
1,2
,
…
,
6
;
s
=
1
,
…
,
4) denotes the module of every binary connection number vector, while r
0 and C
0 are the desirable (maximum or minimum) modules of different attributes and the target center index vectors, respectively. The target center index vectors of different attributes are determined by the modules of every index vectors. The target center index vector is the one with the maximum module for benefit type attribute, while the target center index vector is the one with the minimum module for cost type attribute. For example, A
1 is a cost type attribute, so the index vector with the minimum module is 1.8
+
0
i.Table 4
The module of every index and the target center index vector.
A
t
r
s
1
r
s
2
r
s
3
r
s
4
r
0
C
0
A
1
2
2.5
1.8
2.2
1.8
1.8
+
0
i
A
2
500
540
480
520
540
540
+
0
i
A
3
55.504504
35.707142
55.452683
40.620192
55.504504
55.5
+
0.707107
i
A
4
5.247857
4.752894
5.545268
5.049752
4.752894
4.7
+
0.707107
i
A
5
0.509902
0.316228
0.707107
0.509902
0.707107
0.7
+
0.1
i
A
6
0.905539
0.509902
0.707107
0.509902
0.905539
0.9
+
0.1
iFinally, the target center index vector set isC
0
=
(
1.8
+
0
i
,
540
+
0
i
,
55.5
+
0.707107
i
,
4.7
+
0.707107
i
,
0.7
+
0.1
i
,
0.9
+
0.1
i
).(4) Calculate the Nearness Degree of Every Index Vector. Table 5 is the nearness degree of every index vector to its target center index vector calculated by the equations from (4) to (7) and (10). In Table 5, d
s
t
(
s
=
1
,
…
,
4
;
t
=
1,2
,
…
,
6
) represents the nearness degree (generalized target center distance).Table 5
Nearness degree of every index vector to its target center index vector.
d
s
t
A
1
A
2
A
3
A
4
A
5
A
6
d
1
t
0.2
40
0
0.494699
0.197598
0
d
2
t
0.7
0
20.108669
0
0.39344
0.396596
d
3
t
0
60
0.235658
0.791736
0
0.198604
d
4
t
0.4
20
15.15187
0.29676
0.197598
0.396596The nearness degrees of all index vectors cannot be compared with each other for different attributes, so they need to be normalized with (10). The normalized nearness degrees are shown in Table 6. In Table 6, Z
s
t
(
s
=
1
,
…
,
4
;
t
=
1,2
,
…
,
6
) represents the normalized nearness degree.Table 6
The normalized nearness degree of every index vector.
Z
s
t
A
1
A
2
A
3
A
4
A
5
A
6
Z
1
t
0.153846
0.333333
0
0.312469
0.250556
0
Z
2
t
0.538462
0
0.566502
0
0.498887
0.399876
Z
3
t
0
0.5
0.006639
0.500087
0
0.200247
Z
4
t
0.307692
0.166667
0.426859
0.187444
0.250556
0.399876(5) Decision Making and Comparison. The entire integrated nearness degrees must be calculated for decision making. Aggregating the nearness degrees under different attributes for every alternative involves considering the attributes’ weights or not.Without considering the weights of all attributes, the entire integrated nearness degrees are calculated asW
=
(
1.050205
,
2.003727
,
1.206973
,
1.739095
), so the alternatives ranking is C
1
≻
C
3
≻
C
4
≻
C
2.However, if the objective weights are calculated asω
=
(
0.1655
,
0.1534
,
0.3361
,
0.1349
,
0.0859
,
0.1241
) by (14), then the entire integrated nearness degrees W
=
(
0.140270
,
0.371996
,
0.171244
,
0.316391
) can be obtained using (15), so the alternatives ranking is C
3
≻
C
1
≻
C
4
≻
C
2.If the weightsω
=
(
0.2,0.2,0.1,0.1,0.2,0.2
) are given by the experts, then the entire integrated nearness degrees are W
=
(
0.178794,0.264120,0.150673,0.206413
), so the alternatives ranking is C
1
≻
C
3
≻
C
4
≻
C
2.Table7 is the results comparison between the proposed approach and the previous method reported in literature [8]. In Table 7, M
1, M
2, N, D, and R stand for the proposed approach, the previous reported method, integrated nearness degree, target center distance, and alternatives ranking, respectively. The objective weights determined in M
2 are ω
=
(
0.18,0.2,0.1,0.2,0.16,0.16
), while the subjective weights in M
2 are ω
=
(
0.2,0.2,0.1,0.1,0.2,0.2
).Table 7
The results comparison between the proposed approach and the reported method.
C
i
No weights
Objective weights
Subjective weights
M
1
M
2
M
1
M
2
M
1
M
2
N
R
D
R
N
R
D
R
N
R
D
R
C
1
1.050205
1
0.0511
1
0.140270
1
0.0888
2
0.178794
2
0.0960
2
C
2
2.003727
4
0.0863
4
0.371996
4
0.2278
4
0.264120
4
0.2500
4
C
3
1.206973
2
0.0661
2
0.171244
2
0.0768
1
0.150673
1
0.0783
1
C
4
1.739095
3
0.0699
3
0.316391
3
0.1664
3
0.206413
3
0.1820
3Seen from Table7, there are differences about the results between the proposed approach and the previous reported method. Both the two methods are compared with considering the attributes with no weights, objective weights, and subjective weights. With respect to the alternatives ranking, the ranking of alternatives C
1 and C
3 is opposite, while the ranking of C
2 and C
4 remains the same only for considering the objective weights. Obviously, different objective weights make the difference. However the results of ranking with no weights and subjective weights are uniform with the two methods. Besides judging the alternatives by nearness degree is easier than by target center distance from the data results shown in Table 7. Due to the fact that the proposed approach can reduce the information distortion, the results of it especially for considering objective weights are superior to those of the previous reported method in literature [8].


## 4.1. Background

In order to exemplify the proposed generalized grey target decision method, the data are derived from the literature [8] and the results are also compared with those of the literature [8].To evaluate the tactical missiles, six indices, namely, hit accuracy (km), warhead payload (kg), mobility(
km
·
h
-
1
), price (106 g), reliability, and maintainability, are considered denoted by A
1
~
A
6. For all the data type of the attributes, A
1 and A
2 are real numbers, A
3 and A
4 are interval numbers, and A
5 and A
6 are triangular fuzzy numbers. Among these attributes A
1 and A
4 are cost type indices and the others are benefit type indices. There are four feasible alternatives denoted by C
1
~
C
4. The data are shown in Table 1.Table 1
Index values of every alternative.
C
t
A
1
A
2
A
3
A
4
A
5
A
6
C
1
2.0
500
[
55
56
]
[
4.7
5.7
]
[
0.4
0.5
0.6
]
[
0.8
0.9
1.0
]
C
2
2.5
540
[
30
40
]
[
4.2
5.2
]
[
0.2
0.3
0.4
]
[
0.4
0.5
0.6
]
C
3
1.8
480
[
50
60
]
[
5
6
]
[
0.6
0.7
0.8
]
[
0.6
0.7
0.8
]
C
4
2.2
520
[
35
45
]
[
4.5
5.5
]
[
0.4
0.5
0.6
]
[
0.4
0.5
0.6
]


## 4.2. Process to Decision Making

(1) Calculate the Average Value and the Standard Deviation of Every Index. The average value and the standard deviation of every index can be calculated using (1), and the results are shown in Table 2. In Table 2, E
i and s
i
(
i
=
1
,
…
,
4
) represent the ith alternative’s average values and standard deviations of all indices under all attributes. Note that the average values and the standard deviations of real numbers are themselves and 0, respectively.Table 2
The average value and the standard deviation of every index.
A
t
C
1
C
2
C
3
C
4
E
1
S
1
E
2
S
2
E
3
S
3
E
4
S
4
A
1
2.0
0
2.5
0
1.8
0
2.2
0
A
2
500
0
540
0
480
0
520
0
A
3
55.5
0.707107
35
7.071068
55
7.071068
40
7.071068
A
4
5.2
0.707107
4.7
0.707107
5.5
0.707107
5
0.707107
A
5
0.5
0.1
0.3
0.1
0.7
0.1
0.5
0.1
A
6
0.9
0.1
0.5
0.1
0.7
0.1
0.5
0.1(2) Transform Index Values into Binary Connection Numbers. Having got the average value and the standard deviation of every index shown in Table 2, every index value can be transformed into binary connection number using (2), and the results are shown in Table 3. Moreover, every binary connection number in Table 3 can be regarded as a vector in the D-U space. Note that the form of the real number is expressed as the form A
+
0
i (A
∈
R).Table 3
The binary connection numbers transformed from all index values.
A
t
C
1
C
2
C
3
C
4
A
1
2.0
+
0
i
2.5
+
0
i
1.8
+
0
i
2.2
+
0
i
A
2
500
+
0
i
540
+
0
i
480
+
0
i
520
+
0
i
A
3
55.5
+
0.707107
i
35
+
7.0710
68
i
55
+
7.0710
68
i
40
+
7.0710
68
i
A
4
5.2
+
0.707107
i
4.7
+
0.707107
i
5.5
+
0.707107
i
5
+
0.707107
i
A
5
0.5
+
0.1
i
0.3
+
0.1
i
0.7
+
0.1
i
0.5
+
0.1
i
A
6
0.9
+
0.1
i
0.5
+
0.1
i
0.7
+
0.1
i
0.5
+
0.1
i(3) Determine the Target Center Index Vectors. Using (6), (7), and (8) the target center index vectors can be determined by the modules of all index vectors under different attributes, and the results are shown in Table 4. In Table 4, r
t
s (t
=
1,2
,
…
,
6
;
s
=
1
,
…
,
4) denotes the module of every binary connection number vector, while r
0 and C
0 are the desirable (maximum or minimum) modules of different attributes and the target center index vectors, respectively. The target center index vectors of different attributes are determined by the modules of every index vectors. The target center index vector is the one with the maximum module for benefit type attribute, while the target center index vector is the one with the minimum module for cost type attribute. For example, A
1 is a cost type attribute, so the index vector with the minimum module is 1.8
+
0
i.Table 4
The module of every index and the target center index vector.
A
t
r
s
1
r
s
2
r
s
3
r
s
4
r
0
C
0
A
1
2
2.5
1.8
2.2
1.8
1.8
+
0
i
A
2
500
540
480
520
540
540
+
0
i
A
3
55.504504
35.707142
55.452683
40.620192
55.504504
55.5
+
0.707107
i
A
4
5.247857
4.752894
5.545268
5.049752
4.752894
4.7
+
0.707107
i
A
5
0.509902
0.316228
0.707107
0.509902
0.707107
0.7
+
0.1
i
A
6
0.905539
0.509902
0.707107
0.509902
0.905539
0.9
+
0.1
iFinally, the target center index vector set isC
0
=
(
1.8
+
0
i
,
540
+
0
i
,
55.5
+
0.707107
i
,
4.7
+
0.707107
i
,
0.7
+
0.1
i
,
0.9
+
0.1
i
).(4) Calculate the Nearness Degree of Every Index Vector. Table 5 is the nearness degree of every index vector to its target center index vector calculated by the equations from (4) to (7) and (10). In Table 5, d
s
t
(
s
=
1
,
…
,
4
;
t
=
1,2
,
…
,
6
) represents the nearness degree (generalized target center distance).Table 5
Nearness degree of every index vector to its target center index vector.
d
s
t
A
1
A
2
A
3
A
4
A
5
A
6
d
1
t
0.2
40
0
0.494699
0.197598
0
d
2
t
0.7
0
20.108669
0
0.39344
0.396596
d
3
t
0
60
0.235658
0.791736
0
0.198604
d
4
t
0.4
20
15.15187
0.29676
0.197598
0.396596The nearness degrees of all index vectors cannot be compared with each other for different attributes, so they need to be normalized with (10). The normalized nearness degrees are shown in Table 6. In Table 6, Z
s
t
(
s
=
1
,
…
,
4
;
t
=
1,2
,
…
,
6
) represents the normalized nearness degree.Table 6
The normalized nearness degree of every index vector.
Z
s
t
A
1
A
2
A
3
A
4
A
5
A
6
Z
1
t
0.153846
0.333333
0
0.312469
0.250556
0
Z
2
t
0.538462
0
0.566502
0
0.498887
0.399876
Z
3
t
0
0.5
0.006639
0.500087
0
0.200247
Z
4
t
0.307692
0.166667
0.426859
0.187444
0.250556
0.399876(5) Decision Making and Comparison. The entire integrated nearness degrees must be calculated for decision making. Aggregating the nearness degrees under different attributes for every alternative involves considering the attributes’ weights or not.Without considering the weights of all attributes, the entire integrated nearness degrees are calculated asW
=
(
1.050205
,
2.003727
,
1.206973
,
1.739095
), so the alternatives ranking is C
1
≻
C
3
≻
C
4
≻
C
2.However, if the objective weights are calculated asω
=
(
0.1655
,
0.1534
,
0.3361
,
0.1349
,
0.0859
,
0.1241
) by (14), then the entire integrated nearness degrees W
=
(
0.140270
,
0.371996
,
0.171244
,
0.316391
) can be obtained using (15), so the alternatives ranking is C
3
≻
C
1
≻
C
4
≻
C
2.If the weightsω
=
(
0.2,0.2,0.1,0.1,0.2,0.2
) are given by the experts, then the entire integrated nearness degrees are W
=
(
0.178794,0.264120,0.150673,0.206413
), so the alternatives ranking is C
1
≻
C
3
≻
C
4
≻
C
2.Table7 is the results comparison between the proposed approach and the previous method reported in literature [8]. In Table 7, M
1, M
2, N, D, and R stand for the proposed approach, the previous reported method, integrated nearness degree, target center distance, and alternatives ranking, respectively. The objective weights determined in M
2 are ω
=
(
0.18,0.2,0.1,0.2,0.16,0.16
), while the subjective weights in M
2 are ω
=
(
0.2,0.2,0.1,0.1,0.2,0.2
).Table 7
The results comparison between the proposed approach and the reported method.
C
i
No weights
Objective weights
Subjective weights
M
1
M
2
M
1
M
2
M
1
M
2
N
R
D
R
N
R
D
R
N
R
D
R
C
1
1.050205
1
0.0511
1
0.140270
1
0.0888
2
0.178794
2
0.0960
2
C
2
2.003727
4
0.0863
4
0.371996
4
0.2278
4
0.264120
4
0.2500
4
C
3
1.206973
2
0.0661
2
0.171244
2
0.0768
1
0.150673
1
0.0783
1
C
4
1.739095
3
0.0699
3
0.316391
3
0.1664
3
0.206413
3
0.1820
3Seen from Table7, there are differences about the results between the proposed approach and the previous reported method. Both the two methods are compared with considering the attributes with no weights, objective weights, and subjective weights. With respect to the alternatives ranking, the ranking of alternatives C
1 and C
3 is opposite, while the ranking of C
2 and C
4 remains the same only for considering the objective weights. Obviously, different objective weights make the difference. However the results of ranking with no weights and subjective weights are uniform with the two methods. Besides judging the alternatives by nearness degree is easier than by target center distance from the data results shown in Table 7. Due to the fact that the proposed approach can reduce the information distortion, the results of it especially for considering objective weights are superior to those of the previous reported method in literature [8].


## 5. Conclusions

This paper presents a generalized great target decision method using connection number to deal with alternatives with mixed attribute values. All the index values of all alternatives can be converted into the binary connection numbers regarded as the connection number vectors in the determinacy-uncertainty space. Then the target center index vectors can be determined by the modules of the binary connection number vectors. So the nearness degrees of all index vectors can be calculated. For comparison, the nearness degrees are normalized in linear method. Thus the decision making can be made by the minimum of the integrated nearness degrees derived from aggregating the total normalized degrees of every alternative. The generalized grey target decision method for mixed attributes based on connection is superior to that of the other authors in two aspects: needless to normalize the raw data will reduce the information distortion of fuzzy numbers; considering both the determinacy and the uncertainty of the fuzzy numbers is of more accuracy.



---

*Source: 763543-2014-04-27.xml*