# Fuzzy Similar Priority Method for Mixed Attributes

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

---

## Abstract

Fuzzy similar priority ratio method is to select the most suitable one to the specific object from feasible alternatives. However, this method considering only the index values of real number has its disadvantages of inaccuracy in result and complexity in calculation. So, this method was extended to handle mixed attributes including real number, interval number, triangular fuzzy number, and trapezoidal fuzzy number. The proposed method decides the optimal alternative by the minimum of integrated nearness degrees calculated by all index vectors and the fixed index vectors based on the theory of similarity. The improved method can not only address mixed attributes but also simplify the calculation and improve the accuracy of result. A case study illustrated this method.


---

## Body

## 1. Introduction

Knowing some index values of the specific object, the most suitable one can be determined from some feasible alternatives using the method of fuzzy similar priority ratio, which is of fuzzy mathematic method [1]. Being of simple principle and clear meaning, this method has been widely used in many fields. However, the classical method only concerns the indices of real numbers. Furthermore, it has its disadvantages of inaccuracy in result and complexity in calculation. In decision making, the indices of an alternative may be characterized as interval number, triangular fuzzy number, and trapezoid fuzzy number. But the traditional method fails to deal with the mixed types of numbers. Article [2] presented a novel method in grey target decision making for handling mixed attributes. The method in [2] introduced the binary connection number provided in set pair analysis (SPA) [3, 4] to transform all types of indices into connection number vectors regarded as in the determinacy-uncertainty space [5, 6]. Then all the nearness degrees of index vectors and the given index vectors could be calculated based on the theory of similarity. And the decision making was decided by the nearness degrees. The novel method addressed some alternatives for mixed attribute values, but its accuracy in solving the uncertain terms of index vectors needs improving. Thus, an improved fuzzy similarity priority method is proposed to handle the mixed attributes based on the previous study of decision making by the nearness degrees. The improved fuzzy similar priority method has some features. First, it can deal with mixed attributes. Second, its calculation is simple compared with the traditional method. Third, it improves the accuracy of the nearness degrees provided in [2] through optimizing the uncertain terms of the index vectors.The remainder of the organization is as follows. Section2 presents some basic concepts. Section 3 discusses the proposed method. A case study is given in Section 4. And Section 5 concludes this work.


## 2. Basic Concepts

In this section, some concepts are presented.Definition 1.
LetR be a set of real numbers; then x~ is called a fuzzy number if it has one of the following forms [6–11]:(1)
ifx~=[xL,xU], then x~ is called interval number, where xL, xU∈R, xL<xU, xL, and xU are the interval number’s lower limits and upper limits, respectively;(2)
ifx~=[xL,xM,xU], then x~ is called triangular fuzzy number, where xL, xM, xU∈R, 0<xL<xM<xU, xL, and xU are the triangular fuzzy number’s lower limits and upper limits, respectively, while xM is medium value;(3)
ifx~=[xL,xM,xN,xU], then x~ is called trapezoidal fuzzy number, where 0<xL<xM<xN<xU∈R, xL and xU are the trapezoidal fuzzy number’s lower limits and upper limits, respectively, while [xM,xN] is medium interval.Definition 2.
Assumex~ is a fuzzy number with its parameters which can be seen as n(n⩾2) observed values [2], and then the fuzzy number’s average value, standard deviation, and maximum deviation are as follows:
(1)x¯=1n∑t=1nxt,(2)s=1(n-1)∑t=1n(xt-x¯)2,(3)ms=max⁡{|xL-x¯|,|xU-x¯|},
where xt(t=1,…,n) is the parameter of the fuzzy number, x¯ is the average value of the parameters, s is the standard deviation of the parameters, ms is the maximum deviation of the parameters, and xL and xU are the fuzzy number’s lower limits and upper limits, respectively.Definition 3.
LetR be a set of real numbers; A+Bi 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 uncertainty of a set pair. So the determinacy-uncertainty vector based on connection number can be constructed as follows [2]:
(4)u(x¯,v)=A+Bi=x¯+vi(i∈[-1,1]),
where x¯ and v are the concentrated value and the diverse value of n parameter values of the same fuzzy number x~, respectively, x~ can be calculated using (1), and v can be obtained by the following equation:
(5)v=min⁡{s,ms}.Article [12] provided the idea of using maximum deviation as the uncertain term of an index vector only involving the upper limits in trapezoidal number. However, considering both the lower limits and upper limits of a fuzzy number is more reasonable.Remark 4.
A real number can be regarded as the special form of a fuzzy number; thus the real number can also be converted into a binary connection number with the formu(x¯,v)=A+0i, where A is the real number itself and the uncertain term is 0.Definition 5.
The mutual interaction of the average valuex¯ and the diverse value (standard deviation or maximum deviation) v of the connection number u(x¯,v) can be mapped to the binary determinacy-uncertainty space (D-U space) based on SPA. If u(x¯,s)=x¯+vi represents the vector ofD-U space, then the “i” only denotes the signal of the uncertain term without representing the changeable value [2].Figure1 is aD-U space. The U axis and the D axis represent the relative uncertain measure and the relative deterministic measure, respectively. In Figure 1, the x¯ and the v interact with each other, and the space reflection is the vector OE¯ from O to E, and the degree of interaction means the module of the vector OE¯ denoted by r [6]. Measures between vectors can use distance method [13] such as Hamming distance and Euclidean distance or similarity method [14] such as cosine value and projection value.Figure 1
Determinacy-uncertainty space.Definition 6.
LetX=(x1,x2,…,xn) be a vector; then
(6)|X|=∑t=1nxt2
is called the module of X.Definition 7.
LetX=(x1,x2,…,xn) and Y=(y1,y2,…,yn) be two vectors; then
(7)PrjY(X)=∑t=1nxtyt∑t=1nxt2∑t=1nyt2∑t=1nxt2=∑t=1nxtyt∑t=1nyt2
is the projection of vector X on vector Y. Generally speaking, the bigger the value of PrjY(X) the more the similarity between X and Y [15].Definition 8.
Assumer is the module of vector Y and prj is the projection value of vector X on vector Y; then
(8)dn0=|r-prj|
is the distance of projection value prj and the module r is called nearness degree. When the two index vectors are all transformed from real numbers, the dn0 in (8) is actually degraded to Hamming distance [2].Remark 9.
Measuring the similarity of the two index vectors with nearness degree has its advantages over cosine value and projection value. First, it can specifically reflect the similarity of the two vectors whether they transformed from real number or fuzzy number. Second, it is the generalized distance especially for that it is degraded to Hamming distance when the two index vectors are converted from real numbers. The detailed discussion can be seen in the paper [2].


## 3. Fuzzy Similar Priority Method for Mixed Attributes

### 3.1. Brief Introduction to the Method of Fuzzy Similar Priority Ratio

#### 3.1.1. Fuzzy Preference Relation

Definition 10.
LetG=(g1,g2,…,gm) be a set of alternatives; if gi and gj (i,j=1,2,…,m) are compared with the alternative g0, then the fuzzy preference relation R is described as follows.
R
=
(
r
i
j
)
m
×
m
,
r
i
j
∈
[
0,1
]  (i,j=1,2,…,m)R:A×A→[0,1], and rij satisfies the following relations.
(
1
)
r
i
i
=
0,  i=1,2,…,m; (2)rij+rji=1  (i≠j,i,j=1,2,…,m).
Equation (1) indicates that gi has indifference with itself, so rii=0. And (2) indicates that if gi is preferred to gj, denoted by rij, then gj is preferred to gi, denoted by rji=1-rij, especially, and rij=1 indicates that gi is absolutely preferred to gj with respect to g0 [16–18].


#### 3.1.2. Algorithm of Fuzzy Similar Priority Ratio

LetX0=(x01,x02,…,x0n) be index vector of the specific object and let the index value of the ith feasible alternative be xij(i=1,2,…,m,j=1,2,…,n), so the algorithm of fuzzy similar priority ratio is as follows [16, 19].Step 1.
With respect to the attributeAk, calculate the Hamming distances of xik and xjk with x0k, respectively,
(9)dik=|xik-x0k|,djk=|xijk-x0k|.Step 2.
Construct the fuzzy preference relation(10)rij=djkdik+djk,
so the fuzzy similar matrix for attribute Ak is
(11)Rk=(r11…r1m⋮⋱⋮rm1⋯rmm),k=1,2,…,n.Step 3.
A series ofλ-sectional sets can be determined through operating Rk with the λ ascending in [0,1]. To get the λ-sectional set, the elements of Rk must be compared with the λ. The elements of Rk will be rewritten as 1 if they are no less than the λ value. Under attribute Ak, the most similarity alternative to the specific object is the one whose row first gets all “1” except the diagonal elements and the alternative acquires the order value “1.” Then, the impact of the alternative must be eliminated by removing the row corresponding to the alternative and the same column in Rk. Repeating the same work, a series of similarity alternatives can be obtained and assigned the order values 2,3,…,m. And the order value that the alternative gains under attribute Ak is denoted by Cik(i=1,2,…,m,k=1,2,…,n).Step 4.
Integrate the order values under different attributes for every alternative denoted byTCi with the following equation:
(12)TCi=∑k=1nCik,i=1,2,…,m,k=1,2,…,n.Step 5.
Rank the alternatives withTCi in ascending order, and the optimal alternative to the specific object is the one with the minimum value TCi.


### 3.2. Fuzzy Similar Priority Method for Mixed Attributes

#### 3.2.1. Methodology of the Proposed Method

LetX0=(x01,x02,…,x0j,…,x0n) be index vector of the specific object and let the index value of the ith feasible alternative be xij(i=1,2,…,m,j=1,2,…,n), where xij and x0j can be expressed as fuzzy numbers or real numbers. The algorithm of the improved fuzzy similar priority method can be concluded as follows [20].Step  1. Calculate the average values, standard deviations, and maximum deviations of all indices (xij and x0j) by using Equations from (1) to (3).Step  2. Translate all index values into the binary A+Bi connection number vectors using (4) and (5). So the converted index vectors can be expressed as
(13)ust=x¯st+vsti(i∈[-1,1]),s=0,…,m,t=1,…,n.Step  3. Calculate the nearness degrees of all index vectors ust(s=1,…,m,t=1,…,n) and the fixed index vectors ust(s=0,t=1,…,n) denoted by qij(i=1,…,m,j=1,…,n) using Equations from (6) to (8)  and (13).Step  4. Normalize the nearness degrees of all index vectors and the fixed index vector by
(14)zij=qij∑i=1mqij,i=1,…,m;j=1,…,n,
where zij is the normalized nearness degree.Step  5. Determine the weights of all attributes denoted as ωj(j=1,…,n) by objective method or subjective method.Step  6. Integrate the normalized nearness degrees considering weights of all attributes using the following equation:
(15)wi=ωjzij,i=1,…,m,j=1,…,n.Step  7. Rank the feasible alternatives by the integrated normalized nearness degrees wi(i=1,…,m).


#### 3.2.2. Merits of the Proposed Method

The improved fuzzy similar method has its advantages over the traditional method. Above all, the proposed method can address the mixed numbers based on the similarity of the improved determinacy-uncertainty index vectors through optimizing the uncertain terms of them. Moreover, it can simplify the calculation by avoiding the traditional tedious computing procedure such that Steps2 and 3 in the traditional method are reduced or avoided. Nevertheless, it determines the optimal alternative by the minimum of integrated nearness degrees instead of the minimum order values and can improve the accuracy of results. Finally, it can also reflect the decision makers’ preferences by considering attribute weights.


## 3.1. Brief Introduction to the Method of Fuzzy Similar Priority Ratio

### 3.1.1. Fuzzy Preference Relation

Definition 10.
LetG=(g1,g2,…,gm) be a set of alternatives; if gi and gj (i,j=1,2,…,m) are compared with the alternative g0, then the fuzzy preference relation R is described as follows.
R
=
(
r
i
j
)
m
×
m
,
r
i
j
∈
[
0,1
]  (i,j=1,2,…,m)R:A×A→[0,1], and rij satisfies the following relations.
(
1
)
r
i
i
=
0,  i=1,2,…,m; (2)rij+rji=1  (i≠j,i,j=1,2,…,m).
Equation (1) indicates that gi has indifference with itself, so rii=0. And (2) indicates that if gi is preferred to gj, denoted by rij, then gj is preferred to gi, denoted by rji=1-rij, especially, and rij=1 indicates that gi is absolutely preferred to gj with respect to g0 [16–18].


### 3.1.2. Algorithm of Fuzzy Similar Priority Ratio

LetX0=(x01,x02,…,x0n) be index vector of the specific object and let the index value of the ith feasible alternative be xij(i=1,2,…,m,j=1,2,…,n), so the algorithm of fuzzy similar priority ratio is as follows [16, 19].Step 1.
With respect to the attributeAk, calculate the Hamming distances of xik and xjk with x0k, respectively,
(9)dik=|xik-x0k|,djk=|xijk-x0k|.Step 2.
Construct the fuzzy preference relation(10)rij=djkdik+djk,
so the fuzzy similar matrix for attribute Ak is
(11)Rk=(r11…r1m⋮⋱⋮rm1⋯rmm),k=1,2,…,n.Step 3.
A series ofλ-sectional sets can be determined through operating Rk with the λ ascending in [0,1]. To get the λ-sectional set, the elements of Rk must be compared with the λ. The elements of Rk will be rewritten as 1 if they are no less than the λ value. Under attribute Ak, the most similarity alternative to the specific object is the one whose row first gets all “1” except the diagonal elements and the alternative acquires the order value “1.” Then, the impact of the alternative must be eliminated by removing the row corresponding to the alternative and the same column in Rk. Repeating the same work, a series of similarity alternatives can be obtained and assigned the order values 2,3,…,m. And the order value that the alternative gains under attribute Ak is denoted by Cik(i=1,2,…,m,k=1,2,…,n).Step 4.
Integrate the order values under different attributes for every alternative denoted byTCi with the following equation:
(12)TCi=∑k=1nCik,i=1,2,…,m,k=1,2,…,n.Step 5.
Rank the alternatives withTCi in ascending order, and the optimal alternative to the specific object is the one with the minimum value TCi.


## 3.1.1. Fuzzy Preference Relation

Definition 10.
LetG=(g1,g2,…,gm) be a set of alternatives; if gi and gj (i,j=1,2,…,m) are compared with the alternative g0, then the fuzzy preference relation R is described as follows.
R
=
(
r
i
j
)
m
×
m
,
r
i
j
∈
[
0,1
]  (i,j=1,2,…,m)R:A×A→[0,1], and rij satisfies the following relations.
(
1
)
r
i
i
=
0,  i=1,2,…,m; (2)rij+rji=1  (i≠j,i,j=1,2,…,m).
Equation (1) indicates that gi has indifference with itself, so rii=0. And (2) indicates that if gi is preferred to gj, denoted by rij, then gj is preferred to gi, denoted by rji=1-rij, especially, and rij=1 indicates that gi is absolutely preferred to gj with respect to g0 [16–18].


## 3.1.2. Algorithm of Fuzzy Similar Priority Ratio

LetX0=(x01,x02,…,x0n) be index vector of the specific object and let the index value of the ith feasible alternative be xij(i=1,2,…,m,j=1,2,…,n), so the algorithm of fuzzy similar priority ratio is as follows [16, 19].Step 1.
With respect to the attributeAk, calculate the Hamming distances of xik and xjk with x0k, respectively,
(9)dik=|xik-x0k|,djk=|xijk-x0k|.Step 2.
Construct the fuzzy preference relation(10)rij=djkdik+djk,
so the fuzzy similar matrix for attribute Ak is
(11)Rk=(r11…r1m⋮⋱⋮rm1⋯rmm),k=1,2,…,n.Step 3.
A series ofλ-sectional sets can be determined through operating Rk with the λ ascending in [0,1]. To get the λ-sectional set, the elements of Rk must be compared with the λ. The elements of Rk will be rewritten as 1 if they are no less than the λ value. Under attribute Ak, the most similarity alternative to the specific object is the one whose row first gets all “1” except the diagonal elements and the alternative acquires the order value “1.” Then, the impact of the alternative must be eliminated by removing the row corresponding to the alternative and the same column in Rk. Repeating the same work, a series of similarity alternatives can be obtained and assigned the order values 2,3,…,m. And the order value that the alternative gains under attribute Ak is denoted by Cik(i=1,2,…,m,k=1,2,…,n).Step 4.
Integrate the order values under different attributes for every alternative denoted byTCi with the following equation:
(12)TCi=∑k=1nCik,i=1,2,…,m,k=1,2,…,n.Step 5.
Rank the alternatives withTCi in ascending order, and the optimal alternative to the specific object is the one with the minimum value TCi.


## 3.2. Fuzzy Similar Priority Method for Mixed Attributes

### 3.2.1. Methodology of the Proposed Method

LetX0=(x01,x02,…,x0j,…,x0n) be index vector of the specific object and let the index value of the ith feasible alternative be xij(i=1,2,…,m,j=1,2,…,n), where xij and x0j can be expressed as fuzzy numbers or real numbers. The algorithm of the improved fuzzy similar priority method can be concluded as follows [20].Step  1. Calculate the average values, standard deviations, and maximum deviations of all indices (xij and x0j) by using Equations from (1) to (3).Step  2. Translate all index values into the binary A+Bi connection number vectors using (4) and (5). So the converted index vectors can be expressed as
(13)ust=x¯st+vsti(i∈[-1,1]),s=0,…,m,t=1,…,n.Step  3. Calculate the nearness degrees of all index vectors ust(s=1,…,m,t=1,…,n) and the fixed index vectors ust(s=0,t=1,…,n) denoted by qij(i=1,…,m,j=1,…,n) using Equations from (6) to (8)  and (13).Step  4. Normalize the nearness degrees of all index vectors and the fixed index vector by
(14)zij=qij∑i=1mqij,i=1,…,m;j=1,…,n,
where zij is the normalized nearness degree.Step  5. Determine the weights of all attributes denoted as ωj(j=1,…,n) by objective method or subjective method.Step  6. Integrate the normalized nearness degrees considering weights of all attributes using the following equation:
(15)wi=ωjzij,i=1,…,m,j=1,…,n.Step  7. Rank the feasible alternatives by the integrated normalized nearness degrees wi(i=1,…,m).


### 3.2.2. Merits of the Proposed Method

The improved fuzzy similar method has its advantages over the traditional method. Above all, the proposed method can address the mixed numbers based on the similarity of the improved determinacy-uncertainty index vectors through optimizing the uncertain terms of them. Moreover, it can simplify the calculation by avoiding the traditional tedious computing procedure such that Steps2 and 3 in the traditional method are reduced or avoided. Nevertheless, it determines the optimal alternative by the minimum of integrated nearness degrees instead of the minimum order values and can improve the accuracy of results. Finally, it can also reflect the decision makers’ preferences by considering attribute weights.


## 3.2.1. Methodology of the Proposed Method

LetX0=(x01,x02,…,x0j,…,x0n) be index vector of the specific object and let the index value of the ith feasible alternative be xij(i=1,2,…,m,j=1,2,…,n), where xij and x0j can be expressed as fuzzy numbers or real numbers. The algorithm of the improved fuzzy similar priority method can be concluded as follows [20].Step  1. Calculate the average values, standard deviations, and maximum deviations of all indices (xij and x0j) by using Equations from (1) to (3).Step  2. Translate all index values into the binary A+Bi connection number vectors using (4) and (5). So the converted index vectors can be expressed as
(13)ust=x¯st+vsti(i∈[-1,1]),s=0,…,m,t=1,…,n.Step  3. Calculate the nearness degrees of all index vectors ust(s=1,…,m,t=1,…,n) and the fixed index vectors ust(s=0,t=1,…,n) denoted by qij(i=1,…,m,j=1,…,n) using Equations from (6) to (8)  and (13).Step  4. Normalize the nearness degrees of all index vectors and the fixed index vector by
(14)zij=qij∑i=1mqij,i=1,…,m;j=1,…,n,
where zij is the normalized nearness degree.Step  5. Determine the weights of all attributes denoted as ωj(j=1,…,n) by objective method or subjective method.Step  6. Integrate the normalized nearness degrees considering weights of all attributes using the following equation:
(15)wi=ωjzij,i=1,…,m,j=1,…,n.Step  7. Rank the feasible alternatives by the integrated normalized nearness degrees wi(i=1,…,m).


## 3.2.2. Merits of the Proposed Method

The improved fuzzy similar method has its advantages over the traditional method. Above all, the proposed method can address the mixed numbers based on the similarity of the improved determinacy-uncertainty index vectors through optimizing the uncertain terms of them. Moreover, it can simplify the calculation by avoiding the traditional tedious computing procedure such that Steps2 and 3 in the traditional method are reduced or avoided. Nevertheless, it determines the optimal alternative by the minimum of integrated nearness degrees instead of the minimum order values and can improve the accuracy of results. Finally, it can also reflect the decision makers’ preferences by considering attribute weights.


## 4. Cases Study

### 4.1. Background

A coal enterprise is to select suitable safety management model from some coal enterprise with different advanced safety management level. The safety management model of a coal enterprise depends on some indices including seam dip (°), methane emission rate (m3/t), water inflow (m3/h), spontaneous combustion period (month), ventilating structures qualification rate (%), and equivalent orifice (m2) [21, 22] denoted by A1 to A6 respectively. Thus some coal enterprises with different index values can be regarded as different alternatives. Here S0 represents the specific coal enterprise wants to learn advanced safety management experience. And the eight feasible alternatives (coal enterprises) are denoted as S1 to S8 respectively. Besides the index values are given as mixed attribute values including real numbers, interval numbers, triangle fuzzy numbers and trapezoid fuzzy numbers. The aim of the decision makers is to seek for the most suitable enterprise whose safety management experiece can be learnt. So the proposed method can address this problem easily. The data is shown in Table 1.Table 1
Safety data from coal mines.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
[18, 20, 25]
[4, 6, 8]
[180, 260]
12
[90, 91, 93, 94]
1.8
S
2
[12, 16, 20]
[2.8, 4, 4.3]
[190, 210]
6
[88, 89, 91, 92]
1.4
S
3
[22, 25, 31]
[8.8, 9.2, 9.6]
[160, 200]
10
[84, 87, 89, 92]
2.7
S
4
[6, 11, 13]
[3.6, 4, 4.4]
[240, 280]
8
[91, 93, 95, 97]
1.2
S
5
[24, 32, 34]
[7.3, 8.3, 9]
[340, 360]
10
[94, 95, 97, 98]
3.6
S
6
[14, 16, 18]
[9.4, 9.6, 9.8]
[360, 440]
6
[82, 84, 88, 90]
1.3
S
7
[33, 42, 45]
[13, 14, 15]
[550, 650]
6
[93, 94, 96, 97]
2.1
S
8
[9, 12, 15]
[12, 13, 13.4]
[100, 140]
10
[89, 90, 91, 94]
1.5
S
0
[8, 12, 22]
[5.2, 6, 6.2]
[150, 160]
12
[87, 88, 90, 91]
1.7


### 4.2. Process of Decision Making

#### 4.2.1. Calculate the Parameters of Index Vectors

All average values, standard deviations, and maximum deviations of all indices can be calculated using Equations from (1) to (3) and the results are shown in Table 2.Table 2
Average values, standard deviations, and maximum deviations of all indices.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
21/3.605551/4
6/2/2
220/56.56854/40
12/0/0
92/1.825742/2
1.8/0/0
S
2
16/4/4
3.7/0.793725/0.9
200/14.14214/10
6/0/0
90/1.825742/2
1.4/0/0
S
3
26/4.582576/5
9.2/0.4/0.4
180/28.28427/20
10/0/0
88/3.366502/4
2.7/0/0
S
4
10/3.605551/4
4/0.4/0.4
260/28.28427/20
8/0/0
94/2.581989/3
1.2/0/0
S
5
30/5.291503/6
8.2/0.8544/0.9
350/14.14214/10
10/0/0
96/1.825742/2
3.6/0/0
S
6
16/2/2
9.6/0.2/0.2
400/56.56854/40
6/0/0
86/3.651484/4
1.3/0/0
S
7
40/6.244998/7
14/1/1
600/70.71068/50
6/0/0
95/1.825742/2
2.1/0/0
S
8
12/3/3
12.8/0.72111/0.6
120/28.28427/20
10/0/0
91/2.160247/3
1.5/0/0
S
0
14/7.211103/8
5.8/0.52915/0.6
155/7.071068/5
12/0/0
89/1.825742/2
1.7/0/0
Note: Each term with the form “a/b/c” in Table 2 denotes “average value/standard deviation/maximum deviation”, for example the term “21/3.605551/4” represents a = 21, b = 3.605551, and c = 4.


#### 4.2.2. Translate All Index Values into Connection Number Vectors

Having obtained the deterministic terms and uncertain terms of the connection numbers above, all index values can be transformed into index vectors using (4). Table 3 shows the connection numbers converted from all indices.Table 3
Index vectors transformed from index values.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
21
+
3.605551
i
6
+
2
i
220
+
40
i
12
+
0
i
92
+
1.825742
i
1.8
+
0
i
S
2
16
+
4
i
3.7
+
0.793725
i
200
+
10
i
6
+
0
i
90
+
1.825742
i
1.4
+
0
i
S
3
26
+
4.582576
i
9.2
+
0.4
i
180
+
20
i
10
+
0
i
88
+
3.366502
i
2.7
+
0
i
S
4
10
+
3.605551
i
4
+
0.4
i
260
+
20
i
8
+
0
i
94
+
2.581989
i
1.2
+
0
i
S
5
30
+
5.291503
i
8.2
+
0.8544
i
350
+
10
i
10
+
0
i
96
+
1.82574
i
3.6
+
0
i
S
6
16
+
2
i
9.6
+
0.2
i
400
+
40
i
6
+
0
i
86
+
3.651484
i
1.3
+
0
i
S
7
40
+
6.244998
i
14
+
1
i
600
+
50
i
6
+
0
i
95
+
1.825742
i
2.1
+
0
i
S
8
12
+
3
i
12.8
+
0.6
i
120
+
20
i
10
+
0
i
91
+
2.160247
i
1.5
+
0
i
S
0
14
+
7.211103
i
5.8
+
0.52915
i
155
+
5
i
12
+
0
i
89
+
1.825742
i
1.7
+
0
i


#### 4.2.3. Calculate Nearness Degrees of All Index Vectors with the Fixed Index Vectors

All nearness degrees of all index vectors with the fixed index vectors can be calculated as shown in Table4 using Equations from (6) to (8).Table 4
Nearness degrees of all index vectors with the fixed index vectors.
q
i
j
A
1
A
2
A
3
A
4
A
5
A
6
q
1
j
4.5720046
0.332808
66.094653
0
2.999369
0.1
q
2
j
0.3076204
2.067276
45.137812
6
0.99979
0.3
q
3
j
9.4643938
3.374204
25.470622
2
0.968189
1
q
4
j
5.207005
1.804289
105.42903
4
5.014459
0.5
q
5
j
13.345019
2.419625
195.05983
2
6.998528
1.9
q
6
j
0.6081906
3.754378
246.00107
6
2.961924
0.4
q
7
j
22.671639
8.208865
446.21951
6
5.998738
0.4
q
8
j
3.7062887
6.977486
34.498185
2
2.00644
0.2


#### 4.2.4. Normalize the Nearness Degrees

The normalized nearness degrees shown in Table5 can be calculated using (14).Table 5
Normalized nearness degrees of all index vectors with the fixed index vectors.
Z
i
j
A
1
A
2
A
3
A
4
A
5
A
6
Z
1
j
0.076350
0.0115
0.0567867
0
0.107322
0.020833
Z
2
j
0.005137
0.071436
0.0387812
0.2143
0.035774
0.0625
Z
3
j
0.158050
0.116597
0.0218837
0.0714
0.034643
0.208333
Z
4
j
0.086954
0.062348
0.0905817
0.1429
0.179425
0.104167
Z
5
j
0.222855
0.083611
0.16759
0.0714
0.250418
0.395833
Z
6
j
0.010156
0.129735
0.2113573
0.2143
0.105982
0.083333
Z
7
j
0.378604
0.283662
0.3833795
0.2143
0.214644
0.083333
Z
8
j
0.061893
0.241111
0.0296399
0.0714
0.071793
0.041667


#### 4.2.5. Integrate the Normalized Nearness Degrees

Without considering all attribute weights, the integrated nearness degrees of all alternatives can be calculated asW = (0.272792, 0.427914, 0.610936, 0.666333, 1.191736, 0.754849, and 1.557908 0.517532). So the alternatives ranking is S1≻S2≻S8≻S3≻S4≻S6≻S5≻S7. In brief, S1 is the best selection for S0.If the attributesω = (0.11, 0.26, 0.07, 0.12, 0.21, 0.23) are given, then the weighted integrated nearness degrees of all alternatives can be calculated as W = (0.042693, 0.069455, 0.112996, 0.110897, 0.210185, 0.116780, 0.232191, and 0.104803). So the alternatives ranking is S1≻S2≻S8≻S4≻S3≻S6≻S5≻S7.


### 4.3. Discussion

A comparison between the order value method and the nearness degree method is performed to illustrate the advantage of the proposed method to determine the optimal alternative. Table6 shows the order values of all indices near the fixed indices determined by nearness degrees. The order values of all alternatives under some attribute are given by their index nearness degrees in terms of the principle of the smaller the better.Table 6
Order values of index vectors with fixed index vectors.
C
i
j
A
1
A
2
A
3
A
4
A
5
A
6
∑
C
i
j
C
1
j
4
1
4
1
5
1
16
C
2
j
1
3
3
4
2
3
16
C
3
j
6
5
1
2
1
6
21
C
4
j
5
2
5
3
6
5
26
C
5
j
7
4
6
2
8
7
34
C
6
j
2
6
7
4
4
4
27
C
7
j
8
8
8
4
7
4
39
C
8
j
3
7
2
2
3
2
19So the total integrated order values can be calculated asW = (16, 16, 21, 26, 34, 27, 39, 19) using (12). And the alternatives ranking is S1=S2≻S8≻S3≻S4≻S6≻S5≻S7.Table7 is the comparison of two types of calculation method: one by integrated order values and one by integrated nearness degrees. However, decision making by integrated nearness degrees includes considering the attribute weights or not.Table 7
Alternatives ranking with two types of method.
S
i
Order values
Nearness degrees (no weights)
Nearness degrees (weights)
C
i
Ranking
W
i
Ranking
W
i
Ranking
S
1
16
1
0.272792
1
0.042693
1
S
2
16
1
0.427914
2
0.069455
2
S
3
21
3
0.610936
4
0.112996
5
S
4
26
4
0.666333
5
0.110897
4
S
5
34
6
1.191736
7
0.210185
7
S
6
27
5
0.754849
6
0.116780
6
S
7
39
7
1.557908
8
0.232191
8
S
8
19
2
0.517532
3
0.104803
3Seen from Table7, alternatives ranking by order values is rough with the alternatives S1 and S2 in the same position. While the results by nearness degrees are accuracy with the alternatives S1 and S2 in different position. Furthermore, the proposed method can also use the attribute weights to reflect the decision makers’ preferences. There is somewhat difference between the decision making considering attribute weights or not.


## 4.1. Background

A coal enterprise is to select suitable safety management model from some coal enterprise with different advanced safety management level. The safety management model of a coal enterprise depends on some indices including seam dip (°), methane emission rate (m3/t), water inflow (m3/h), spontaneous combustion period (month), ventilating structures qualification rate (%), and equivalent orifice (m2) [21, 22] denoted by A1 to A6 respectively. Thus some coal enterprises with different index values can be regarded as different alternatives. Here S0 represents the specific coal enterprise wants to learn advanced safety management experience. And the eight feasible alternatives (coal enterprises) are denoted as S1 to S8 respectively. Besides the index values are given as mixed attribute values including real numbers, interval numbers, triangle fuzzy numbers and trapezoid fuzzy numbers. The aim of the decision makers is to seek for the most suitable enterprise whose safety management experiece can be learnt. So the proposed method can address this problem easily. The data is shown in Table 1.Table 1
Safety data from coal mines.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
[18, 20, 25]
[4, 6, 8]
[180, 260]
12
[90, 91, 93, 94]
1.8
S
2
[12, 16, 20]
[2.8, 4, 4.3]
[190, 210]
6
[88, 89, 91, 92]
1.4
S
3
[22, 25, 31]
[8.8, 9.2, 9.6]
[160, 200]
10
[84, 87, 89, 92]
2.7
S
4
[6, 11, 13]
[3.6, 4, 4.4]
[240, 280]
8
[91, 93, 95, 97]
1.2
S
5
[24, 32, 34]
[7.3, 8.3, 9]
[340, 360]
10
[94, 95, 97, 98]
3.6
S
6
[14, 16, 18]
[9.4, 9.6, 9.8]
[360, 440]
6
[82, 84, 88, 90]
1.3
S
7
[33, 42, 45]
[13, 14, 15]
[550, 650]
6
[93, 94, 96, 97]
2.1
S
8
[9, 12, 15]
[12, 13, 13.4]
[100, 140]
10
[89, 90, 91, 94]
1.5
S
0
[8, 12, 22]
[5.2, 6, 6.2]
[150, 160]
12
[87, 88, 90, 91]
1.7


## 4.2. Process of Decision Making

### 4.2.1. Calculate the Parameters of Index Vectors

All average values, standard deviations, and maximum deviations of all indices can be calculated using Equations from (1) to (3) and the results are shown in Table 2.Table 2
Average values, standard deviations, and maximum deviations of all indices.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
21/3.605551/4
6/2/2
220/56.56854/40
12/0/0
92/1.825742/2
1.8/0/0
S
2
16/4/4
3.7/0.793725/0.9
200/14.14214/10
6/0/0
90/1.825742/2
1.4/0/0
S
3
26/4.582576/5
9.2/0.4/0.4
180/28.28427/20
10/0/0
88/3.366502/4
2.7/0/0
S
4
10/3.605551/4
4/0.4/0.4
260/28.28427/20
8/0/0
94/2.581989/3
1.2/0/0
S
5
30/5.291503/6
8.2/0.8544/0.9
350/14.14214/10
10/0/0
96/1.825742/2
3.6/0/0
S
6
16/2/2
9.6/0.2/0.2
400/56.56854/40
6/0/0
86/3.651484/4
1.3/0/0
S
7
40/6.244998/7
14/1/1
600/70.71068/50
6/0/0
95/1.825742/2
2.1/0/0
S
8
12/3/3
12.8/0.72111/0.6
120/28.28427/20
10/0/0
91/2.160247/3
1.5/0/0
S
0
14/7.211103/8
5.8/0.52915/0.6
155/7.071068/5
12/0/0
89/1.825742/2
1.7/0/0
Note: Each term with the form “a/b/c” in Table 2 denotes “average value/standard deviation/maximum deviation”, for example the term “21/3.605551/4” represents a = 21, b = 3.605551, and c = 4.


### 4.2.2. Translate All Index Values into Connection Number Vectors

Having obtained the deterministic terms and uncertain terms of the connection numbers above, all index values can be transformed into index vectors using (4). Table 3 shows the connection numbers converted from all indices.Table 3
Index vectors transformed from index values.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
21
+
3.605551
i
6
+
2
i
220
+
40
i
12
+
0
i
92
+
1.825742
i
1.8
+
0
i
S
2
16
+
4
i
3.7
+
0.793725
i
200
+
10
i
6
+
0
i
90
+
1.825742
i
1.4
+
0
i
S
3
26
+
4.582576
i
9.2
+
0.4
i
180
+
20
i
10
+
0
i
88
+
3.366502
i
2.7
+
0
i
S
4
10
+
3.605551
i
4
+
0.4
i
260
+
20
i
8
+
0
i
94
+
2.581989
i
1.2
+
0
i
S
5
30
+
5.291503
i
8.2
+
0.8544
i
350
+
10
i
10
+
0
i
96
+
1.82574
i
3.6
+
0
i
S
6
16
+
2
i
9.6
+
0.2
i
400
+
40
i
6
+
0
i
86
+
3.651484
i
1.3
+
0
i
S
7
40
+
6.244998
i
14
+
1
i
600
+
50
i
6
+
0
i
95
+
1.825742
i
2.1
+
0
i
S
8
12
+
3
i
12.8
+
0.6
i
120
+
20
i
10
+
0
i
91
+
2.160247
i
1.5
+
0
i
S
0
14
+
7.211103
i
5.8
+
0.52915
i
155
+
5
i
12
+
0
i
89
+
1.825742
i
1.7
+
0
i


### 4.2.3. Calculate Nearness Degrees of All Index Vectors with the Fixed Index Vectors

All nearness degrees of all index vectors with the fixed index vectors can be calculated as shown in Table4 using Equations from (6) to (8).Table 4
Nearness degrees of all index vectors with the fixed index vectors.
q
i
j
A
1
A
2
A
3
A
4
A
5
A
6
q
1
j
4.5720046
0.332808
66.094653
0
2.999369
0.1
q
2
j
0.3076204
2.067276
45.137812
6
0.99979
0.3
q
3
j
9.4643938
3.374204
25.470622
2
0.968189
1
q
4
j
5.207005
1.804289
105.42903
4
5.014459
0.5
q
5
j
13.345019
2.419625
195.05983
2
6.998528
1.9
q
6
j
0.6081906
3.754378
246.00107
6
2.961924
0.4
q
7
j
22.671639
8.208865
446.21951
6
5.998738
0.4
q
8
j
3.7062887
6.977486
34.498185
2
2.00644
0.2


### 4.2.4. Normalize the Nearness Degrees

The normalized nearness degrees shown in Table5 can be calculated using (14).Table 5
Normalized nearness degrees of all index vectors with the fixed index vectors.
Z
i
j
A
1
A
2
A
3
A
4
A
5
A
6
Z
1
j
0.076350
0.0115
0.0567867
0
0.107322
0.020833
Z
2
j
0.005137
0.071436
0.0387812
0.2143
0.035774
0.0625
Z
3
j
0.158050
0.116597
0.0218837
0.0714
0.034643
0.208333
Z
4
j
0.086954
0.062348
0.0905817
0.1429
0.179425
0.104167
Z
5
j
0.222855
0.083611
0.16759
0.0714
0.250418
0.395833
Z
6
j
0.010156
0.129735
0.2113573
0.2143
0.105982
0.083333
Z
7
j
0.378604
0.283662
0.3833795
0.2143
0.214644
0.083333
Z
8
j
0.061893
0.241111
0.0296399
0.0714
0.071793
0.041667


### 4.2.5. Integrate the Normalized Nearness Degrees

Without considering all attribute weights, the integrated nearness degrees of all alternatives can be calculated asW = (0.272792, 0.427914, 0.610936, 0.666333, 1.191736, 0.754849, and 1.557908 0.517532). So the alternatives ranking is S1≻S2≻S8≻S3≻S4≻S6≻S5≻S7. In brief, S1 is the best selection for S0.If the attributesω = (0.11, 0.26, 0.07, 0.12, 0.21, 0.23) are given, then the weighted integrated nearness degrees of all alternatives can be calculated as W = (0.042693, 0.069455, 0.112996, 0.110897, 0.210185, 0.116780, 0.232191, and 0.104803). So the alternatives ranking is S1≻S2≻S8≻S4≻S3≻S6≻S5≻S7.


## 4.2.1. Calculate the Parameters of Index Vectors

All average values, standard deviations, and maximum deviations of all indices can be calculated using Equations from (1) to (3) and the results are shown in Table 2.Table 2
Average values, standard deviations, and maximum deviations of all indices.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
21/3.605551/4
6/2/2
220/56.56854/40
12/0/0
92/1.825742/2
1.8/0/0
S
2
16/4/4
3.7/0.793725/0.9
200/14.14214/10
6/0/0
90/1.825742/2
1.4/0/0
S
3
26/4.582576/5
9.2/0.4/0.4
180/28.28427/20
10/0/0
88/3.366502/4
2.7/0/0
S
4
10/3.605551/4
4/0.4/0.4
260/28.28427/20
8/0/0
94/2.581989/3
1.2/0/0
S
5
30/5.291503/6
8.2/0.8544/0.9
350/14.14214/10
10/0/0
96/1.825742/2
3.6/0/0
S
6
16/2/2
9.6/0.2/0.2
400/56.56854/40
6/0/0
86/3.651484/4
1.3/0/0
S
7
40/6.244998/7
14/1/1
600/70.71068/50
6/0/0
95/1.825742/2
2.1/0/0
S
8
12/3/3
12.8/0.72111/0.6
120/28.28427/20
10/0/0
91/2.160247/3
1.5/0/0
S
0
14/7.211103/8
5.8/0.52915/0.6
155/7.071068/5
12/0/0
89/1.825742/2
1.7/0/0
Note: Each term with the form “a/b/c” in Table 2 denotes “average value/standard deviation/maximum deviation”, for example the term “21/3.605551/4” represents a = 21, b = 3.605551, and c = 4.


## 4.2.2. Translate All Index Values into Connection Number Vectors

Having obtained the deterministic terms and uncertain terms of the connection numbers above, all index values can be transformed into index vectors using (4). Table 3 shows the connection numbers converted from all indices.Table 3
Index vectors transformed from index values.
S
i
A
1
A
2
A
3
A
4
A
5
A
6
S
1
21
+
3.605551
i
6
+
2
i
220
+
40
i
12
+
0
i
92
+
1.825742
i
1.8
+
0
i
S
2
16
+
4
i
3.7
+
0.793725
i
200
+
10
i
6
+
0
i
90
+
1.825742
i
1.4
+
0
i
S
3
26
+
4.582576
i
9.2
+
0.4
i
180
+
20
i
10
+
0
i
88
+
3.366502
i
2.7
+
0
i
S
4
10
+
3.605551
i
4
+
0.4
i
260
+
20
i
8
+
0
i
94
+
2.581989
i
1.2
+
0
i
S
5
30
+
5.291503
i
8.2
+
0.8544
i
350
+
10
i
10
+
0
i
96
+
1.82574
i
3.6
+
0
i
S
6
16
+
2
i
9.6
+
0.2
i
400
+
40
i
6
+
0
i
86
+
3.651484
i
1.3
+
0
i
S
7
40
+
6.244998
i
14
+
1
i
600
+
50
i
6
+
0
i
95
+
1.825742
i
2.1
+
0
i
S
8
12
+
3
i
12.8
+
0.6
i
120
+
20
i
10
+
0
i
91
+
2.160247
i
1.5
+
0
i
S
0
14
+
7.211103
i
5.8
+
0.52915
i
155
+
5
i
12
+
0
i
89
+
1.825742
i
1.7
+
0
i


## 4.2.3. Calculate Nearness Degrees of All Index Vectors with the Fixed Index Vectors

All nearness degrees of all index vectors with the fixed index vectors can be calculated as shown in Table4 using Equations from (6) to (8).Table 4
Nearness degrees of all index vectors with the fixed index vectors.
q
i
j
A
1
A
2
A
3
A
4
A
5
A
6
q
1
j
4.5720046
0.332808
66.094653
0
2.999369
0.1
q
2
j
0.3076204
2.067276
45.137812
6
0.99979
0.3
q
3
j
9.4643938
3.374204
25.470622
2
0.968189
1
q
4
j
5.207005
1.804289
105.42903
4
5.014459
0.5
q
5
j
13.345019
2.419625
195.05983
2
6.998528
1.9
q
6
j
0.6081906
3.754378
246.00107
6
2.961924
0.4
q
7
j
22.671639
8.208865
446.21951
6
5.998738
0.4
q
8
j
3.7062887
6.977486
34.498185
2
2.00644
0.2


## 4.2.4. Normalize the Nearness Degrees

The normalized nearness degrees shown in Table5 can be calculated using (14).Table 5
Normalized nearness degrees of all index vectors with the fixed index vectors.
Z
i
j
A
1
A
2
A
3
A
4
A
5
A
6
Z
1
j
0.076350
0.0115
0.0567867
0
0.107322
0.020833
Z
2
j
0.005137
0.071436
0.0387812
0.2143
0.035774
0.0625
Z
3
j
0.158050
0.116597
0.0218837
0.0714
0.034643
0.208333
Z
4
j
0.086954
0.062348
0.0905817
0.1429
0.179425
0.104167
Z
5
j
0.222855
0.083611
0.16759
0.0714
0.250418
0.395833
Z
6
j
0.010156
0.129735
0.2113573
0.2143
0.105982
0.083333
Z
7
j
0.378604
0.283662
0.3833795
0.2143
0.214644
0.083333
Z
8
j
0.061893
0.241111
0.0296399
0.0714
0.071793
0.041667


## 4.2.5. Integrate the Normalized Nearness Degrees

Without considering all attribute weights, the integrated nearness degrees of all alternatives can be calculated asW = (0.272792, 0.427914, 0.610936, 0.666333, 1.191736, 0.754849, and 1.557908 0.517532). So the alternatives ranking is S1≻S2≻S8≻S3≻S4≻S6≻S5≻S7. In brief, S1 is the best selection for S0.If the attributesω = (0.11, 0.26, 0.07, 0.12, 0.21, 0.23) are given, then the weighted integrated nearness degrees of all alternatives can be calculated as W = (0.042693, 0.069455, 0.112996, 0.110897, 0.210185, 0.116780, 0.232191, and 0.104803). So the alternatives ranking is S1≻S2≻S8≻S4≻S3≻S6≻S5≻S7.


## 4.3. Discussion

A comparison between the order value method and the nearness degree method is performed to illustrate the advantage of the proposed method to determine the optimal alternative. Table6 shows the order values of all indices near the fixed indices determined by nearness degrees. The order values of all alternatives under some attribute are given by their index nearness degrees in terms of the principle of the smaller the better.Table 6
Order values of index vectors with fixed index vectors.
C
i
j
A
1
A
2
A
3
A
4
A
5
A
6
∑
C
i
j
C
1
j
4
1
4
1
5
1
16
C
2
j
1
3
3
4
2
3
16
C
3
j
6
5
1
2
1
6
21
C
4
j
5
2
5
3
6
5
26
C
5
j
7
4
6
2
8
7
34
C
6
j
2
6
7
4
4
4
27
C
7
j
8
8
8
4
7
4
39
C
8
j
3
7
2
2
3
2
19So the total integrated order values can be calculated asW = (16, 16, 21, 26, 34, 27, 39, 19) using (12). And the alternatives ranking is S1=S2≻S8≻S3≻S4≻S6≻S5≻S7.Table7 is the comparison of two types of calculation method: one by integrated order values and one by integrated nearness degrees. However, decision making by integrated nearness degrees includes considering the attribute weights or not.Table 7
Alternatives ranking with two types of method.
S
i
Order values
Nearness degrees (no weights)
Nearness degrees (weights)
C
i
Ranking
W
i
Ranking
W
i
Ranking
S
1
16
1
0.272792
1
0.042693
1
S
2
16
1
0.427914
2
0.069455
2
S
3
21
3
0.610936
4
0.112996
5
S
4
26
4
0.666333
5
0.110897
4
S
5
34
6
1.191736
7
0.210185
7
S
6
27
5
0.754849
6
0.116780
6
S
7
39
7
1.557908
8
0.232191
8
S
8
19
2
0.517532
3
0.104803
3Seen from Table7, alternatives ranking by order values is rough with the alternatives S1 and S2 in the same position. While the results by nearness degrees are accuracy with the alternatives S1 and S2 in different position. Furthermore, the proposed method can also use the attribute weights to reflect the decision makers’ preferences. There is somewhat difference between the decision making considering attribute weights or not.


## 5. Conclusions

An improved fuzzy similar priority method was proposed to handle alternatives for mixed attributes. The proposed method solves the mixed attributes using the nearness degrees as derived from the similarity of the index vectors. And it improves the uncertain term of the index vector by selecting the minimum of the standard deviation or the minimum deviation of the parameters of the index and will contribute to the accuracy in result. Furthermore, the new method can reflect the decision maker’s preferences through considering attribute weights. Another feature of this method is that its procedure and calculation are simple. A case study illustrated that it has advantages over the classical method.



---

*Source: 304202-2014-09-03.xml*