# Repairing the Inconsistent Fuzzy Preference Matrix Using Multiobjective PSO

Authors: Abba Suganda Girsang; Chun-Wei Tsai; Chu-Sing Yang
Journal: Advances in Fuzzy Systems
 (2015)

---

## Abstract

This paper presents a method using multiobjective particle swarm optimization (PSO) approach to improve the consistency matrix in analytic hierarchy process (AHP), called PSOMOF. The purpose of this method is to optimize two objectives which conflict each other, while improving the consistency matrix. They are minimizing consistent ratio (CR) and deviation matrix. This study focuses on fuzzy preference matrix as one model comparison matrix in AHP. Some inconsistent matrices are repaired successfully to be consistent by this method. This proposed method offers some alternative consistent matrices as solutions.


---

## Body

## 1. Introduction

One important issue in comparison matrix of AHP is the consistency. In multicriteria decision making (MCDM), decision makers (DMs) reveal their opinion to choose some decision alternatives by a comparison matrix [1]. However, the comparison matrix which is identified as inconsistent cannot be used as a judgment. Meanwhile, the consistency is hard to obtain, when evaluating a large number of criteria.There are two models of a comparison matrix, multiplicative preference relations [1] and fuzzy preference relations [2, 3]. The element comparison matrix of multiplicative preference relation is stated as a
i
j which defines the dominance of alternative i over j, where 1
<
a
i
j
<
9 and a
i
j
=
1
/
a
j
i. On fuzzy preference relations, element comparison matrix is stated as a
i
j, which defines the preference of alternative i over j, where 0
<
a
i
j
<
1 and a
i
j
+
a
j
i
=
1. This study focuses on fuzzy preference relations.The issues of consistency in fuzzy preference relation also have received attention from researchers. Xu and Wang [4] proposed a revised approach by using linear programming models to generate the priority weights for additive interval fuzzy preference relations. Xu and Chen [5] presented the method to fulfill the element, which is incomplete on fuzzy preference for group decision making based on additive transitive consistency and accumulates the auxiliary value into a group auxiliary relation. This research was extended by Xu et al. [6], who deduced a function between the additive transitivity fuzzy preference and its corresponding priority vector. Xu et al. [7] proposed algorithm by eliminating the cycles of length 3 to n in the digraph of the incomplete reciprocal preference relation and converted it to the one with ordinal consistency. Liu et al. [8] proposed a method to solve the incompleteness of fuzzy preference matrix and also repair the inconsistency preference matrix. This method calculated minimal of the squared error of the incomplete fuzzy preference relation and its priority weight vector to fulfill the missing values and generated the consistency fuzzy preference such that the modified one is the closest to the original one. Chen et al. [9] presented a method for group decision making using incomplete fuzzy preference based on additive consistency. Chiclana et al. [10] proposed a functional equation to model the cardinal consistency in the strength of preferences of reciprocal preference relations. Xia et al. [11] improved the consistency by using the geometric consistency index in complete and incomplete fuzzy preference.A research using swarm intelligence was also used to solve the inconsistent comparison matrix such as PSO which combines Taguchi method [12]. It improved the previous research using genetic algorithm [13] to solve the inconsistent comparison matrix. Both researches used the same objective function to solve the problem, that is, summing the CR and deviation matrix. Although successful metaheuristic to solve that problem, the variations of implemented metaheuristic, is rarely conducted. Girsang et al. [14, 15] also already implemented the ant colony optimization (ACO) approach in our previous research to solve this problem with the different objective function that uses Yang et al. [12] and Lin et al. [13]. In [14], besides repairing the inconsistent ratio, ACO is used to enhance the minimal deviation matrix, while in [15] ACO is used to enhance the minimal consistent ratio. It becomes a promising research to consider both of the two objective functions using swarm intelligence. Girsang et al. [16] also implemented PSO with multiobjective approach; however, it only focuses on repairing the multiplicative preference matrix.


## 2. Related Work

### 2.1. Consistent Ratio in AHP

A simple illustration about inconsistency is described as follows. The decision maker (DM) has opinion thatX is bigger than Y and Y is bigger than Z. The consistent logic of this case is that X should be bigger than Z. Contrarily, it would be inconsistent if DM said that Z is bigger than X. In AHP, the opinion of decision makers is represented in a comparison matrix. An element comparison matrix can reflect the subjective opinion that expose strength of the preference and the feeling. In a fuzzy preference matrix, the element of comparison matrix, A, can be expressed as a
i
j, with a scale value (0
⋯
1) where 0
<
a
i
j
<
1, a
i
j
+
a
j
i
=
1, and a
i
i
=
0.5. Matrix A as Fuzzy preference relation can be depicted as follows:(1)
A
=
0.5
1
-
a
21
1
-
a
31
1
-
a
41
a
21
0.5
1
-
a
32
1
-
a
42
a
31
a
32
0.5
1
-
a
43
a
41
a
42
a
43
0.5
.To measure the multiplicative consistency in a comparison matrix, Saaty defined consistent ratio (CR). He proposed that the threshold of CR in multiplicative preference matrixes is 0.1. The CR is defined as(2)
A
W
=
λ
max
⁡
W
,
(3)
CI
=
λ
max
⁡
-
n
n
-
1
,
(4)
CR
=
CI
RI
,where λ
m
a
x and W are the eigenvalue and eigenvector of the matrix, respectively. Further, CI is the consistency index; n represents number criteria or size matrix, and the RI (random consistency index) is the average index of randomly generated weights. The value of RI on each size matrices is described in Table 1. A CR less than 0.1 can be categorized as consistent matrix. Perfect consistency is obtained when the maximum eigenvalue equal to the number criteria (λ
m
a
x
=
n).Table 1
Random consistency index (RI).
Number criteria
1
2
3
4
5
6
7
8
9
0
0
0.58
0.9
1.12
1.24
1.32
1.41
1.45Herrera-Viedma et al. [17] proposed some definitions to reveal the consistency in a fuzzy preference matrix. They show that the additive consistency is more appropriate to define the degree of consistency of fuzzy preference matrix. The relation in matrix A is consistent if the element matrix can satisfy (5) and (6):(5)
a
i
j
+
a
j
k
+
a
k
i
=
3
2
,
∀
i
,
j
,
k
,where(6)
w
i
=
∑
j
=
1
n
a
i
j
-
0.5
n
n
-
1
/
2
.Xu and Da [18] proposed determining the multiplicative consistency in the fuzzy preference matrix. They used Xu’s [19] approach to determine CI in multiplicative preference matrix. Suppose b
i
j is the element of multiplicative of preference matrix. Xu [19] defined the CI in (7). This equation is derived from (3). By knowing the weight of each criterion and element of matrix, CI can be obtained:(7)
CI
=
1
n
n
-
1
∑
1
≤
i
≤
j
≤
n
b
i
j
·
w
j
w
i
+
b
j
i
·
w
i
w
j
-
2
,where b
i
j is element matrix of multiplicative preference matrix and w
=
(
w
1
,
w
2
,
w
3
,
…
,
w
n
) is the weight of each criterion. To determine the CI in a fuzzy preference matrix, [4, 18] used converting with assumption b
i
j
=
a
i
j
/
a
j
i, where a
i
j is element matrix of the fuzzy preference matrix. Therefore, they proposed determining CI as in (8)
CI
=
1
n
n
-
1
∑
1
≤
i
≤
j
≤
n
a
i
j
a
j
i
·
w
j
w
i
+
a
j
i
a
i
j
·
w
i
w
j
-
2
.


### 2.2. Deviation Matrix

While the consistent ratio is repaired, the modified matrix automatically generates the deviation matrix from the original. Ideally, the modified matrices are kept closer to their original matrices in order to maintain the original judgment. It means that the deviation matrix is enriched to be minimal. There are some methods to represent the deviation, such as difference index (D
i) [13] and δ and σ. Difference index (Di) is defined as the real difference between the same gene values in two genotypes. The other deviation is defined as δ and σ, which is denoted as (9)
δ
=
max
i
,
j
⁡
a
i
,
j
′
-
a
i
,
j
,
(10)
σ
=
∑
i
=
1
n
∑
j
=
1
n
a
i
,
j
′
-
a
i
,
j
2
n
,where A is the original matrix [a
i
j]; A is the modified matrix [a
i
,
j
′], and n is the matrix size.In the multiplicative preference matrix, the difference index (Di) is generally used to measure the distance between two matrices. However, in fuzzy preference matrix,δ and σ are considered as more appropriate to represent the deviation matrix. Since the value preference will be 0.51 to 1 or 0 to 0.49, the division each all genes in Di will not be different significantly. As a consequence, the difference of two matrices will not be significant as well. Therefore, in this study, instead of using Di, σ is employed to define the deviation matrix for the preference fuzzy matrix.


### 2.3. Particle Swarm Optimization

PSO was firstly proposed by Kennedy and Eberhart [20]. It is population-based stochastic optimization on the social behaviors observed in animals or insects such as bird flocking, fish schooling, and animal herding. In PSO, each particle of swarm represents the solution which moves to search the optimal solutions. Each particle also broadcasts its current position to neighbour particles. The position of each particle is adjusted according to its velocity and the best position it has found so far. A particle i starts moving with a velocity V
i
(
t
+
1
) from its current position X
i
(
t
), to the next position X
i
(
t
+
1
), as in (11). The velocity is influenced by three factors: (a) previous velocity V
i
(
t
), (b) the best previous particle position X
p
(
t
), and (c) the best previous swarm particle position X
g
(
t
). It can be stated as (12):(11)
X
i
t
+
1
=
X
i
t
+
V
i
t
+
1
(12)
V
i
t
+
1
=
w
∗
V
i
t
+
C
1
∗
R
1
X
p
t
-
X
i
t
+
C
2
∗
R
2
X
g
t
-
X
i
t
,where w is the weight to control the convergence of the velocity, C
1 the acceleration weight cognitive element, C
2 the weight of social parameter, and R
1 and R
2 are random numbers in the range [0,1].


## 2.1. Consistent Ratio in AHP

A simple illustration about inconsistency is described as follows. The decision maker (DM) has opinion thatX is bigger than Y and Y is bigger than Z. The consistent logic of this case is that X should be bigger than Z. Contrarily, it would be inconsistent if DM said that Z is bigger than X. In AHP, the opinion of decision makers is represented in a comparison matrix. An element comparison matrix can reflect the subjective opinion that expose strength of the preference and the feeling. In a fuzzy preference matrix, the element of comparison matrix, A, can be expressed as a
i
j, with a scale value (0
⋯
1) where 0
<
a
i
j
<
1, a
i
j
+
a
j
i
=
1, and a
i
i
=
0.5. Matrix A as Fuzzy preference relation can be depicted as follows:(1)
A
=
0.5
1
-
a
21
1
-
a
31
1
-
a
41
a
21
0.5
1
-
a
32
1
-
a
42
a
31
a
32
0.5
1
-
a
43
a
41
a
42
a
43
0.5
.To measure the multiplicative consistency in a comparison matrix, Saaty defined consistent ratio (CR). He proposed that the threshold of CR in multiplicative preference matrixes is 0.1. The CR is defined as(2)
A
W
=
λ
max
⁡
W
,
(3)
CI
=
λ
max
⁡
-
n
n
-
1
,
(4)
CR
=
CI
RI
,where λ
m
a
x and W are the eigenvalue and eigenvector of the matrix, respectively. Further, CI is the consistency index; n represents number criteria or size matrix, and the RI (random consistency index) is the average index of randomly generated weights. The value of RI on each size matrices is described in Table 1. A CR less than 0.1 can be categorized as consistent matrix. Perfect consistency is obtained when the maximum eigenvalue equal to the number criteria (λ
m
a
x
=
n).Table 1
Random consistency index (RI).
Number criteria
1
2
3
4
5
6
7
8
9
0
0
0.58
0.9
1.12
1.24
1.32
1.41
1.45Herrera-Viedma et al. [17] proposed some definitions to reveal the consistency in a fuzzy preference matrix. They show that the additive consistency is more appropriate to define the degree of consistency of fuzzy preference matrix. The relation in matrix A is consistent if the element matrix can satisfy (5) and (6):(5)
a
i
j
+
a
j
k
+
a
k
i
=
3
2
,
∀
i
,
j
,
k
,where(6)
w
i
=
∑
j
=
1
n
a
i
j
-
0.5
n
n
-
1
/
2
.Xu and Da [18] proposed determining the multiplicative consistency in the fuzzy preference matrix. They used Xu’s [19] approach to determine CI in multiplicative preference matrix. Suppose b
i
j is the element of multiplicative of preference matrix. Xu [19] defined the CI in (7). This equation is derived from (3). By knowing the weight of each criterion and element of matrix, CI can be obtained:(7)
CI
=
1
n
n
-
1
∑
1
≤
i
≤
j
≤
n
b
i
j
·
w
j
w
i
+
b
j
i
·
w
i
w
j
-
2
,where b
i
j is element matrix of multiplicative preference matrix and w
=
(
w
1
,
w
2
,
w
3
,
…
,
w
n
) is the weight of each criterion. To determine the CI in a fuzzy preference matrix, [4, 18] used converting with assumption b
i
j
=
a
i
j
/
a
j
i, where a
i
j is element matrix of the fuzzy preference matrix. Therefore, they proposed determining CI as in (8)
CI
=
1
n
n
-
1
∑
1
≤
i
≤
j
≤
n
a
i
j
a
j
i
·
w
j
w
i
+
a
j
i
a
i
j
·
w
i
w
j
-
2
.


## 2.2. Deviation Matrix

While the consistent ratio is repaired, the modified matrix automatically generates the deviation matrix from the original. Ideally, the modified matrices are kept closer to their original matrices in order to maintain the original judgment. It means that the deviation matrix is enriched to be minimal. There are some methods to represent the deviation, such as difference index (D
i) [13] and δ and σ. Difference index (Di) is defined as the real difference between the same gene values in two genotypes. The other deviation is defined as δ and σ, which is denoted as (9)
δ
=
max
i
,
j
⁡
a
i
,
j
′
-
a
i
,
j
,
(10)
σ
=
∑
i
=
1
n
∑
j
=
1
n
a
i
,
j
′
-
a
i
,
j
2
n
,where A is the original matrix [a
i
j]; A is the modified matrix [a
i
,
j
′], and n is the matrix size.In the multiplicative preference matrix, the difference index (Di) is generally used to measure the distance between two matrices. However, in fuzzy preference matrix,δ and σ are considered as more appropriate to represent the deviation matrix. Since the value preference will be 0.51 to 1 or 0 to 0.49, the division each all genes in Di will not be different significantly. As a consequence, the difference of two matrices will not be significant as well. Therefore, in this study, instead of using Di, σ is employed to define the deviation matrix for the preference fuzzy matrix.


## 2.3. Particle Swarm Optimization

PSO was firstly proposed by Kennedy and Eberhart [20]. It is population-based stochastic optimization on the social behaviors observed in animals or insects such as bird flocking, fish schooling, and animal herding. In PSO, each particle of swarm represents the solution which moves to search the optimal solutions. Each particle also broadcasts its current position to neighbour particles. The position of each particle is adjusted according to its velocity and the best position it has found so far. A particle i starts moving with a velocity V
i
(
t
+
1
) from its current position X
i
(
t
), to the next position X
i
(
t
+
1
), as in (11). The velocity is influenced by three factors: (a) previous velocity V
i
(
t
), (b) the best previous particle position X
p
(
t
), and (c) the best previous swarm particle position X
g
(
t
). It can be stated as (12):(11)
X
i
t
+
1
=
X
i
t
+
V
i
t
+
1
(12)
V
i
t
+
1
=
w
∗
V
i
t
+
C
1
∗
R
1
X
p
t
-
X
i
t
+
C
2
∗
R
2
X
g
t
-
X
i
t
,where w is the weight to control the convergence of the velocity, C
1 the acceleration weight cognitive element, C
2 the weight of social parameter, and R
1 and R
2 are random numbers in the range [0,1].


## 3. Proposed Method

### 3.1. PSOMOF Algorithm

In PSO, each particle seeks the best position by moving in the search space. The position in PSO can represent an element in the comparison matrix. As shown in previous section, encoding position of element matrix can be encoded only from lower triangular matrix. If matrixA is identified as an inconsistent matrix and needs to be repaired, then the scale value of matrix should be changed with new value. To be efficient, the whole elements of comparison matrix can be represented by lower triangular matrix. Therefore, the position of PSO that should be changed can be represented only by the lower triangular matrix. When changing the value of each node to be consistent, it also changes the rate consistent ratio (CR) and deviation matrix. We use σ to represent the deviation matrix in this method. Changing the value of each node means changing the particle’s position. In PSO, the position is affected by a particles historical best position (local best) and the swarms’ best position (global best). The solution (new value position) is performed to chase the consistent rate. However, as previously mentioned, there is no one solution which can achieve CR and σ minimal at the same time. PSOMOF algorithm is proposed by constructing the nondominated solutions which depicts the relation between σ and CR. Algorithm 1 shows the outline of PSOMOF algorithm. In this method, there are three steps in which each step uses PSO to get the result matrices:(1)
Minimize
σ
Step. Firstly, each particle (there are 200 particles) generates its position and its velocity randomly. The position particle means that the particle generates randomly the candidate for the modified matrix. The element matrix can be represented only by the lower triangular matrix elements consecutively. The velocity particle means that the particle generates the value as adding/diminishing the position of the particles. The initial position of each particle X
i
(
t
) is set the same as the original position. The initial velocity of each particle V
i
(
t
) is set randomly but lower than 0.1. The best historical particle is defined as X
p, and the best position for all particles is defined as X
g. Initially, X
p is taken from the first position particle generated, while X
g is taken from the best position from the first position of all particles generated. In the next iteration, based on the previous velocity information, X
p, X
g, and some variables (w
,
C
1
,
C
2
,
R
1
,
R
2), the velocity of each particle is updated as described in (12). To set the value of variables, some experiments are conducted and the new position will be obtained based on the updated velocity, as described in (11). The evaluation of the fitness function is minimizing. However, if a particles σ is worse than before, or CR
>
0.1, the update will be cancelled. The result of this fitness function also updates the new best historical position of each particle (X
p) and the new best position of all particles as a group (X
g). This process is repeated until the iteration maximum is reached.
(2)
Minimize CR Step. It is almost the same as step (1). If step (1) minimizes σ as its fitness function, then step (2) minimizes CR as its fitness function.
(3)
Obtain a Set of Nondominated CR-
σ
Solutions Step. It is also the same as the process to minimize σ. Yet the process adds some various CRs, which are decreased gradually until CRmin is reached.Algorithm 1:PSOMOF algorithm.
Initialize ()
Minimize
σ ()
For each particle generates the position and velocity randomly.
Xp  ← the initial position // Xp is the particles best historical
Xg  ← the initial position //Xg is the best of all particles
Repeat
Determine velocity using (12).
Update new position particle using (11).
Determineσ of new position using (10). If the new position has a lower σ and CR < 0.1 updated new position is allowed
otherwise, update new position is canceled and keeping the current position.
Choosing the newXp and Xg based on value σ
Until max iterations is reached
Get minimalσ
Minimize CR ()
For each particle generates the position and velocity randomly.
Xp  ← the initial position // Xp is the particles best historical
Xg  ← the initial position //Xg is the best of all particles
Repeat
Determine velocity using (12).
Update new position particle using (11).
Determine CR of new position using (4). If the new position has a lower CR and CR < 0.1 updated new position is allowed
otherwise, update new position is canceled and keeping the current position.
Choosing the newXp and Xg based on value CR
Until max iterations is reached
Get minimal CR
MinimizeCR-σ ()
CRo← 0.1
Xp  ← the initial position // Xp is the particles best historical
Xg  ← the initial position //Xg is the best of all particles
While CRmin < CRo
Repeat
Determine velocity using (12).
Update new position particle using (11).
Determine CR of new position using (4). If the new position has a lower CR and CR < 0.1 updated new position is allowed
otherwise, update new position is canceled and keeping the current position.
Choosing the newXp and Xg based on value CR
Until max iterations is reached
Store the modified matrix and its CR,σ
CRo← CRo − k // k is small value, in this study k
=
0.001
End While
Get matrices with their CR,σ


### 3.2. Encoding and Fractioning of Original Element Matrix

The encoding of matrix can be assembled by picking all elements in matrix. However, because the elements of fuzzy preference matrix (FPM) have a relation such thata
i
j
+
a
j
i
=
1 and a
i
i
=
0.5, encoding node can only encode the lower triangular elements of the matrix as nodes:(13)
A
=
0.5
0.6
0.4
0.8
0.4
0.5
0.3
0.7
0.6
0.7
0.5
0.9
0.2
0.3
0.1
0.5
Encode
A
=
0.4
-
0.6
-
0.7
-
0.2
-
0.3
-
0.1
.Equation (13) shows matrix A with n
=
4 and its encoding for FPM by picking row by row sequentially in the elements of the lower triangular matrix. The number element of encoding A can be determined n
2
-
n
/
2. To obtain consistent matrix, of course, the value of each element matrix should be changed to a new value. The new values are chosen from the values of several candidates. Candidates elements are generated using the original fractioned value. If the original element is more than 0.5, the candidates will be between 0.5 and 1; if the original element is less than 0.5, the candidates will be between 0 and 0.5; if the original element is 0.5 (neutral), the candidate is still 0.5, or the original data should not be fractioned. This approach makes the candidate element not change the judgment tendency but will only change the judgment weight. The number of candidate elements is based on the fraction factor (ψ). For example, if ψ
=
0.01, then the number candidate will be 50
(
=
(
1
-
0.5
)
/
0.01
). Suppose that matrix A, a
r is one of the original elements on node r, and n is the matrix size; thus, the sequence of nodes traveled, G
A, can be defined as (14)
G
A
=
a
1
,
a
2
,
a
3
,
…
,
a
n
2
-
n
/
2
.Each element origin,a
r, is fractioned into several candidate elements a
r
s, where s denotes the index of the candidate element, as described in (15)
a
r
s
=
a
r
s
-
1
+
ψ
a
r
0
=
0
,
if
0
≤
a
r
<
0.5
,
0.5
,
if
0.5
<
a
r
≤
1
,where r
=
1,2
,
3
,
…
,
(
n
2
-
n
)
/
2; s
=
1,2
,
3
,
…
,
(
1
-
0.5
)
/
ψ.Table2 shows the original element and its candidate as a result of being fractioned if ψ = 0.01. There are 50 candidates to substitute for the origin element.Table 2
The original element and its candidate withψ
=
0.01.
Origin element
Candidate element
0.5
0.5
0, 0.1, 0.2, 0.3, 0.4
0, 0.01, 0.02, …, 0.48, 0.49
0.6, 0.7, 0.8, 0.9, 1
0.51, 0.52, 0.53, …, 0.99, 1These fractioned elements can be used as candidate nodes to travel by particle in PSOMOF. The particle will move from the candidate in one node to the candidate in the next node. However, it is possible that the particle preserves the original element.


### 3.3. Determining CI in a Fuzzy Preference Matrix

Determining CI on fuzzy preference matrix by using (8) as a transforming from (7) is not suitable. Transformation using operation b
i
j
=
a
i
j
/
a
j
i is not appropriate because it can exceed the threshold of the multiplicative matrix element. For example, suppose a
i
j
=
0.95 and a
j
i
=
0.05. By transforming the above formula, b
i
j will be 19. The value b
i
j exceeds 9, which is the threshold of the multiplicative element matrix. Therefore, in this study, we use a method to transform the fuzzy preference (a
i
j) to the multiplicative preference (b
i
j) as introduced by Herrera-Viedma et al. [17] to determine the multiplicative consistency as shown in (16)
b
i
j
=
9
2
∗
a
i
j
,
(17)
a
i
j
=
1
2
1
+
log
9
⁡
b
i
j
.Therefore, if the element fuzzy preference matrixa
i
j
=
0,95, it can be transformed to be the element multiplicative matrix b
i
j
=
7.22. This transformation value is not higher than the maximum scale of 9. By using (16), a new formula is proposed to determine the CI, as shown in (18)
CI
=
1
n
n
-
1
∑
1
≤
i
≤
j
≤
n
9
2
·
a
i
j
-
1
·
w
j
w
i
+
9
2
·
a
j
i
-
1
·
w
i
w
j
-
2
.To prove this formula, the consistent ratio rate of one sample matrix as shown in (13) is determined. This sample matrix is selected from Xu et al. [6]. According to (5), obviously, matrix A can be verified as a consistent matrix. Contrarily, matrix A is identified as an inconsistent matrix with C
R
=
0.11 when it is determined by (4) and (7). However, if (4) and (18) are used, CR will be 0.05 and therefore will be a consistent matrix as in the result of (5). Therefore, in this research, (18) is used to define the CI value.


## 3.1. PSOMOF Algorithm

In PSO, each particle seeks the best position by moving in the search space. The position in PSO can represent an element in the comparison matrix. As shown in previous section, encoding position of element matrix can be encoded only from lower triangular matrix. If matrixA is identified as an inconsistent matrix and needs to be repaired, then the scale value of matrix should be changed with new value. To be efficient, the whole elements of comparison matrix can be represented by lower triangular matrix. Therefore, the position of PSO that should be changed can be represented only by the lower triangular matrix. When changing the value of each node to be consistent, it also changes the rate consistent ratio (CR) and deviation matrix. We use σ to represent the deviation matrix in this method. Changing the value of each node means changing the particle’s position. In PSO, the position is affected by a particles historical best position (local best) and the swarms’ best position (global best). The solution (new value position) is performed to chase the consistent rate. However, as previously mentioned, there is no one solution which can achieve CR and σ minimal at the same time. PSOMOF algorithm is proposed by constructing the nondominated solutions which depicts the relation between σ and CR. Algorithm 1 shows the outline of PSOMOF algorithm. In this method, there are three steps in which each step uses PSO to get the result matrices:(1)
Minimize
σ
Step. Firstly, each particle (there are 200 particles) generates its position and its velocity randomly. The position particle means that the particle generates randomly the candidate for the modified matrix. The element matrix can be represented only by the lower triangular matrix elements consecutively. The velocity particle means that the particle generates the value as adding/diminishing the position of the particles. The initial position of each particle X
i
(
t
) is set the same as the original position. The initial velocity of each particle V
i
(
t
) is set randomly but lower than 0.1. The best historical particle is defined as X
p, and the best position for all particles is defined as X
g. Initially, X
p is taken from the first position particle generated, while X
g is taken from the best position from the first position of all particles generated. In the next iteration, based on the previous velocity information, X
p, X
g, and some variables (w
,
C
1
,
C
2
,
R
1
,
R
2), the velocity of each particle is updated as described in (12). To set the value of variables, some experiments are conducted and the new position will be obtained based on the updated velocity, as described in (11). The evaluation of the fitness function is minimizing. However, if a particles σ is worse than before, or CR
>
0.1, the update will be cancelled. The result of this fitness function also updates the new best historical position of each particle (X
p) and the new best position of all particles as a group (X
g). This process is repeated until the iteration maximum is reached.
(2)
Minimize CR Step. It is almost the same as step (1). If step (1) minimizes σ as its fitness function, then step (2) minimizes CR as its fitness function.
(3)
Obtain a Set of Nondominated CR-
σ
Solutions Step. It is also the same as the process to minimize σ. Yet the process adds some various CRs, which are decreased gradually until CRmin is reached.Algorithm 1:PSOMOF algorithm.
Initialize ()
Minimize
σ ()
For each particle generates the position and velocity randomly.
Xp  ← the initial position // Xp is the particles best historical
Xg  ← the initial position //Xg is the best of all particles
Repeat
Determine velocity using (12).
Update new position particle using (11).
Determineσ of new position using (10). If the new position has a lower σ and CR < 0.1 updated new position is allowed
otherwise, update new position is canceled and keeping the current position.
Choosing the newXp and Xg based on value σ
Until max iterations is reached
Get minimalσ
Minimize CR ()
For each particle generates the position and velocity randomly.
Xp  ← the initial position // Xp is the particles best historical
Xg  ← the initial position //Xg is the best of all particles
Repeat
Determine velocity using (12).
Update new position particle using (11).
Determine CR of new position using (4). If the new position has a lower CR and CR < 0.1 updated new position is allowed
otherwise, update new position is canceled and keeping the current position.
Choosing the newXp and Xg based on value CR
Until max iterations is reached
Get minimal CR
MinimizeCR-σ ()
CRo← 0.1
Xp  ← the initial position // Xp is the particles best historical
Xg  ← the initial position //Xg is the best of all particles
While CRmin < CRo
Repeat
Determine velocity using (12).
Update new position particle using (11).
Determine CR of new position using (4). If the new position has a lower CR and CR < 0.1 updated new position is allowed
otherwise, update new position is canceled and keeping the current position.
Choosing the newXp and Xg based on value CR
Until max iterations is reached
Store the modified matrix and its CR,σ
CRo← CRo − k // k is small value, in this study k
=
0.001
End While
Get matrices with their CR,σ


## 3.2. Encoding and Fractioning of Original Element Matrix

The encoding of matrix can be assembled by picking all elements in matrix. However, because the elements of fuzzy preference matrix (FPM) have a relation such thata
i
j
+
a
j
i
=
1 and a
i
i
=
0.5, encoding node can only encode the lower triangular elements of the matrix as nodes:(13)
A
=
0.5
0.6
0.4
0.8
0.4
0.5
0.3
0.7
0.6
0.7
0.5
0.9
0.2
0.3
0.1
0.5
Encode
A
=
0.4
-
0.6
-
0.7
-
0.2
-
0.3
-
0.1
.Equation (13) shows matrix A with n
=
4 and its encoding for FPM by picking row by row sequentially in the elements of the lower triangular matrix. The number element of encoding A can be determined n
2
-
n
/
2. To obtain consistent matrix, of course, the value of each element matrix should be changed to a new value. The new values are chosen from the values of several candidates. Candidates elements are generated using the original fractioned value. If the original element is more than 0.5, the candidates will be between 0.5 and 1; if the original element is less than 0.5, the candidates will be between 0 and 0.5; if the original element is 0.5 (neutral), the candidate is still 0.5, or the original data should not be fractioned. This approach makes the candidate element not change the judgment tendency but will only change the judgment weight. The number of candidate elements is based on the fraction factor (ψ). For example, if ψ
=
0.01, then the number candidate will be 50
(
=
(
1
-
0.5
)
/
0.01
). Suppose that matrix A, a
r is one of the original elements on node r, and n is the matrix size; thus, the sequence of nodes traveled, G
A, can be defined as (14)
G
A
=
a
1
,
a
2
,
a
3
,
…
,
a
n
2
-
n
/
2
.Each element origin,a
r, is fractioned into several candidate elements a
r
s, where s denotes the index of the candidate element, as described in (15)
a
r
s
=
a
r
s
-
1
+
ψ
a
r
0
=
0
,
if
0
≤
a
r
<
0.5
,
0.5
,
if
0.5
<
a
r
≤
1
,where r
=
1,2
,
3
,
…
,
(
n
2
-
n
)
/
2; s
=
1,2
,
3
,
…
,
(
1
-
0.5
)
/
ψ.Table2 shows the original element and its candidate as a result of being fractioned if ψ = 0.01. There are 50 candidates to substitute for the origin element.Table 2
The original element and its candidate withψ
=
0.01.
Origin element
Candidate element
0.5
0.5
0, 0.1, 0.2, 0.3, 0.4
0, 0.01, 0.02, …, 0.48, 0.49
0.6, 0.7, 0.8, 0.9, 1
0.51, 0.52, 0.53, …, 0.99, 1These fractioned elements can be used as candidate nodes to travel by particle in PSOMOF. The particle will move from the candidate in one node to the candidate in the next node. However, it is possible that the particle preserves the original element.


## 3.3. Determining CI in a Fuzzy Preference Matrix

Determining CI on fuzzy preference matrix by using (8) as a transforming from (7) is not suitable. Transformation using operation b
i
j
=
a
i
j
/
a
j
i is not appropriate because it can exceed the threshold of the multiplicative matrix element. For example, suppose a
i
j
=
0.95 and a
j
i
=
0.05. By transforming the above formula, b
i
j will be 19. The value b
i
j exceeds 9, which is the threshold of the multiplicative element matrix. Therefore, in this study, we use a method to transform the fuzzy preference (a
i
j) to the multiplicative preference (b
i
j) as introduced by Herrera-Viedma et al. [17] to determine the multiplicative consistency as shown in (16)
b
i
j
=
9
2
∗
a
i
j
,
(17)
a
i
j
=
1
2
1
+
log
9
⁡
b
i
j
.Therefore, if the element fuzzy preference matrixa
i
j
=
0,95, it can be transformed to be the element multiplicative matrix b
i
j
=
7.22. This transformation value is not higher than the maximum scale of 9. By using (16), a new formula is proposed to determine the CI, as shown in (18)
CI
=
1
n
n
-
1
∑
1
≤
i
≤
j
≤
n
9
2
·
a
i
j
-
1
·
w
j
w
i
+
9
2
·
a
j
i
-
1
·
w
i
w
j
-
2
.To prove this formula, the consistent ratio rate of one sample matrix as shown in (13) is determined. This sample matrix is selected from Xu et al. [6]. According to (5), obviously, matrix A can be verified as a consistent matrix. Contrarily, matrix A is identified as an inconsistent matrix with C
R
=
0.11 when it is determined by (4) and (7). However, if (4) and (18) are used, CR will be 0.05 and therefore will be a consistent matrix as in the result of (5). Therefore, in this research, (18) is used to define the CI value.


## 4. Experimental Results

### 4.1. Parameter Setting

Table3 shows the parameter settings for the proposed and compared methods. The inconsistent matrix can be taken from the real life application which needs the decision maker opinions of comparing several criteria to get some alternatives. Once the matrix is identified as inconsistent, PSOMOF is able to be used to repair the inconsistent matrix. To see the performance of proposed methods in repairing inconsistent matrices, there are 15 inconsistent fuzzy preference matrices which need to be repaired as shown in Table 4. Some matrices come from the other papers, but some matrices are created randomly.Table 3
Parameter settings for the PSOMOF, NSGA-2, and MOPSO.
Parameter
Value
PSOMOF:
W
0.1
C
1
0.2
C
2
0.3
R
1
0.4
R
2
0.5
NSGA-2
Population size
100
Generation
200
Rate crossover
0.9
Rate mutation
0.1
MOPSO
Number of particle
20
Number of cycles
1000Table 4
The dataset inconsistency matrices.
Matrix
Elements of lower triangular matrix
CR
Size4
×
4
A
1
0.9-0.4-0.2-0.3-0.6-0.1a
0.687
A
2
0.8-0.4-0.1-0.1-0.3-0.7
0.364
A
3
0.4-0.6-0.4-0.7-0.4-0.3b
0.183
A
4
0.4-0.3-0.4-0.3-0.1-0.9
0.427
Size5
×
5
A
5
0.4-0.3-0.4-0.7-0.8-0.2-0.4-0.4-0.6-0.2
0.319
A
6
0.1-0.2-0.3-0.9-0.6-0.8-0.7-0.4-0.6-0.3
0.343
A
7
0.7-0.2-0.1-0.3-0.8-0.8-0.7-0.1-0.6-0.4
0.359
A
8
0.1-0.3-0.1-0.8-0.8-0.4-0.6-0.8-0.6-0.7
0.479
Size6
×
6
A
9
0.8-0.2-0.1-0.4-0.8-0.9-0.4-0.2-0.4-0.7-0.9-0.8-0.7-0.4-0.3
0.440
A
10
0.3-0.1-0.8-0.8-0.3-0.7-0.2-0.4-0.4-0.7-0.7-0.6-0.4-0.8-0.1
0.531
A
11
0.2-0.8-0.1-0.7-0.8-0.4-0.4-0.6-0.7-0.6-0.1-0.4-0.6-0.3-0.7
0.437
Size7
×
7
A
12
0.7-0.2-0.4-0.7-0.3-0.6-0.4-0.3-0.9-0.2-0.7-0.4-0.6-0.8-0.8-0.8-0.3-0.9-0.2-0.7-0.9
0.315
A
13
0.7-0.8-0.3-0.4-0.6-0.7-0.2-0.7-0.2-0.3-0.8-0.3-0.3-0.2-0.6-0.4-0.7-0.3-0.2-0.1-0.7
0.353
Size8
×
8
A
14
0.8-0.8-0.8-0.3-0.6-0.8-0.7-0.7-0.4-0.7-0.7-0.9-0.7-0.4-0.4-0.4-0.3-0.3-0.4-0.7-0.2-0.6-0.2-0.2-0.8-0.7-0.2.0.7
0.313
A
15
0.7-0.8-0.7-0.3-0.8-0.6-0.4-0.7-0.2-0.2-0.7-0.3-0.8-0.7-0.3-0.1-0.3-0.1-0.2-0.8-0.8-0.3-0.8-0.1-0.6- 0.2-0.1-0.4
0.457
Data on  a and b is picked from [8, 18].


### 4.2. Generating Nondominated Solutions

As aforementioned, there are two objectives for this proposed method, that is, the best CR and deviation matrix. Both objectives will conflict each other. When the CR is lowest (good consistent ratio), it leads to the highest (the worst) deviation, and vice versa. However, in order to get the acceptable matrix, the CR of modified matrix is limited below 0.1. It makes the solution consist of some relations (“CR-deviation”) which can be identified as nondominated solutions. Equations (19a), (19b), and (19c) display the performance of PSOMOF to get the best CR-σ for A
5, respectively. The origin matrix A
5 (19a) can be transformed to the modified matrices which have the best CR (19b) and σ(19c), respectively:CR = 0.319(19a)
0.5
0.6
0.7
0.3
0.6
0.4
0.5
0.6
0.2
0.6
0.3
0.4
0.5
0.8
0.4
0.7
0.8
0.2
0.5
0.8
0.4
0.4
0.6
0.2
0.5
.
CR = 0.003 andσ = 0.161(19b)
0.5
0.5146
0.5072
0.4923
0.5190
0.4854
0.5
0.5088
0.4504
0.5097
0.4928
0.4912
0.5
0.5177
0.4882
0.5077
0.5496
0.4823
0.5
0.5312
0.4810
0.4903
0.5112
0.4688
0.5
.
CR = 0.099 andσ = 0.073(19c)
0.5
0.5717
0.6188
0.3855
0.6477
0.4283
0.5
0.52
0.26
0.5982
0.3812
0.4473
0.5
0.6630
0.4645
0.6145
0.6554
0.3370
0.5
0.7341
0.3523
0.4018
0.5355
0.2659
0.5
.PSOMOF splits the method into three steps. These are to find the optimal deviation, optimal CR, and the optimal deviation with the particular value of CR. Figure1 shows the process convergence to find the optimal deviation, while Figure 2 shows process convergence to find the optimal CR. Both of them are conducted on A
5.Figure 1
The process convergence to find the optimal deviation onA
5.Figure 2
The process convergence to find the optimal CR onA
5.After obtaining the minimal CR andσ, the third step of the PSOMOF is executed to get the nondominated CR-deviation nodes. By using PSOMOF, for each CR, the optimal deviation can be obtained. This proposed method thus successfully generates some nodes as solutions. Figure 3 shows the Pareto graph which depicts the relation of CR and deviation of matrix. The sample matrices for fuzzy preference matrix are A
1, A
5, A
9, A
12, and A
14. It shows clearly that they will be contradictory to each other. In case of matrices, when σ is minimized, CR is maximized. Likewise, when CR is minimized, σ is maximized.Figure 3
The Pareto graph solutions which show relation CR-σ.


### 4.3. Comparison with Other Methods

To evaluate the performance of PSOMOF, this study uses the metric analysis [21, 22]. The performance is represented by the Pareto graph 10 times. The Pareto graph is then compared with Pareto graphs of two other algorithms, NSGA-2 [23] and MOPSO [24]. The Pareto-optimal set is generated by merging all of the Pareto graphs of all algorithms (PSOMOF, NSGA-2, and MOPSO) into a single Pareto solution. The nondominated solutions for each algorithm are generated by executing each algorithm once on a sample inconsistent matrix (A
1, A
5, A
9, A
12, and A
14). There are 3 metrics to measure the performance of nondominated solutions achieved using the proposed method. Suppose a set of nondominated solutions X
⊆
X.M
1
Metric. This metric measures the average distance of the resulting nondominated set solutions to the Pareto-optimal set solutions. The better value should be a lower M
1. It can be defined as desribed in (20)
M
1
X
′
=
1
X
′
∑
a
′
∈
x
′
min
⁡
a
′
-
a
¯
a
∈
X
¯
.M
2
Metric. This metric measures the number of distribution nondominated solutions which are covered by a neighbourhood parameter d
>
0.03. A bigger M
2 indicates better performance. M
2 can be defined as (21)
M
2
X
′
=
1
X
′
-
1
∑
a
′
∈
x
′
b
′
∈
x
′
;
a
′
-
b
′
a
>
dM
3
Metric. This metric measures the extent of nondominated sets obtained. A wide range of values should be covered by the nondominated solutions. The bigger M
3 is better. M
3 can be defined as(22)
M
3
X
′
=
∑
i
=
1
m
max
⁡
a
i
′
-
b
i
′
;
a
′
,
b
′
∈
X
′
.The comparison results are shown in Table5. It shows that PSOMOF M
1 metric is minimal in all of matrices compared to MOPSO and NSGA-2. These results show that most of the Pareto graphs of PSOMOF are closer to the Pareto-optimal front than both algorithms (NSGA-2 and MOPSO). For M
2 metric, the PSOMOF result is larger than both of the other algorithms except for A
12. This indicates that the solutions of the proposed method are more distributed than both algorithms. In the M
3 metric, the proposed algorithm also outperforms as compared to the NSGA-2 and MOPSO. The proposed method returned nondominated solutions further than both of the other algorithms. Regarding this result, the proposed method, PSOMOF, can be claimed as the better algorithm compared to the two algorithms (NSGA-2 and MOPSO).Table 5
Comparison of the metric performance of NSGA-2, MOPSO, and MOBAF.
Method
A
1
A
5
A
9
A
12
A
14
NSGA-2
M
1
0.000896
0.000913
0.00127
0.00146
0.00133
M
2
24.0
26.2
15.9
20.4
14.1
M
3
1.76
1.50
1.34
1.21
1.11
MOPSO
M
1
0.000830
0.000701
0.00110
0.000930
0.00122
M
2
28.7
27.9
19.6
26.1
17.7
M
3
1.89
1.64
1.60
1.39
1.29
PSOMOF
M
1
0.000728
0.000688
0.000957
0.000926
0.000998
M
2
32.5
27.9
20.6
25.7
19.0
M
3
1.98
1.92
1.65
1.58
1.48


## 4.1. Parameter Setting

Table3 shows the parameter settings for the proposed and compared methods. The inconsistent matrix can be taken from the real life application which needs the decision maker opinions of comparing several criteria to get some alternatives. Once the matrix is identified as inconsistent, PSOMOF is able to be used to repair the inconsistent matrix. To see the performance of proposed methods in repairing inconsistent matrices, there are 15 inconsistent fuzzy preference matrices which need to be repaired as shown in Table 4. Some matrices come from the other papers, but some matrices are created randomly.Table 3
Parameter settings for the PSOMOF, NSGA-2, and MOPSO.
Parameter
Value
PSOMOF:
W
0.1
C
1
0.2
C
2
0.3
R
1
0.4
R
2
0.5
NSGA-2
Population size
100
Generation
200
Rate crossover
0.9
Rate mutation
0.1
MOPSO
Number of particle
20
Number of cycles
1000Table 4
The dataset inconsistency matrices.
Matrix
Elements of lower triangular matrix
CR
Size4
×
4
A
1
0.9-0.4-0.2-0.3-0.6-0.1a
0.687
A
2
0.8-0.4-0.1-0.1-0.3-0.7
0.364
A
3
0.4-0.6-0.4-0.7-0.4-0.3b
0.183
A
4
0.4-0.3-0.4-0.3-0.1-0.9
0.427
Size5
×
5
A
5
0.4-0.3-0.4-0.7-0.8-0.2-0.4-0.4-0.6-0.2
0.319
A
6
0.1-0.2-0.3-0.9-0.6-0.8-0.7-0.4-0.6-0.3
0.343
A
7
0.7-0.2-0.1-0.3-0.8-0.8-0.7-0.1-0.6-0.4
0.359
A
8
0.1-0.3-0.1-0.8-0.8-0.4-0.6-0.8-0.6-0.7
0.479
Size6
×
6
A
9
0.8-0.2-0.1-0.4-0.8-0.9-0.4-0.2-0.4-0.7-0.9-0.8-0.7-0.4-0.3
0.440
A
10
0.3-0.1-0.8-0.8-0.3-0.7-0.2-0.4-0.4-0.7-0.7-0.6-0.4-0.8-0.1
0.531
A
11
0.2-0.8-0.1-0.7-0.8-0.4-0.4-0.6-0.7-0.6-0.1-0.4-0.6-0.3-0.7
0.437
Size7
×
7
A
12
0.7-0.2-0.4-0.7-0.3-0.6-0.4-0.3-0.9-0.2-0.7-0.4-0.6-0.8-0.8-0.8-0.3-0.9-0.2-0.7-0.9
0.315
A
13
0.7-0.8-0.3-0.4-0.6-0.7-0.2-0.7-0.2-0.3-0.8-0.3-0.3-0.2-0.6-0.4-0.7-0.3-0.2-0.1-0.7
0.353
Size8
×
8
A
14
0.8-0.8-0.8-0.3-0.6-0.8-0.7-0.7-0.4-0.7-0.7-0.9-0.7-0.4-0.4-0.4-0.3-0.3-0.4-0.7-0.2-0.6-0.2-0.2-0.8-0.7-0.2.0.7
0.313
A
15
0.7-0.8-0.7-0.3-0.8-0.6-0.4-0.7-0.2-0.2-0.7-0.3-0.8-0.7-0.3-0.1-0.3-0.1-0.2-0.8-0.8-0.3-0.8-0.1-0.6- 0.2-0.1-0.4
0.457
Data on  a and b is picked from [8, 18].


## 4.2. Generating Nondominated Solutions

As aforementioned, there are two objectives for this proposed method, that is, the best CR and deviation matrix. Both objectives will conflict each other. When the CR is lowest (good consistent ratio), it leads to the highest (the worst) deviation, and vice versa. However, in order to get the acceptable matrix, the CR of modified matrix is limited below 0.1. It makes the solution consist of some relations (“CR-deviation”) which can be identified as nondominated solutions. Equations (19a), (19b), and (19c) display the performance of PSOMOF to get the best CR-σ for A
5, respectively. The origin matrix A
5 (19a) can be transformed to the modified matrices which have the best CR (19b) and σ(19c), respectively:CR = 0.319(19a)
0.5
0.6
0.7
0.3
0.6
0.4
0.5
0.6
0.2
0.6
0.3
0.4
0.5
0.8
0.4
0.7
0.8
0.2
0.5
0.8
0.4
0.4
0.6
0.2
0.5
.
CR = 0.003 andσ = 0.161(19b)
0.5
0.5146
0.5072
0.4923
0.5190
0.4854
0.5
0.5088
0.4504
0.5097
0.4928
0.4912
0.5
0.5177
0.4882
0.5077
0.5496
0.4823
0.5
0.5312
0.4810
0.4903
0.5112
0.4688
0.5
.
CR = 0.099 andσ = 0.073(19c)
0.5
0.5717
0.6188
0.3855
0.6477
0.4283
0.5
0.52
0.26
0.5982
0.3812
0.4473
0.5
0.6630
0.4645
0.6145
0.6554
0.3370
0.5
0.7341
0.3523
0.4018
0.5355
0.2659
0.5
.PSOMOF splits the method into three steps. These are to find the optimal deviation, optimal CR, and the optimal deviation with the particular value of CR. Figure1 shows the process convergence to find the optimal deviation, while Figure 2 shows process convergence to find the optimal CR. Both of them are conducted on A
5.Figure 1
The process convergence to find the optimal deviation onA
5.Figure 2
The process convergence to find the optimal CR onA
5.After obtaining the minimal CR andσ, the third step of the PSOMOF is executed to get the nondominated CR-deviation nodes. By using PSOMOF, for each CR, the optimal deviation can be obtained. This proposed method thus successfully generates some nodes as solutions. Figure 3 shows the Pareto graph which depicts the relation of CR and deviation of matrix. The sample matrices for fuzzy preference matrix are A
1, A
5, A
9, A
12, and A
14. It shows clearly that they will be contradictory to each other. In case of matrices, when σ is minimized, CR is maximized. Likewise, when CR is minimized, σ is maximized.Figure 3
The Pareto graph solutions which show relation CR-σ.


## 4.3. Comparison with Other Methods

To evaluate the performance of PSOMOF, this study uses the metric analysis [21, 22]. The performance is represented by the Pareto graph 10 times. The Pareto graph is then compared with Pareto graphs of two other algorithms, NSGA-2 [23] and MOPSO [24]. The Pareto-optimal set is generated by merging all of the Pareto graphs of all algorithms (PSOMOF, NSGA-2, and MOPSO) into a single Pareto solution. The nondominated solutions for each algorithm are generated by executing each algorithm once on a sample inconsistent matrix (A
1, A
5, A
9, A
12, and A
14). There are 3 metrics to measure the performance of nondominated solutions achieved using the proposed method. Suppose a set of nondominated solutions X
⊆
X.M
1
Metric. This metric measures the average distance of the resulting nondominated set solutions to the Pareto-optimal set solutions. The better value should be a lower M
1. It can be defined as desribed in (20)
M
1
X
′
=
1
X
′
∑
a
′
∈
x
′
min
⁡
a
′
-
a
¯
a
∈
X
¯
.M
2
Metric. This metric measures the number of distribution nondominated solutions which are covered by a neighbourhood parameter d
>
0.03. A bigger M
2 indicates better performance. M
2 can be defined as (21)
M
2
X
′
=
1
X
′
-
1
∑
a
′
∈
x
′
b
′
∈
x
′
;
a
′
-
b
′
a
>
dM
3
Metric. This metric measures the extent of nondominated sets obtained. A wide range of values should be covered by the nondominated solutions. The bigger M
3 is better. M
3 can be defined as(22)
M
3
X
′
=
∑
i
=
1
m
max
⁡
a
i
′
-
b
i
′
;
a
′
,
b
′
∈
X
′
.The comparison results are shown in Table5. It shows that PSOMOF M
1 metric is minimal in all of matrices compared to MOPSO and NSGA-2. These results show that most of the Pareto graphs of PSOMOF are closer to the Pareto-optimal front than both algorithms (NSGA-2 and MOPSO). For M
2 metric, the PSOMOF result is larger than both of the other algorithms except for A
12. This indicates that the solutions of the proposed method are more distributed than both algorithms. In the M
3 metric, the proposed algorithm also outperforms as compared to the NSGA-2 and MOPSO. The proposed method returned nondominated solutions further than both of the other algorithms. Regarding this result, the proposed method, PSOMOF, can be claimed as the better algorithm compared to the two algorithms (NSGA-2 and MOPSO).Table 5
Comparison of the metric performance of NSGA-2, MOPSO, and MOBAF.
Method
A
1
A
5
A
9
A
12
A
14
NSGA-2
M
1
0.000896
0.000913
0.00127
0.00146
0.00133
M
2
24.0
26.2
15.9
20.4
14.1
M
3
1.76
1.50
1.34
1.21
1.11
MOPSO
M
1
0.000830
0.000701
0.00110
0.000930
0.00122
M
2
28.7
27.9
19.6
26.1
17.7
M
3
1.89
1.64
1.60
1.39
1.29
PSOMOF
M
1
0.000728
0.000688
0.000957
0.000926
0.000998
M
2
32.5
27.9
20.6
25.7
19.0
M
3
1.98
1.92
1.65
1.58
1.48


## 5. Conclusions

This paper presents a study to use the multiobjective PSO to solve the inconsistent fuzzy preference matrix in AHP, called PSOMOF. There are two objectives (consistent ratio and deviation matrix) considered in rectifying the matrix in order to be consistent. However, they are conflicting in that process. Therefore, the proposed algorithms offer some nondominated solutions which also satisfied the acceptable consistent matrices. The process in PSOMOF is split into three parts in which each part applies the PSO process. To see the performance, 15 inconsistent comparison matrices are repaired by the proposed methods. Besides repairing inconsistent comparison matrices, the proposed method also can generated some nondominated solution which can be classified as optimal solutions. This result shows the PSO algorithm is the potential approach to solve the inconsistent comparison matrix in AHP. The other intelligent algorithm also might be used to solve this problem. Further, this proposed method might be a potential method to combine with other method metaheuristic (hybrid)n to improve the quality of results.



---

*Source: 467274-2015-10-27.xml*