# A Decomposition-Based Unified Evolutionary Algorithm for Many-Objective Problems Using Particle Swarm Optimization

Authors: Anqi Pan; Hongjun Tian; Lei Wang; Qidi Wu
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

Evolutionary algorithms have proved to be efficient approaches in pursuing optimum solutions of multiobjective optimization problems with the number of objectives equal to or less than three. However, the searching performance degenerates in high-dimensional objective optimizations. In this paper we propose an algorithm for many-objective optimization with particle swarm optimization as the underlying metaheuristic technique. In the proposed algorithm, the objectives are decomposed and reconstructed using discrete decoupling strategy, and the subgroup procedures are integrated into unified coevolution strategy. The proposed algorithm consists of inner and outer evolutionary processes, together with adaptive factorμ, to maintain convergence and diversity. At the same time, a designed repository reconstruction strategy and improved leader selection techniques of MOPSO are introduced. The comparative experimental results prove that the proposed UMOPSO-D outperforms the other six algorithms, including four common used algorithms and two newly proposed algorithms based on decomposition, especially in high-dimensional targets.


---

## Body

## 1. Introduction

Many-objective optimization problems (MaOPs) refer to the optimizations which consisted of a larger number of objectives. Generally, when the number of objectives in the multiobjective optimization problems (MOPs) reaches four, the problems are classified as MaOPs.To MOPs, there exist many evolutionary algorithms which can be successfully applied in the optimization problem with two or three objectives. The commonly used evolutionary algorithms such as NSGA-II, SPEA2, MOPSO, and their improved or integrating methods are devoted to finding the solutions with uniform distribution to the Pareto front (PF) and maintaining the group diversity during the evolution as well [1–4]. However, none of these classical methods meet high level when facing the many-objective problems, because the process of Pareto dominance makes the individuals nondominated with each other at early generations [5]. The confusion of selection pressure appears between the increasing of objectives and the strategy of Pareto dominance. The computational complexity rises to execute searching in high-dimensional space results in long-time search procedure, poor convergence, and incomplete solution set.Generally, approaches for evolutionary many-objective optimization (EMO) operate on three directions in order to face the high dimension challenges. The first one is discovering more efficient dominance relationship based on multicriteria decision-making, such as narrowing the search area by inputting a user-specified reference point [6] or modifying the selection pressure by softening the standard of dominance. The loose dominance strategy in the first attempt has a wide range of applications, such as k-dominance [7], which has the advantage of reducing the computational complexity, and then the improved algorithm KS-MODE [8] solved the circle dominance in k-dominance by proposing a novel energy function. Other methods focus on dominance criteria, such as the dynamic nondominance method [9], dominance area control [10], e-dominated method [11], indicator-based method [12], deductive sort [13], and corner sort [14], which have made further additions to the development in this direction.The second or the most recently discussed strategy to MaOPs is the decomposition-based method. One common way of decomposition is generating subproblems mapped on several scalars and transforming the multiple objectives into single objective with directional vector. As the fundamental algorithm, MOEA/D [15], proposed by Zhang and Li, provided a simple efficient decomposition way using weight vector approach. More recently, there have been several modifications to the standard MOEA/D which can improve its performance. MOEA/DD [16] combines the dominance-based approach and decomposition and makes improvements in weight vectors, niche strategy, and hybrid rule. In MOEA/D-UDM [17], and a uniform decomposition measurement was introduced to obtain uniform weight vectors, and a modified Tchebycheff decomposition approach was proposed to alleviate the inconsistency between the weight vector and the optimal direction. Reference [18] proposed a uniform evolutionary algorithm based on space decomposition and the control of dominance area of solutions. Another popular way of decomposition is dividing objectives into several subgroups and then executing a coevolutionary method to combine all the elite individuals. Choosing several objectives may adopt a local search technique to move solutions closer to the truth Pareto front and generate a better distribution on the approximate front. Following this idea, Gong et al. obtained subgroups using Spearman and generated a constructed objective by aggregating all the other objectives in every group [19]. Bandyopadhyay selected conflicting objectives for further processing [5]. Reference [20] proposed entropy-based objective reduction technique to find the most conflicting objectives.The other well-known modification takes effort to keep the elite individuals by improving the diversity management mechanism and the congestion strategy. The elite preservation also can be found in popular evolutionary algorithms such as NSGA-II and SPEA2. In this direction Chen et al. have developed the idea of congestion control by relative positions and increase the evolutionary rate in sparse regions [21]. Reference [22] divided the repository into two parts, convergence archive and diversity archive, and focused on the two goals separately. Reference [16] introduced the procedure to find the worst solution which belongs to the worst nondominance level. Reference [23] compared migration models for multiobjective optimization.Particle swarm optimization (PSO) is a well-known metaheuristical optimization technique inspired by the social behavior of birds while looking for food. Its advantages of fast convergence and high diversity are fully demonstrated in MOPs. MOPSO proposed by Coello et al. is the most popular PSO-based MOP method, which introduced a secondary repository of particles to guide the individuals, while using adaptive hypercubes in archive maintenance. Based on this, Tripathi et al. introduced the adaptive weight and acceleration parameters to improve the efficiency [24], Hu et al. proposed a parallel cell coordinate system to assess the environment and dynamically adjust the evolutionary [25], and Peng and Zhang combined MOEA/D with the MOPSO using the thought of decomposition [26]. Through the many attempts to improve MOPSO, it still suffers from premature convergence and uncertain learning pace.In this paper, a novel strategy, named decomposition-based unified evolutionary algorithm using particle swarm optimization (UMOPSO-D), is proposed for the many-objective problems. UMOPSO-D optimizes the many objectives through decomposition and coevolution. Benefiting from the objective decomposition, the MaOP transforms to several MOP subproblems with three or less objectives, in which PSO method takes advantages (proved in Section4). The coevolution between subproblems operates through uniform PSO framework, and the learning strategies constitute a double loop system; the inner learning system focuses mainly on convergence, while the outer system emphasizes diversity. The strategies for decoupling, personal and archive best selection, repository maintaining, recombination strategy, and coevolution method are designed to support this algorithm. Furthermore, two decoupling methods, relevant decoupling and conflict decoupling, are introduced in the decomposition, and the comparison between their contributions is organized. Compared with existing decomposition approaches, the main contributions of this work are summarized as follows:(1)
A novel framework for MaOP algorithm is proposed, integrated with the idea of unified PSO. An adaptive unification factor is designed to dynamically balance the convergence and diversity according to the incremental entropy which stands for swarm stability. The entropy is calculated through hypercube strategy.
(2)
Two grouping strategies, relevant coupling and conflict coupling, are introduced and compared. The simulation results illustrate the different advantages of the two techniques.
(3)
The objective decomposition presents problems in population regroup and repository management. In UMOPSO-D, the population regroup is based on the leading objectives which are assigned for each particle. The repository management strategy includes two aspects, which are applied to local and global parts, respectively.
(4)
As a PSO-based algorithm, the best selection is essential. In this paper, different strategies are assigned for personal best, local best, and global best, respectively.The remainder of this paper is organized as follows. Section2 lists several definitions of the mentioned terms in MaOP, followed by the descriptions of related techniques and backgrounds in Section 3. Then the structures and formulations of standard PSO and unified PSO are described in Section 4. The proposed algorithm is detailed in Section 5. The comparative simulations and experimental results among seven MOEA algorithms are provided in Section 6. Finally, the conclusions are in Section 7.


## 2. Definitions

Many-Objective Optimization Problems, MaOPs. Many-objective optimization problem originates from multiobjective optimization problems (MOPs), in which the number of objectives is larger than three. Like the MOPs, the MaOPs containing objective functions and decision variables can be described as the following expression. Since the objectives are restricted or conflicting with each other, there is no feasible way to combine any objectives.(1)
min
⁡
F
X
=
F
1
X
,
F
2
X
,
…
,
F
m
X
subject to
X
∈
Ω
.Here Ω
=
∏
i
=
1
n
‍
[
a
i
,
b
i
]
⊆
R
n is the decision space, X
=
(
x
1
,
x
2
,
…
,
x
n
)
T
∈
Ω is the candidate solution, and F
∈
R
m is the objective space, which constitutes m objective functions.Dominance. We assume a vector u
=
(
u
1
,
u
2
,
…
,
u
n
)
T dominates v
=
(
v
1
,
v
2
,
…
,
v
n
)
T (denoted as u
⪯
v) if and only if element in u is partially less than v; that is, ∀
i
∈
{
1,2
,
…
,
k
}, u
i
≤
v
i and ∃
i
∈
{
1,2
,
…
,
k
}, u
i
<
v
i. Similarly, in many-objective optimization problem, the dominance relationship X
⪯
X
′ exists if and only if, ∀
i
∈
{
1,2
,
…
,
k
}, F
i
(
X
)
≤
F
i
(
X
′
) and ∃
i
∈
{
1,2
,
…
,
k
}, F
i
(
X
)
<
F
i
(
X
′
).Incomparable. Neither u dominates v nor v dominates u, denoted as u
∥
v.Pareto-Optimal Set. Pareto-optimal set is defined as P
∗
=
{
X
∈
Ω
∣
¬
∃
X
′
∈
Ω
,
X
′
⪯
X
}.Pareto Front, PF. The set of all Pareto-optimal objectives is called the Pareto front; P
F
=
{
F
(
X
)
∈
R
m
∣
X
∈
P
∗
}.


## 3. Related Backgrounds

To the best of our knowledge, decomposition-based methods can be divided into two levels. The first level is named scalar-based decomposition, which changes the research space through several scalars and gets close to the optimizations in scalar space. The second level is dividing the objectives into subsets following specified criterion and changing a many-objective problem to a bunch of multiobjective problems, named objective-based decomposition. The main challenges in both levels lie in the grouping criterion and coevolution strategy. In this section, we briefly review the current methods toward the two challenges and other techniques of MOP in state-of-the-art literatures as the background of this paper.Grouping Criterion. In scalar-based decomposition, Liu randomly selected K unit vectors to divide space into K subregions, while Li defined each weight vector as a unique subregion in the scalar space.In objective-based decomposition, Gong et al. decomposed the original objectives into several subgroups and added an aggregating function in each group [19], which presents a smart way to communicate between subgroups, but the aggregating functions bring additional objectives and complexity. The grouping criterion in Gong et al.’s paper is that objectives, which have high relativity, are selected into one group. On the contrary, Bandyopadhyay and Mukherjee selected a subset of conflicting objectives and recomputed the subset at each iteration; in the ending of every iteration, all the objectives are recombined and the differential evolution was executed [5]. The methods mentioned above use Pearson’s correlation coefficient and Spearman’s rank correlation coefficient, respectively, as the selecting criterion to evaluate the confliction and relevance, which is the key to generate subgroups.Coevolution. Relatively many researchers have explored the idea of combining coevolution with MOEAs, by dividing subgroups, adding local searching processes, and other methods. Considering the MaOPs involved many conflicting objectives, the entirety group or the so-called global searching causes high computational complexity and large number of nondominated candidates. As a result, the coevolution can provide good performance in many objectives. The specific cooperative process among subparts varies in different strategies during MOEAs and can be executed in every generation or after certain assessments. The coevolution between the subparts has many different approaches, such as cooperative, competitive, and distributed approaches, which are fully described in [27]; moreover, the coevolution processes are executed in parameters, elitist recombination, algorithm selection, and so on.Archive Management. In multiobjective algorithms, the archive strategies play the important roles, which filter those lower quality solutions to release space for the higher quality nondominated solutions. Though there exist several papers proposing the idea of unconstrained archive size [28], with the increasing number of objectives, the individuals become nondominated with each other at earlier generations, giving birth to a huge volume of data probably beyond the scope of physical implementation.Density is the most commonly used quality for archive management. It can be based on several criteria, such as the following: Kernel approach, based on the sum of values from a distance function either in genotypic or in phenotypic space [29]; nearest neighbor approach, defined by the hyperrectangle values of the individuals’ nearest neighbors [1, 2]; and histogram approach, based on the number of solutions that lied in the same hypercubes [30].Clustering mechanism is another proposal for maintaining an archive. When the population in archive reaches the constraint size, a clustering operation distributes the external nondominated solutions into several subsets and chooses a representative from each subset.


## 4. Unified Many-Objective Particle Swarm Optimization

Particle swarm optimization (PSO) is an evolutionary computation technique which originated from the study of the bird predatory behaviors; similar to genetic algorithm, PSO is also approaching the optimal value of the solution space through constant learning and iteration. Each solution is seen as the ideal particle which has no quality or volume, updating their velocity and position in each iteration, approaching the optimal solution of fitness function gradually. If ind dimensional search space, the velocity and position of particle i are X
i
=
(
x
i
1
,
x
i
2
,
…
,
x
i
d
) and V
i
=
(
v
i
1
,
v
i
2
,
…
,
v
i
d
), in each iteration, record particle i’s best position that it has ever been(
p
B
e
s
t
) and the global optimum position all particles have ever been(
g
B
e
s
t
). Based on the following equations update the particles velocity and position. Inertia weight ω and acceleration coefficients c
1 and c
2 should be defined during the computation.(2)
v
i
k
+
1
=
ω
v
i
k
+
c
1
r
1
p
B
e
s
t
i
-
x
i
k
+
c
2
r
2
g
B
e
s
t
-
x
i
k
,
x
i
k
+
1
=
x
i
k
+
v
i
k
+
1
.The basic PSO, defined as the global scheme, has advantages of convenient information exchange and fast convergence speed. And algorithms such as [31, 32] are making attempts to overcome the PSO’s premature convergence and improve the diversity.However, these positive features usually bring a rapid decline of diversity and make the algorithm greedy, leading to premature convergence in complicated algorithms such as MOPSO. As the number of objectives increases, the deterioration becomes more serious, and the particles were confused in following the best leader and result in frequent fluctuation. Moreover, given the archive maintaining based on crowding distance, with an excess of nondominated solutions, some excellent solutions may be deleted and set back the evolutions. The convergence and diversity metric curves of MOPSO evolution with 3, 4, and 5 objectives are calculated in Figure1, which prove that the performance decreases when the number of objectives exceeds 3 (the metrics are detailed in Section 6). As expected, many improved MOPSOs made efforts in diversity maintaining through flexible mechanism, adaptive parameters, and so on. Another scheme, named neighborhood topology, divided the particles into several subsets for the searching of local optima and increasing of diversity. This scheme gives the PSO a wider and elaborate searching ability. Combining the global and neighborhood scheme, the unified particle swarm optimization is generated.Figure 1
Convergence and diversity metric curves in MOPSO evolutions.Unified particle swarm optimization (UPSO) was proposed as a scheme that harnesses the global and local PSO variants, combining their exploration and exploitation properties [33]. Let G
i be the velocity update of x
i for global PSO variant and L
i for local PSO variant. g
B
e
s
t
i is the global best, while l
B
e
s
t
i is the local best within the local subset of ith particles.(3)
G
i
k
+
1
=
ω
v
i
k
+
c
1
r
1
p
B
e
s
t
i
-
x
i
k
+
c
2
r
2
g
B
e
s
t
i
-
x
i
k
,
L
i
k
+
1
=
ω
v
i
k
+
c
1
r
1
′
p
B
e
s
t
i
-
x
i
k
+
c
2
r
2
′
l
B
e
s
t
i
-
x
i
k
.The parameter μ is called the unification factor to balance the global and local searching directions. According to the UPSO scheme, the aggregation criterion is(4)
U
i
k
+
1
=
μ
G
i
k
+
1
-
μ
L
i
k
,
μ
∈
0,1
,
X
i
k
+
1
=
X
i
k
+
U
i
k
.


## 5. Proposed Approach

The proposed algorithm is based on the idea of coevolution through the concept of unified particle swarm optimization.


### 5.1. Decomposition of MaOPs

In light of the deterioration of MOPSO when the number of objectives rises, in the proposed technique, the many-objective optimization problems described in Section2 are decomposed into several subgroups which have objectives less than or equal to three. As the program is running, the composition of subgroups was recomputed to make sure of the balance of whole objectives.Dimensionality reduction technique always combines objectives based on correlation and coupling. As the strengthened nondominance pressure applying on subgroups, the Pareto-optimal set increases quickly and holds some extreme directions, which make sure of the searching area at the early iteration. Yet, in most MaOPs, the connections between the many objectives can not be defined clearly, so that farfetched decomposition and recombination may cause the incomplete description of the origin. We introduce the correlation-based decoupling for the many-objective optimization. As coupling degree is related to the correlation degree, correlation-based decoupling techniques can be divided into relevant decoupling and conflict decoupling. On the one hand, in relevant decoupling, the relevant objectives have similar trends of increasing and decreasing; as a result, the optimal solutions gather together, which provide advantage for the particles to search in a smaller neighborhood. On the other hand, in conflict decoupling, the conflict objective space holds a larger number of nondominated solutions, which can guarantee the searching diversity in low-dimensional spaces. In this paper, both of the correlation-based decoupling methods are considered in the simulations. According to the comparison result in Section6, the conflict decoupling holds a better performance in UMOPSO-D algorithm.There are several correlation coefficient measurements; the most common ones of these are Pearson’s correlation coefficient and Spearman’s rank correlation. Pearson’s correlation coefficient is sensitive to a linear relationship between two variables and has demand to the variance ranges, so it is not appropriate for the MaOPs’ decomposition. In comparison, rank correlation is a nonparametric measure of statistical dependence between two variables, makes the coefficient less sensitive to nonnormality in distributions, and gives good descriptions of consistency and tendency. Spearman’s rank correlation coefficient between objective functionsF
i and F
j at iteration k is defined as R
i
j
(
k
), R
i
j
(
k
)
∈
[
-
1,1
]; the closer the coefficient is to either 1 or -
1, the stronger the correlation or anticorrelation between the objectives is. To avoid extra computation or memory space on correlation calculation, we use the solution fitnesses found by particles during iterations as the sample points.Using this technique, the coupling degrees change corresponding with particles fitnesses; in other words, the coupling relations depend on the particles’ evolution procedure. To update the evolutionary process and express the nonlinear objectives, the decoupling operates before every decomposition procedure.To balance the computational loads between subgroups, the formulation between the number of subgroupsn
S
u
b and the number of objectives n
O
b
j is n
O
b
j
=
⌊
n
O
b
j
/
3
⌋, which is initialized at the beginning of main algorithm. The size of population is n
P
o
p, the maximum of global repository is n
R
e
p, and maximal size of subgroup repositories is ⌊
n
P
o
p
/
n
S
u
b
⌋. The objectives decompositions are carried out during several UPSO iterations. The procedure of decomposition is shown in Algorithm 1.Algorithm 1:Decomposition algorithm.
Input: Objectives F
m, m
=
1,2
,
…
,
n
O
b
j
Output: Objective subsets,
(1)while
1
do
(2)if
n
O
b
j
-
3
×
n
S
u
b
≤
3
then
(3)   Put the last objectives into one subgroup
(4)n
S
u
b
=
n
S
u
b
+
1
(5)   Exit the while loop
(6)end if
(7)  Calculate the rank correlationR
1
j between F
1 and all the other
objectivesF
j under P
O
P’s fitnesses
(8)  Select the largest (or smallest, relevant decoupling and conflict
decoupling relatively) twoR
1
j, (
j
=
j
1
,
j
2
)
(9)  PutF
i, F
j
1, F
j
2 into one subgroup
(10)  Rearrange the rest objectives
(11)end while


### 5.2. Local Best and Global Best Selection

In the updating formulation of PSO, the global bestg
B
e
s
t is defined as the best position that particles in population have ever been. Yet, in a multiobjective problem, the best position is not unique, and any solution that has nondominated quality or the front sort rank can be viewed as a g
B
e
s
t. g
B
e
s
t works as the leader in the MOPSO searching process, so global best selection is a key task which can determine the direction of the particles, the convergence speed, and the diversity. There are several popular methods of global best selection in the state-of-the-art MOPSOs, such as crowing distance technique, region-based strategy using adaptive hypercubes, and nondominated sorting technique. As iteration goes on, some particles gather together around several high expected optimal areas, making these areas more developed. The regularity we found was that the more developed the area is where the g
B
e
s
t is selected, the higher the selection pressure is exerted on the particles, which leads to a fast convergence but a poor diversity; on the contrary, the less developed the area is where the g
B
e
s
t is selected, the more flexible the moving directions are which promise a rich diversity but slow convergence speed.In the UPSO, both the subgroup local bestl
B
e
s
t
i and global best g
B
e
s
t
i influence the directions of particle i. The subgroups and whole-set constitute a double loop system, in which we can apply two suites of selection strategies. The subgroup plays a role as the inner loop which needs to make sure of the convergence and speed, so we promote the closest distance method to select l
B
e
s
t
i; the whole-set function plays as the outer loop to maintain the population diversity and avoid premature phenomenon, so we promote the hypergroup method to select g
B
e
s
t
i. In this way, the particles in the subgroup search around the optimal areas, try directions pointed to other groups constantly, and prepare for the next subgroups rearrangement. The proposed g
B
e
s
t selection algorithms are detailed in the following paragraph.Closest Distance Method. In this method, calculate the distances between the given particle and positions in the subgroup repository s
R
e
p
i which collects those nondominated solutions in subgroup i, and then select the closest solution as the l
B
e
s
t
i for the given particle.Hypergroup Method. Hypergroup represents that g
B
e
s
t
i is in a different group from the given particle i. g
B
e
s
t
i is selected from the global repository g
R
e
p, which stores the refined elite solutions from subgroup repositories. Each solution in g
R
e
p is labeled by the group index which indicates where it comes from. g
R
e
p is managed by a group of reference vectors which is detailed in Section 5.4. Based on the distances between the particle and the reference vectors in objective space, the closest vector is determined, and the solution associated with this vector is selected as g
B
e
s
t
i. Under the situation that the vector has no associate solution or the associate solution has the same group index with particle i, the global best selection moves on to the next closest vector.


### 5.3. Personal Best Selection

The personal best is defined as the best position that the particle has ever been during the searching process, which raises challenge in MOPs, andith particle’s fitness F
i and p
B
e
s
t
i are incomparable. As a result, the personal best cannot be updated directly. Reference [3] used the random way to select one best memory as the value of p
B
e
s
t; [34] built the personal archive p
R
e
p and proposed the largest minimal distance for the decision. In this paper, a new method is presented named objective balance strategy, Algorithm 2, which defines p
B
e
s
t from repository p
R
e
p. The calculation of the leading objective indexes is detailed in Section 5.4.Algorithm 2:Personal best selection.
Input: The ith particle P
i; the repository for P
i, p
R
e
p
i;
the current operating groupS
u
b
g
r
o
u
p
j.
Output: p
B
e
s
t
i
(1) Update personal repositoryp
R
e
p
i.
(2) Select the memories inp
R
e
p
i whose leading index
belong to theS
u
b
g
r
o
u
p
j as the personal
best candidates. The number of the candidates isN.
(3)if
N
=
=
0
thenSelect p
B
e
s
t
i randomly
fromp
R
e
p
i.
(4)elseSelect p
B
e
s
t
i whose index is a minority
inp
R
e
p
i from candidates.
(5)end if


### 5.4. Repositories Strategy

The high dimension objectives lead to large area ofP
F, which means there are a great many nondominated positions found during early iterations, and the repository soon reaches saturation. In the UMOPSO-D proposal, each subgroup with three or less objectives has archive(
s
R
e
p
). Because the selecting pressure is relatively large insRep, we employ dominated rank as the assessment strategy of each solution. When the repository reaches the limit, solutions with poor rank values are abandoned.The maintenance of global repository(
g
R
e
p
) plays an important role in MOP algorithms, for the reason that it will provide leader information and balance the convergence and diversity. When the iteration terminates, g
R
e
p outputs the optimal solutions. g
R
e
p consisted of solutions from all subgroup repositories. In this paper, we use a set of reference vectors to work as a diversity standard, which is inspired from Das and Dennis’s systematic approach [35]. Each solution in g
R
e
p finds its associated vector according to the closest distance. When the number of solutions in g
R
e
p exceeds the upper boundary, the vector which associates the most solutions is selected, and one of the corresponding associates will be deleted. The above procedure repeats until the number of members in g
R
e
p is equal to upper boundary. The method above is called crowding reference.The algorithm regroups the objectives and population after several iterations according to the stability. After regrouping, the repositories of new subgroup become empty again. We propose the repositories recompose strategy that assigns each solution ins
R
e
p the objective it belongs to. Combine all s
R
e
p’s and we have the global repository g
R
e
p, then, to every solution, calculate each cost dimension’s value sorting from small to big in all the elements of g
R
e
p, and choose the one top rank to be the leading objective. If more than one dimension share the top place, randomly choose one as the leading objective. When the regrouping begins, the solutions in s
R
e
p follow the leading objective whose best performance points into the new subgroups repository.Take a simple example; the distribute hypercube indexes and the leading objective indexes of the known Pareto front ofD
T
L
Z
1 from decomposed procedure in the 20th generation are listed in Table 1, where parameters are n
O
b
j
=
6, G
=
6, the number of solutions in s
R
e
p is n
s
R
e
p
=
10, and the grouping states is {
f
1
,
f
2
,
f
3
} and {
f
4
,
f
5
,
f
6
}. Assume, in the next decomposition, objectives {
f
1
,
f
4
,
f
5
} go to subgroup S
u
b
1 and objectives {
f
2
,
f
3
,
f
6
} go to subgroup S
u
b
2. According to the leading objective indexes, the solution with bold font in Table 1 goes to subgroup repository s
R
e
p
1, and the rest go to s
R
e
p
2.Table 1
Solutions’ leading objectives, hypercube indexes, and potential indexes.
Solutions
Objective values
Leading
Hypercube indexes
PHS
f
1
f
2
f
3
f
4
f
5
f
6
Index
f
1
f
2
f
3
f
4
f
5
f
6
F
s
1
F
s
2
S
1
0.0337
0.8423
0.8137
2.4917
5.0242
6.2828
1
1
2
2
2
3
4
5
9
S
2
2.1548
2.4148
2.5226
3.4226
4.8307
2.1662
6
6
6
6
2
3
1
18
6
S
3
0.6900
0.3672
1.0327
13.2334
5.1143
4.9227
2
2
1
2
6
3
3
5
12
S
4
0.0192
0.7002
0.6645
6.4037
6.8943
7.5655
1
0
2
1
3
4
6
3
13
S
5
1.8129
1.6961
2.2429
3.3351
0.4922
2.8506
5
5
4
6
2
0
1
15
3
S
6
1.0025
2.2427
2.1827
0.2809
0.5690
3.1957
4
3
6
6
0
1
2
15
3
S
7
0.4121
0.2187
0.6295
7.8051
7.2729
3.5382
2
2
0
1
4
5
2
3
11
S
8
2.1019
1.3218
1.3989
1.8994
5.8646
1.7325
6
6
3
3
1
4
0
12
5
S
9
2.1742
2.5953
2.0775
3.4450
1.6556
2.4780
5
6
6
5
2
1
1
17
4
S
10
0.0193
0.3953
0.3435
6.1977
10.3869
8.6391
3
1
1
0
3
6
6
2
15


### 5.5. Unified Coevolutionary Strategy

In order to have the visual representation of the solutions’ routes and express the feasible detailed designs in the coevolution process, we proposed a novel hypercube technique. For the proposed algorithm itself, this novel hypercube technique helps to assess the convergence of subgroups, balance the learning directions of particles, and set rules for parameters.The hypercubes are used to grid the solutions in subgroup archives, which are adaptive, similarly to [3, 25]. The number of grids G is provided in the initialization of the algorithm. According to (5), the lth elite solution is assigned into a grid with integral labels. Then, P
o
t
e
n
t
i
a
l is calculated for each solution.(5)
S
l
.
C
o
s
t
=
f
1
,
l
,
f
2
,
l
,
…
,
f
m
,
l
,
…
,
f
n
O
b
j
,
l
T
,
g
m
,
l
=
c
e
i
l
G
f
m
,
l
-
f
m
m
i
n
f
m
m
a
x
-
f
m
m
i
n
,
S
l
.
G
r
i
d
I
n
d
e
x
=
g
1
,
l
,
g
2
,
l
,
…
,
g
m
,
l
T
,
p
i
,
l
=
∑
j
S
l
.
G
r
i
d
I
n
d
e
x
j
,
f
j
∈
S
u
b
i
,
S
l
.
P
o
t
e
n
t
i
a
l
=
p
1
,
l
,
p
2
,
l
,
…
,
p
n
S
u
b
,
l
T
.In a previous paper [36], the entropy was used to measure the diversity of the population; in [25], Δ
E
n
t
r
o
p
y was proposed to classify the population of exploitation and exploration, which can be referred to as the stability of the population. Similarly, we use the entropy method to assess the stability of the subgroup through Δ
E
n
t
r
o
p
y of subgroup archive. For the reason that the MaOPs with decomposition technique need large amount of calculation in parallel cell coordinate system, improvement has been made based on this basis. We use the values of P
o
t
e
n
t
i
a
l instead of G
r
i
d
I
n
d
e
x to represent a solution and change the entropy computation space fromG (row) ×nObj (column) to 3G (row) ×nSub (column), named potential hyperspace (PHS). As an example, the calculations of PHS are listed in Table 1. In every iteration, the records of S
.
P
o
t
e
n
t
i
a
l falling in the PHSs form an information entropy which can reflect the uniformity of the subgroup. The entropy is defined according to (6), where C
e
l
l
g
,
m is the number of archives which are located in grid g, m. While E
n
t
r
o
p
y assesses the convergence of the subgroup, Δ
E
n
t
r
o
p
y represents the variation range of convergence, that is, the stability.(6)
E
n
t
r
o
p
y
i
k
=
-
∑
g
=
1
3
G
∑
m
=
1
n
S
u
b
C
e
l
l
g
,
m
k
n
s
R
e
p
i
log
⁡
C
e
l
l
g
,
m
k
n
s
R
e
p
i
,
Δ
E
n
t
r
o
p
y
i
k
=
E
n
t
r
o
p
y
i
k
-
E
n
t
r
o
p
y
i
k
-
1
,
i
=
1,2
,
…
,
n
S
u
b
.After the decomposition, the solutions ins
R
e
p’s gather around the optimal areas leaded by the corresponding objectives. As Figure 2(a) illustrates, the unbalance distribution leads to the unequal learning pressure and incomplete PF solutions. Our coevolution proposal makes efforts toward the unequalness in the leading pressure, and we propose the following strategy. In early generations, the UPSO adjusts the evolution orientation to the subgroup objectives. This procedure exerts the particles’ maximum potential and accelerates the evolution. The procedure is abstracted into the routine from p
(
k
) to p
(
k
+
a
) in Figure 2(b). As the procedure moves on, more and more elite solutions dominated by subgroup objectives are found near the true Pareto front. To balance the learning pressure and expand the diversity, the UPSO generally change the emphases direction by enlarging the unification factor μ, changing the particle’s routine to p
(
k
+
a
+
b
). Through this approach, the new solution settles down as a new REP candidate and broadens the REP coverage as shown in Figure 2(c). To adaptively adjust the factor μ in a particle’s updating formulation, we make connection between μ and stabilities of the subgroups. When the group’s repository has a low stability, which means that the Pareto represented by the group is still searching, particles should have a smaller μ to focus on the group itself; when the group’s repository has a high stability, which means that the inner group search is nearly complete, particles should have a larger μ to search between groups. Following these rules, we built function equation (7). The entropy also worked as the role to determine the termination of one decomposed UPSO procedure or the so-called inner loop. The termination condition is set to be the time when the norm of vector Δ
E
n
t
r
o
p
y less than threshold or the counting of inner iteration exceeds the maximum.(7)
μ
i
1
=
0
,
μ
i
k
=
1
1
+
exp
⁡
-
10
Δ
E
n
t
r
o
p
y
i
k
+
1
,
k
>
1
.Figure 2
Illustration of the particle trace in UMOPSO-D.
(a)
(b)
(c)


### 5.6. Main Algorithm

The algorithm of UMOPSO-D is detailed in Algorithm3.Algorithm 3:Main algorithm.
Input: Number of particles in P
O
P, the maximum generation is max
⁡
A
l
l,
number if inner iterationsmax
⁡
I
n.
Output: The approximate P
F in global repository g
R
e
p
(1) Decompose the objectives according to Algorithm1.
(2) Randomly initialize the position of each particle;
initialize the velocityv
e
l
(
i
)
=
0, i
=
1
,
…
,
n
P
o
p.
(3) Store the nondominated particles into the subgroup repositorys
R
e
p;
Updateg
R
e
p.
(4) Initialize the unification factorμ; calculate entropies for each subgroup.
(5) Initialize each particle’s best positionp
B
e
s
t.
(6)while
c
o
u
n
t
1
≤
max
⁡
A
l
l
do
(7)for
c
o
u
n
t
2 = 1 : max
⁡
I
n
do
(8)   (a) Update the velocity and position according to the unified particle
swarm optimization, the selection procedures ofl
B
e
s
t
i and g
B
e
s
t
i
follow the algorithm in Section5.2.
(9)   (b) If the particles’ position beyond the decision space, the corresponding
variable should be replaced by the value of the boundaries.
(10)   (c) Evaluate the new cost of each particle inP
O
P.
(11)   (d) Updates
R
e
p, add new nondominated particles in and move
the dominated solutions out. If the number of particles exceed
the capacity ofs
R
e
p, filter the s
R
e
p according to dominance rank.
(12)   (e) Updateg
R
e
p. If the number of particles exceed
the capacity ofg
R
e
p, filter the g
R
e
p with crowding reference.
(13)   (f) CalculateΔ
E
n
t
r
o
p
y, μ according to Equation (6) and Equation (7).
(14)   (g)c
o
u
n
t
1
=
c
o
u
n
t
1
+
1.
(15)end for
(16)  Regroup the objectives according to Algorithm1.
(17)  Recompose the subgroup repositories.
(18)end while


## 5.1. Decomposition of MaOPs

In light of the deterioration of MOPSO when the number of objectives rises, in the proposed technique, the many-objective optimization problems described in Section2 are decomposed into several subgroups which have objectives less than or equal to three. As the program is running, the composition of subgroups was recomputed to make sure of the balance of whole objectives.Dimensionality reduction technique always combines objectives based on correlation and coupling. As the strengthened nondominance pressure applying on subgroups, the Pareto-optimal set increases quickly and holds some extreme directions, which make sure of the searching area at the early iteration. Yet, in most MaOPs, the connections between the many objectives can not be defined clearly, so that farfetched decomposition and recombination may cause the incomplete description of the origin. We introduce the correlation-based decoupling for the many-objective optimization. As coupling degree is related to the correlation degree, correlation-based decoupling techniques can be divided into relevant decoupling and conflict decoupling. On the one hand, in relevant decoupling, the relevant objectives have similar trends of increasing and decreasing; as a result, the optimal solutions gather together, which provide advantage for the particles to search in a smaller neighborhood. On the other hand, in conflict decoupling, the conflict objective space holds a larger number of nondominated solutions, which can guarantee the searching diversity in low-dimensional spaces. In this paper, both of the correlation-based decoupling methods are considered in the simulations. According to the comparison result in Section6, the conflict decoupling holds a better performance in UMOPSO-D algorithm.There are several correlation coefficient measurements; the most common ones of these are Pearson’s correlation coefficient and Spearman’s rank correlation. Pearson’s correlation coefficient is sensitive to a linear relationship between two variables and has demand to the variance ranges, so it is not appropriate for the MaOPs’ decomposition. In comparison, rank correlation is a nonparametric measure of statistical dependence between two variables, makes the coefficient less sensitive to nonnormality in distributions, and gives good descriptions of consistency and tendency. Spearman’s rank correlation coefficient between objective functionsF
i and F
j at iteration k is defined as R
i
j
(
k
), R
i
j
(
k
)
∈
[
-
1,1
]; the closer the coefficient is to either 1 or -
1, the stronger the correlation or anticorrelation between the objectives is. To avoid extra computation or memory space on correlation calculation, we use the solution fitnesses found by particles during iterations as the sample points.Using this technique, the coupling degrees change corresponding with particles fitnesses; in other words, the coupling relations depend on the particles’ evolution procedure. To update the evolutionary process and express the nonlinear objectives, the decoupling operates before every decomposition procedure.To balance the computational loads between subgroups, the formulation between the number of subgroupsn
S
u
b and the number of objectives n
O
b
j is n
O
b
j
=
⌊
n
O
b
j
/
3
⌋, which is initialized at the beginning of main algorithm. The size of population is n
P
o
p, the maximum of global repository is n
R
e
p, and maximal size of subgroup repositories is ⌊
n
P
o
p
/
n
S
u
b
⌋. The objectives decompositions are carried out during several UPSO iterations. The procedure of decomposition is shown in Algorithm 1.Algorithm 1:Decomposition algorithm.
Input: Objectives F
m, m
=
1,2
,
…
,
n
O
b
j
Output: Objective subsets,
(1)while
1
do
(2)if
n
O
b
j
-
3
×
n
S
u
b
≤
3
then
(3)   Put the last objectives into one subgroup
(4)n
S
u
b
=
n
S
u
b
+
1
(5)   Exit the while loop
(6)end if
(7)  Calculate the rank correlationR
1
j between F
1 and all the other
objectivesF
j under P
O
P’s fitnesses
(8)  Select the largest (or smallest, relevant decoupling and conflict
decoupling relatively) twoR
1
j, (
j
=
j
1
,
j
2
)
(9)  PutF
i, F
j
1, F
j
2 into one subgroup
(10)  Rearrange the rest objectives
(11)end while


## 5.2. Local Best and Global Best Selection

In the updating formulation of PSO, the global bestg
B
e
s
t is defined as the best position that particles in population have ever been. Yet, in a multiobjective problem, the best position is not unique, and any solution that has nondominated quality or the front sort rank can be viewed as a g
B
e
s
t. g
B
e
s
t works as the leader in the MOPSO searching process, so global best selection is a key task which can determine the direction of the particles, the convergence speed, and the diversity. There are several popular methods of global best selection in the state-of-the-art MOPSOs, such as crowing distance technique, region-based strategy using adaptive hypercubes, and nondominated sorting technique. As iteration goes on, some particles gather together around several high expected optimal areas, making these areas more developed. The regularity we found was that the more developed the area is where the g
B
e
s
t is selected, the higher the selection pressure is exerted on the particles, which leads to a fast convergence but a poor diversity; on the contrary, the less developed the area is where the g
B
e
s
t is selected, the more flexible the moving directions are which promise a rich diversity but slow convergence speed.In the UPSO, both the subgroup local bestl
B
e
s
t
i and global best g
B
e
s
t
i influence the directions of particle i. The subgroups and whole-set constitute a double loop system, in which we can apply two suites of selection strategies. The subgroup plays a role as the inner loop which needs to make sure of the convergence and speed, so we promote the closest distance method to select l
B
e
s
t
i; the whole-set function plays as the outer loop to maintain the population diversity and avoid premature phenomenon, so we promote the hypergroup method to select g
B
e
s
t
i. In this way, the particles in the subgroup search around the optimal areas, try directions pointed to other groups constantly, and prepare for the next subgroups rearrangement. The proposed g
B
e
s
t selection algorithms are detailed in the following paragraph.Closest Distance Method. In this method, calculate the distances between the given particle and positions in the subgroup repository s
R
e
p
i which collects those nondominated solutions in subgroup i, and then select the closest solution as the l
B
e
s
t
i for the given particle.Hypergroup Method. Hypergroup represents that g
B
e
s
t
i is in a different group from the given particle i. g
B
e
s
t
i is selected from the global repository g
R
e
p, which stores the refined elite solutions from subgroup repositories. Each solution in g
R
e
p is labeled by the group index which indicates where it comes from. g
R
e
p is managed by a group of reference vectors which is detailed in Section 5.4. Based on the distances between the particle and the reference vectors in objective space, the closest vector is determined, and the solution associated with this vector is selected as g
B
e
s
t
i. Under the situation that the vector has no associate solution or the associate solution has the same group index with particle i, the global best selection moves on to the next closest vector.


## 5.3. Personal Best Selection

The personal best is defined as the best position that the particle has ever been during the searching process, which raises challenge in MOPs, andith particle’s fitness F
i and p
B
e
s
t
i are incomparable. As a result, the personal best cannot be updated directly. Reference [3] used the random way to select one best memory as the value of p
B
e
s
t; [34] built the personal archive p
R
e
p and proposed the largest minimal distance for the decision. In this paper, a new method is presented named objective balance strategy, Algorithm 2, which defines p
B
e
s
t from repository p
R
e
p. The calculation of the leading objective indexes is detailed in Section 5.4.Algorithm 2:Personal best selection.
Input: The ith particle P
i; the repository for P
i, p
R
e
p
i;
the current operating groupS
u
b
g
r
o
u
p
j.
Output: p
B
e
s
t
i
(1) Update personal repositoryp
R
e
p
i.
(2) Select the memories inp
R
e
p
i whose leading index
belong to theS
u
b
g
r
o
u
p
j as the personal
best candidates. The number of the candidates isN.
(3)if
N
=
=
0
thenSelect p
B
e
s
t
i randomly
fromp
R
e
p
i.
(4)elseSelect p
B
e
s
t
i whose index is a minority
inp
R
e
p
i from candidates.
(5)end if


## 5.4. Repositories Strategy

The high dimension objectives lead to large area ofP
F, which means there are a great many nondominated positions found during early iterations, and the repository soon reaches saturation. In the UMOPSO-D proposal, each subgroup with three or less objectives has archive(
s
R
e
p
). Because the selecting pressure is relatively large insRep, we employ dominated rank as the assessment strategy of each solution. When the repository reaches the limit, solutions with poor rank values are abandoned.The maintenance of global repository(
g
R
e
p
) plays an important role in MOP algorithms, for the reason that it will provide leader information and balance the convergence and diversity. When the iteration terminates, g
R
e
p outputs the optimal solutions. g
R
e
p consisted of solutions from all subgroup repositories. In this paper, we use a set of reference vectors to work as a diversity standard, which is inspired from Das and Dennis’s systematic approach [35]. Each solution in g
R
e
p finds its associated vector according to the closest distance. When the number of solutions in g
R
e
p exceeds the upper boundary, the vector which associates the most solutions is selected, and one of the corresponding associates will be deleted. The above procedure repeats until the number of members in g
R
e
p is equal to upper boundary. The method above is called crowding reference.The algorithm regroups the objectives and population after several iterations according to the stability. After regrouping, the repositories of new subgroup become empty again. We propose the repositories recompose strategy that assigns each solution ins
R
e
p the objective it belongs to. Combine all s
R
e
p’s and we have the global repository g
R
e
p, then, to every solution, calculate each cost dimension’s value sorting from small to big in all the elements of g
R
e
p, and choose the one top rank to be the leading objective. If more than one dimension share the top place, randomly choose one as the leading objective. When the regrouping begins, the solutions in s
R
e
p follow the leading objective whose best performance points into the new subgroups repository.Take a simple example; the distribute hypercube indexes and the leading objective indexes of the known Pareto front ofD
T
L
Z
1 from decomposed procedure in the 20th generation are listed in Table 1, where parameters are n
O
b
j
=
6, G
=
6, the number of solutions in s
R
e
p is n
s
R
e
p
=
10, and the grouping states is {
f
1
,
f
2
,
f
3
} and {
f
4
,
f
5
,
f
6
}. Assume, in the next decomposition, objectives {
f
1
,
f
4
,
f
5
} go to subgroup S
u
b
1 and objectives {
f
2
,
f
3
,
f
6
} go to subgroup S
u
b
2. According to the leading objective indexes, the solution with bold font in Table 1 goes to subgroup repository s
R
e
p
1, and the rest go to s
R
e
p
2.Table 1
Solutions’ leading objectives, hypercube indexes, and potential indexes.
Solutions
Objective values
Leading
Hypercube indexes
PHS
f
1
f
2
f
3
f
4
f
5
f
6
Index
f
1
f
2
f
3
f
4
f
5
f
6
F
s
1
F
s
2
S
1
0.0337
0.8423
0.8137
2.4917
5.0242
6.2828
1
1
2
2
2
3
4
5
9
S
2
2.1548
2.4148
2.5226
3.4226
4.8307
2.1662
6
6
6
6
2
3
1
18
6
S
3
0.6900
0.3672
1.0327
13.2334
5.1143
4.9227
2
2
1
2
6
3
3
5
12
S
4
0.0192
0.7002
0.6645
6.4037
6.8943
7.5655
1
0
2
1
3
4
6
3
13
S
5
1.8129
1.6961
2.2429
3.3351
0.4922
2.8506
5
5
4
6
2
0
1
15
3
S
6
1.0025
2.2427
2.1827
0.2809
0.5690
3.1957
4
3
6
6
0
1
2
15
3
S
7
0.4121
0.2187
0.6295
7.8051
7.2729
3.5382
2
2
0
1
4
5
2
3
11
S
8
2.1019
1.3218
1.3989
1.8994
5.8646
1.7325
6
6
3
3
1
4
0
12
5
S
9
2.1742
2.5953
2.0775
3.4450
1.6556
2.4780
5
6
6
5
2
1
1
17
4
S
10
0.0193
0.3953
0.3435
6.1977
10.3869
8.6391
3
1
1
0
3
6
6
2
15


## 5.5. Unified Coevolutionary Strategy

In order to have the visual representation of the solutions’ routes and express the feasible detailed designs in the coevolution process, we proposed a novel hypercube technique. For the proposed algorithm itself, this novel hypercube technique helps to assess the convergence of subgroups, balance the learning directions of particles, and set rules for parameters.The hypercubes are used to grid the solutions in subgroup archives, which are adaptive, similarly to [3, 25]. The number of grids G is provided in the initialization of the algorithm. According to (5), the lth elite solution is assigned into a grid with integral labels. Then, P
o
t
e
n
t
i
a
l is calculated for each solution.(5)
S
l
.
C
o
s
t
=
f
1
,
l
,
f
2
,
l
,
…
,
f
m
,
l
,
…
,
f
n
O
b
j
,
l
T
,
g
m
,
l
=
c
e
i
l
G
f
m
,
l
-
f
m
m
i
n
f
m
m
a
x
-
f
m
m
i
n
,
S
l
.
G
r
i
d
I
n
d
e
x
=
g
1
,
l
,
g
2
,
l
,
…
,
g
m
,
l
T
,
p
i
,
l
=
∑
j
S
l
.
G
r
i
d
I
n
d
e
x
j
,
f
j
∈
S
u
b
i
,
S
l
.
P
o
t
e
n
t
i
a
l
=
p
1
,
l
,
p
2
,
l
,
…
,
p
n
S
u
b
,
l
T
.In a previous paper [36], the entropy was used to measure the diversity of the population; in [25], Δ
E
n
t
r
o
p
y was proposed to classify the population of exploitation and exploration, which can be referred to as the stability of the population. Similarly, we use the entropy method to assess the stability of the subgroup through Δ
E
n
t
r
o
p
y of subgroup archive. For the reason that the MaOPs with decomposition technique need large amount of calculation in parallel cell coordinate system, improvement has been made based on this basis. We use the values of P
o
t
e
n
t
i
a
l instead of G
r
i
d
I
n
d
e
x to represent a solution and change the entropy computation space fromG (row) ×nObj (column) to 3G (row) ×nSub (column), named potential hyperspace (PHS). As an example, the calculations of PHS are listed in Table 1. In every iteration, the records of S
.
P
o
t
e
n
t
i
a
l falling in the PHSs form an information entropy which can reflect the uniformity of the subgroup. The entropy is defined according to (6), where C
e
l
l
g
,
m is the number of archives which are located in grid g, m. While E
n
t
r
o
p
y assesses the convergence of the subgroup, Δ
E
n
t
r
o
p
y represents the variation range of convergence, that is, the stability.(6)
E
n
t
r
o
p
y
i
k
=
-
∑
g
=
1
3
G
∑
m
=
1
n
S
u
b
C
e
l
l
g
,
m
k
n
s
R
e
p
i
log
⁡
C
e
l
l
g
,
m
k
n
s
R
e
p
i
,
Δ
E
n
t
r
o
p
y
i
k
=
E
n
t
r
o
p
y
i
k
-
E
n
t
r
o
p
y
i
k
-
1
,
i
=
1,2
,
…
,
n
S
u
b
.After the decomposition, the solutions ins
R
e
p’s gather around the optimal areas leaded by the corresponding objectives. As Figure 2(a) illustrates, the unbalance distribution leads to the unequal learning pressure and incomplete PF solutions. Our coevolution proposal makes efforts toward the unequalness in the leading pressure, and we propose the following strategy. In early generations, the UPSO adjusts the evolution orientation to the subgroup objectives. This procedure exerts the particles’ maximum potential and accelerates the evolution. The procedure is abstracted into the routine from p
(
k
) to p
(
k
+
a
) in Figure 2(b). As the procedure moves on, more and more elite solutions dominated by subgroup objectives are found near the true Pareto front. To balance the learning pressure and expand the diversity, the UPSO generally change the emphases direction by enlarging the unification factor μ, changing the particle’s routine to p
(
k
+
a
+
b
). Through this approach, the new solution settles down as a new REP candidate and broadens the REP coverage as shown in Figure 2(c). To adaptively adjust the factor μ in a particle’s updating formulation, we make connection between μ and stabilities of the subgroups. When the group’s repository has a low stability, which means that the Pareto represented by the group is still searching, particles should have a smaller μ to focus on the group itself; when the group’s repository has a high stability, which means that the inner group search is nearly complete, particles should have a larger μ to search between groups. Following these rules, we built function equation (7). The entropy also worked as the role to determine the termination of one decomposed UPSO procedure or the so-called inner loop. The termination condition is set to be the time when the norm of vector Δ
E
n
t
r
o
p
y less than threshold or the counting of inner iteration exceeds the maximum.(7)
μ
i
1
=
0
,
μ
i
k
=
1
1
+
exp
⁡
-
10
Δ
E
n
t
r
o
p
y
i
k
+
1
,
k
>
1
.Figure 2
Illustration of the particle trace in UMOPSO-D.
(a)
(b)
(c)


## 5.6. Main Algorithm

The algorithm of UMOPSO-D is detailed in Algorithm3.Algorithm 3:Main algorithm.
Input: Number of particles in P
O
P, the maximum generation is max
⁡
A
l
l,
number if inner iterationsmax
⁡
I
n.
Output: The approximate P
F in global repository g
R
e
p
(1) Decompose the objectives according to Algorithm1.
(2) Randomly initialize the position of each particle;
initialize the velocityv
e
l
(
i
)
=
0, i
=
1
,
…
,
n
P
o
p.
(3) Store the nondominated particles into the subgroup repositorys
R
e
p;
Updateg
R
e
p.
(4) Initialize the unification factorμ; calculate entropies for each subgroup.
(5) Initialize each particle’s best positionp
B
e
s
t.
(6)while
c
o
u
n
t
1
≤
max
⁡
A
l
l
do
(7)for
c
o
u
n
t
2 = 1 : max
⁡
I
n
do
(8)   (a) Update the velocity and position according to the unified particle
swarm optimization, the selection procedures ofl
B
e
s
t
i and g
B
e
s
t
i
follow the algorithm in Section5.2.
(9)   (b) If the particles’ position beyond the decision space, the corresponding
variable should be replaced by the value of the boundaries.
(10)   (c) Evaluate the new cost of each particle inP
O
P.
(11)   (d) Updates
R
e
p, add new nondominated particles in and move
the dominated solutions out. If the number of particles exceed
the capacity ofs
R
e
p, filter the s
R
e
p according to dominance rank.
(12)   (e) Updateg
R
e
p. If the number of particles exceed
the capacity ofg
R
e
p, filter the g
R
e
p with crowding reference.
(13)   (f) CalculateΔ
E
n
t
r
o
p
y, μ according to Equation (6) and Equation (7).
(14)   (g)c
o
u
n
t
1
=
c
o
u
n
t
1
+
1.
(15)end for
(16)  Regroup the objectives according to Algorithm1.
(17)  Recompose the subgroup repositories.
(18)end while


## 6. Simulation Result

In this section, the benchmark function set DTLZ is employed as the test problem, and three metrics are selected to value the performance of the seven algorithms MOPSO, MOPSO/D, NSGA-II, MOEA/D, Gong,α-DEMO-revised, and UMOPSO-D. We run UMOPSO-D with relevant decoupling and conflict decoupling, respectively.


### 6.1. Performance Metrics

We select performance metrics to evaluate the convergence performance, the diversity performance, and the running efficiency, to provide straightforward statistical quantifications on the comparison of MOEAs.Generational Distance (GD). This metric evaluates the convergence, which requires an approximate set which represents P
F
t
r
u
e. It is widely used in MOP performance assessment [19, 37]. It is mathematically defined in (8). Here, d
i is the Euclidean phenotypic distance between the pth solution in P
F
k
n
o
w
n and the closest member in P
F
t
r
u
e; n is the number of solutions in P
F
k
n
o
w
n. For two solution sets A and B, G
D
A
<
G
D
B
⇒
A
⊳
B.(8)
G
D
=
∑
p
=
1
n
d
p
2
1
/
2
n
.Hypervolume (HV). The metric assesses the diversity as well as the convergence performance, through the summation of all the rectangular areas boxed by coordinate values of the predesigned reference point. It and its similar forms have been widely used in many researches [5, 38, 39]. The definition of HV metric is in (9), where V
O
L
(
·
) is the Lebesgue measure. The selection of reference point is essential. Too-big or too-small references will result in high similarity evaluation values during the contrast. Based on the convergence difficulty and several repeated trials, the reference point r is set according to Table 2. For two solution sets A and B, H
V
A
>
H
V
B
⇒
A
⊳
B in either convergence or diversity or both of them.(9)
H
V
=
1
V
r
V
O
L
⋃
p
=
1
n
V
p
,where n is the number of solutions which dominate the reference point; V
p is the Lebesgue measure between solution p and reference, which reflects the small hypervolume bounded by the solution p and reference; V
r is the Lebesgue measure between coordinate origin and reference point.Table 2
Setting of reference point.
Function
Reference point
DTLZ1
3.0
,
…
,
3.0
T
DTLZ2
1.5
,
…
,
1.5
T
DTLZ3
3.0
,
…
,
3.0
T
DTLZ4
1.5
,
…
,
1.5
TAlgorithm Running Efficiency (ARE). Algorithm Running Efficiency (ARE) is often evaluated to assess the computational effect [40]. According to (10), T
R
u
n
T
i
m
e is the total calculation time and N
E
v
a
l is the number of estimations. A
R
E
A
<
A
R
E
B indicates A is better than B in efficiency.(10)
A
R
E
=
T
R
u
n
T
i
m
e
N
E
v
a
l
.


### 6.2. Parameter Settings

Benchmark Test Problems. We run the comparison between the selected algorithms on four test problems, DTLZ1 to DTLZ4. Recommended in [41], the number of decision variables is set to n
V
a
r
=
n
O
b
j
+
K
-
1. During our simulation, K is set to 5 for DTLZ1 and set to 10 for DTLZ2, DTLZ3, and DTLZ4. The sample size in the true PF is set to 1000. n
O
b
j’s are set to 9, 15, 30, and 45 for each test instance, and the corresponding maximum generations are 1000, 1000, 1500, and 2000.Settings for Algorithms. Seven MOEAs including the state-of-the-art many-objective algorithms are selected as the comparison algorithms in the comparison. Among them, three algorithms are based on the PSO metaheuristic, and the PSO parameters are defined as ω
=
0.4 and c
1
=
c
2
=
R
a
n
d. The maximal sizes of global repository and population are set to 100 for every algorithm. Based on the conclusion in [19] that Gong’s algorithm achieves the best performance on the 24 objectives’ problem when n
O
b
j reduced to 6, we choose ⌊
n
O
b
j
/
4
⌋ as the number of decomposition objectives for each instance. α in α-DEMO-revised is defined as 0.5. The hardware configuration in this paper is Intel(R) Core (TM) i5-4570.


### 6.3. Experiment Results

In this section, the detailed comparison results are organized in the following. The experimental results, including the mean and standard deviation of the performance metric GD generated by 15 independent simulations performed on each test instance, are summarized in Table3, where the best results are highlighted. The DEMO is short for α-DEMO-revised in the data table. U
(
1
) stands for UMOPSO-D with relevant decoupling; U
(
2
) stands for UMOPSO-D with conflict decoupling.Table 3
Comparisons of GD between proposed algorithm and other MOEAs.
Functions
MOPSO
MOPSO/D
NSGA-II
MOEA/D
Gong
DEMO
U
(
1
)
U
(
2
)
D
T
L
Z
1
Mean
1.636
E
+
01
5.668
E
+
00
4.114
E
-
01
3.096
E
-
01
9.330
E
-
02
7.869
E
-
02
7.866
E
-
02
2.087
E
-
02
M
=
9
Std.
8.422
E
-
02
2.799
E
-
01
2.041
E
-
01
1.859
E
-
01
4.442
E
-
01
9.859
E
-
02
1.239
E
-
02
3.130
E
-
02
D
T
L
Z
1
Mean
1.366
E
+
01
3.901
E
+
00
1.484
E
-
01
1.839
E
-
01
1.295
E
-
01
1.433
E
-
01
9.108
E
-
02
2.451
E
-
01
M
=
15
Std.
7.368
E
-
01
2.136
E
-
01
2.980
E
-
02
1.213
E
-
01
5.529
E
-
01
9.842
E
-
02
8.942
E
-
02
3.078
E
-
01
D
T
L
Z
1
Mean
1.382
E
+
01
3.973
E
+
00
1.493
E
-
01
7.470
E
-
01
9.843
E
-
01
1.544
E
-
01
1.520
E
-
01
2.742
E
-
03
M
=
30
Std.
1.234
E
+
00
1.793
E
-
01
9.386
E
-
03
8.956
E
-
02
1.384
E
+
00
1.383
E
-
01
1.182
E
+
00
1.163
E
-
03
D
T
L
Z
1
Mean
1.561
E
+
01
3.887
E
+
00
1.068
E
-
01
9.135
E
-
01
9.994
E
-
01
4.873
E
-
01
3.232
E
-
01
3.245
E
-
02
M
=
45
Std.
1.717
E
-
01
2.301
E
-
01
5.652
E
-
03
2.961
E
-
01
9.422
E
+
00
9.733
E
-
01
1.109
E
+
00
7.990
E
-
02
D
T
L
Z
2
Mean
1.524
E
-
02
1.543
E
-
02
1.919
E
-
03
1.239
E
-
03
4.339
E
-
03
2.534
E
-
03
8.421
E
-
04
2.146
E
-
03
M
=
9
Std.
5.840
E
-
04
7.058
E
-
04
5.665
E
-
05
2.006
E
-
03
1.932
E
-
01
1.428
E
-
02
5.437
E
-
03
2.584
E
-
03
D
T
L
Z
2
Mean
1.303
E
-
02
1.622
E
-
02
3.789
E
-
03
1.156
E
-
03
1.385
E
-
02
9.156
E
-
04
1.152
E
-
03
9.506
E
-
03
M
=
15
Std.
8.818
E
-
04
1.415
E
-
03
8.893
E
-
04
2.062
E
-
03
1.185
E
-
01
2.314
E
-
03
6.657
E
-
03
1.447
E
-
02
D
T
L
Z
2
Mean
1.243
E
-
02
1.550
E
-
02
6.755
E
-
03
3.329
E
-
03
1.732
E
-
02
2.592
E
-
03
1.032
E
-
03
2.542
E
-
04
M
=
30
Std.
1.428
E
-
03
8.268
E
-
04
6.551
E
-
05
1.806
E
-
03
3.215
E
-
01
9.812
E
-
03
9.123
E
-
03
2.859
E
-
04
D
T
L
Z
2
Mean
1.141
E
-
02
1.546
E
-
02
1.557
E
-
02
1.170
E
-
03
1.471
E
-
03
8.891
E
-
04
5.769
E
-
04
3.279
E
-
03
M
=
45
Std.
8.896
E
-
04
9.326
E
-
01
1.616
E
-
03
3.918
E
-
03
9.148
E
-
01
8.195
E
-
02
9.283
E
-
02
7.330
E
-
03
D
T
L
Z
3
Mean
9.027
E
+
01
4.377
E
+
01
1.538
E
+
00
4.846
E
+
00
6.353
E
-
01
7.476
E
-
01
9.476
E
-
01
5.353
E
-
01
M
=
9
Std.
3.959
E
+
00
9.981
E
-
01
3.649
E
-
01
1.400
E
+
00
9.942
E
-
01
7.613
E
-
02
6.512
E
-
01
5.794
E
-
01
D
T
L
Z
3
Mean
9.251
E
+
01
4.383
E
+
01
2.022
E
+
00
5.550
E
+
00
9.113
E
-
01
1.728
E
+
00
1.227
E
+
00
2.569
E
+
01
M
=
15
Std.
3.381
E
+
00
5.121
E
-
01
4.943
E
-
01
3.094
E
+
00
6.452
E
-
01
9.813
E
-
02
8.989
E
-
02
2.420
E
+
01
DTLZ3
Mean
9.364
E
+
01
4.396
E
+
01
2.989
E
+
00
3.210
E
+
00
4.326
E
+
00
2.329
E
+
00
2.139
E
+
00
7.517
E
+
00
M
=
30
Std.
8.276
E
-
01
7.818
E
-
01
5.291
E
-
01
2.969
E
+
00
1.482
E
+
00
8.925
E
-
01
1.379
E
+
00
1.160
E
+
01
D
T
L
Z
3
Mean
9.242
E
+
01
4.495
E
+
01
8.654
E
+
00
2.329
E
+
00
3.189
E
+
00
1.262
E
+
00
1.269
E
+
00
2.012
E
+
01
M
=
45
Std.
5.883
E
+
00
9.509
E
-
01
3.510
E
-
01
3.077
E
+
00
9.034
E
-
01
9.132
E
-
01
3.613
E
-
01
4.073
E
+
01
D
T
L
Z
4
Mean
3.637
E
-
02
1.269
E
-
02
6.763
E
-
04
4.328
E
-
04
8.422
E
-
02
6.437
E
-
02
6.438
E
-
03
9.683
E
-
04
M
=
9
Std.
1.034
E
-
02
2.932
E
-
03
2.116
E
-
05
2.581
E
-
03
9.942
E
-
02
6.336
E
-
03
9.684
E
-
02
8.127
E
-
04
D
T
L
Z
4
Mean
3.713
E
-
02
1.957
E
-
02
4.557
E
-
03
9.255
E
-
03
4.224
E
-
02
9.823
E
-
03
7.312
E
-
03
6.039
E
-
03
M
=
15
Std.
8.024
E
-
04
3.739
E
-
03
3.226
E
-
04
1.529
E
-
03
8.852
E
-
01
9.963
E
-
01
2.853
E
-
03
7.400
E
-
03
D
T
L
Z
4
Mean
3.459
E
-
02
2.487
E
-
02
5.214
E
-
03
1.211
E
-
02
9.428
E
-
02
1.954
E
-
02
6.123
E
-
03
6.563
E
-
04
M
=
30
Std.
2.503
E
-
03
2.220
E
-
03
1.495
E
-
03
4.663
E
-
03
1.331
E
-
01
7.264
E
-
03
9.742
E
-
02
5.779
E
-
04
D
T
L
Z
4
Mean
2.596
E
-
02
3.110
E
-
02
1.154
E
-
02
1.760
E
-
02
6.537
E
-
02
9.825
E
-
03
7.831
E
-
03
7.718
E
-
04
M
=
45
Std.
3.027
E
-
03
6.445
E
-
03
5.310
E
-
03
4.186
E
-
03
7.491
E
-
01
8.491
E
-
01
7.628
E
-
02
5.280
E
-
04On GD metric, first of all, we focus on the comparison between UMOPSO-D and the peer algorithms. Both relevant decoupling and conflict decoupling contribute to the UMOPSO-D performance. For experiments when the number of objectives equals 9, UMOPSO-D achieves best result in DTLZ1, DTLZ2, and DTLZ3, and, in DTLZ4, the deviation from the best performance is tiny. MOEA/D indicates a good convergence performance in DTLZ4. For results onM
=
15, UMOPSO-D, α-DEMO-revised, Gong, and NSGA-II are the best in DTLZ1 to DTLZ4 relatively. With the objective dimension increases, UMOPSO-D has greater advantage. It is evident from Table 3 that UMOPSO-D obtains better GD values other than comparison algorithms in high-dimensional experiments with M equaling 30 and 45, except in DTLZ3, 45 dimensions, where UMOPSO-D is sorted as the close second right after α-DEMO-revised but have lower standard deviation value. Furthermore, the statistical records show that UMOPSO-D is associated with poorer performance in DTLZ3 as compared to other DTLZs in all dimensions, with the relatively higher GD value from other comparison algorithms; this indicates the difficulty in searching the PF for DTLZ3. The PFs obtained by α-DEMO-revised and UMOPSO-D express good performance in general, while the UMOPSO-D works even better on the instance with more than 30 objectives. As a whole, on GD metric, UMOPSO-D together with the two recently proposed techniques, Gong and α-DEMO-revised, shares the good performance part in the comparisons of seven comparison algorithms.Secondly, the GD comparison between relevant decoupling and conflict decoupling in UMOPSO-D is illustrated as follows. Overall speaking, conflict decoupling has lower GD values in most situations, especially in DTLZ1 and DTLZ4. The differences between the two techniques in DTLZ2 and DTLZ3 are relatively small.The HV metrics of the simulations are shown in Table4. In DTLZ1, α-DEMO-revised and UMOSPO-D have relatively better performance. The differences among all comparisons, except MOPSO and MOPSO/D, are very small. It is indicated that UMOPSO-D greatly improves the performance of PSO-based algorithms in MaOP performance. In DTLZ2, UMOPSO-D with relevant decoupling has the highest scores. The average performance of MOEA/D is the second best. DTLZ3 expresses the worst HV performance, where MOPSO, MOPSO/D, NSGA-II, and MOEA/D obtain 0 or almost 0 because of the reason that nearly all solutions fall outside of the area defined by the reference point and decision space boundary. UMOPSO-D with conflict decoupling has obvious best HV score in DTLZ3 in all test dimensions. In DTLZ4, UMOPSO-D performs better when dimension is larger than 15, and MOEA/D and UMOPSO-D share the best result on HV metric. UMOPSO-D achieves the best values when dimension equals 30 and 45 (except in DTLZ1, M
=
30) and exhibits feasible values which are close to the optimums in 9 and 15 objectives. So it is reasonable to believe that UMOPSO-D performs better considering both convergence and diversity. The following good performances are provided by MOEA/D and α-DEMO-revised.Table 4
Comparisons of HV between proposed algorithm and other MOEAs.
Functions
MOPSO
MOPSO/D
NSGA-II
MOEA/D
Gong
DEMO
U
(
1
)
U
(
2
)
DTLZ1
Mean
7.800
E
-
03
5.226
E
-
02
7.428
E
-
01
8.310
E
-
01
7.562
E
-
01
8.956
E
-
01
8.862
E
-
01
9.617
E
-
01
M
=
9
Std.
1.351
E
-
02
8.272
E
-
02
2.540
E
-
02
1.609
E
-
01
2.465
E
-
03
1.540
E
-
03
5.465
E
-
02
1.296
E
-
02
DTLZ1
Mean
0.000
E
+
00
1.371
E
-
01
7.232
E
-
01
8.945
E
-
01
7.215
E
-
01
8.970
E
-
01
8.910
E
-
01
8.002
E
-
01
M
=
15
Std.
0.000
E
+
00
1.343
E
-
01
5.670
E
-
02
7.123
E
-
02
4.684
E
-
03
6.440
E
-
03
9.546
E
-
03
1.389
E
-
01
DTLZ1
Mean
0.000
E
+
00
2.543
E
-
01
7.094
E
-
01
7.135
E
-
01
7.155
E
-
01
7.896
E
-
01
7.596
E
-
01
7.783
E
-
01
M
=
30
Std.
0.000
E
+
00
1.744
E
-
01
5.250
E
-
03
6.945
E
-
02
1.346
E
-
03
5.423
E
-
02
5.642
E
-
03
3.769
E
-
02
DTLZ1
Mean
0.000
E
+
00
1.954
E
-
01
7.560
E
-
01
7.231
E
-
01
7.302
E
-
01
7.549
E
-
01
7.785
E
-
01
7.324
E
-
01
M
=
45
Std.
0.000
E
+
00
1.074
E
-
01
7.000
E
-
03
2.294
E
-
01
9.852
E
-
03
6.981
E
-
02
4.687
E
-
03
1.468
E
-
01
DTLZ2
Mean
5.602
E
-
01
4.879
E
-
01
2.834
E
-
01
9.335
E
-
01
8.991
E
-
01
6.563
E
-
01
7.846
E
-
01
9.022
E
-
01
M
=
9
Std.
5.065
E
-
02
2.392
E
-
02
3.800
E
-
03
4.544
E
-
02
5.460
E
-
03
5.460
E
-
03
9.450
E
-
03
4.318
E
-
02
DTLZ2
Mean
5.355
E
-
01
4.768
E
-
01
2.617
E
-
01
7.504
E
-
01
6.155
E
-
01
6.613
E
-
01
8.797
E
-
01
8.254
E
-
01
M
=
15
Std.
4.550
E
-
03
1.590
E
-
02
9.000
E
-
04
3.619
E
-
02
6.980
E
-
03
5.120
E
-
03
5.640
E
-
03
7.229
E
-
02
DTLZ2
Mean
3.906
E
-
01
4.909
E
-
01
4.434
E
-
01
7.299
E
-
01
6.531
E
-
01
5.457
E
-
01
8.989
E
-
01
5.652
E
-
01
M
=
30
Std.
1.555
E
-
02
1.926
E
-
02
2.850
E
-
02
5.813
E
-
02
5.468
E
-
01
3.460
E
-
03
4.120
E
-
03
8.940
E
-
02
DTLZ2
Mean
3.288
E
-
01
4.920
E
-
01
5.347
E
-
01
7.097
E
-
01
3.047
E
-
01
5.580
E
-
01
7.801
E
-
01
5.170
E
-
01
M
=
45
Std.
2.735
E
-
02
1.656
E
-
02
2.745
E
-
02
4.165
E
-
02
1.560
E
-
02
7.650
E
-
03
7.770
E
-
03
5.949
E
-
02
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
2.699
E
-
02
1.567
E
-
01
1.021
E
-
01
7.264
E
-
01
M
=
9
Std.
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
6.870
E
-
02
1.560
E
-
02
5.870
E
-
03
2.325
E
-
01
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
3.945
E
-
02
7.130
E
-
03
2.898
E
-
02
1.679
E
-
01
1.650
E
-
01
1.836
E
-
01
M
=
15
Std.
0.000
E
+
00
0.000
E
+
00
3.945
E
-
02
1.830
E
-
02
6.540
E
-
02
8.970
E
-
02
7.560
E
-
03
3.193
E
-
01
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
2.005
E
-
02
5.590
E
-
02
8.198
E
-
02
2.856
E
-
01
M
=
30
Std.
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
7.650
E
-
02
5.460
E
-
02
6.120
E
-
03
1.793
E
-
01
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
2.069
E
-
01
1.210
E
-
03
1.984
E
-
02
4.897
E
-
02
5.469
E
-
02
2.953
E
-
01
M
=
45
Std.
0.000
E
+
00
0.000
E
+
00
1.630
E
-
01
2.440
E
-
03
8.680
E
-
03
5.460
E
-
03
1.560
E
-
03
2.391
E
-
01
DTLZ4
Mean
7.034
E
-
01
3.350
E
-
01
3.344
E
-
01
9.738
E
-
01
7.005
E
-
01
8.999
E
-
01
9.523
E
-
01
9.628
E
-
01
M
=
9
Std.
7.975
E
-
02
7.317
E
-
03
1.550
E
-
03
7.467
E
-
03
2.130
E
-
03
4.500
E
-
04
4.650
E
-
03
1.345
E
-
02
DTLZ4
Mean
7.780
E
-
01
3.562
E
-
01
3.199
E
-
01
9.898
E
-
01
7.995
E
-
01
9.857
E
-
01
9.957
E
-
01
9.962
E
-
01
M
=
15
Std.
3.940
E
-
02
2.222
E
-
02
1.300
E
-
03
5.261
E
-
03
2.300
E
-
04
4.520
E
-
03
1.110
E
-
03
2.907
E
-
03
DTLZ4
Mean
7.549
E
-
01
3.906
E
-
01
3.195
E
-
01
9.974
E
-
01
6.265
E
-
01
9.632
E
-
01
9.985
E
-
01
9.955
E
-
01
M
=
30
Std.
3.255
E
-
02
4.534
E
-
02
4.550
E
-
03
2.346
E
-
03
2.465
E
-
02
2.130
E
-
03
9.150
E
-
03
1.188
E
-
02
DTLZ4
Mean
7.713
E
-
01
4.049
E
-
01
3.928
E
-
01
9.183
E
-
01
5.156
E
-
01
9.131
E
-
01
9.458
E
-
01
9.864
E
-
01
M
=
45
Std.
1.905
E
-
02
3.170
E
-
02
1.299
E
-
01
7.658
E
-
04
4.750
E
-
03
5.780
E
-
03
1.450
E
-
03
5.094
E
-
02Furthermore, the HV metric indicates that the performance of relevant decoupling and conflict decoupling depends on the formulations of the given test instances. The conflict decoupling has obvious advantage in DTLZ3 but has relatively poor performance in DTLZ2. However, when taking GD into consideration, conflict decoupling has slight advantage compared to relevant decoupling.The ARE metrics of the simulations are shown in Table5. Under fixed objective dimension, the runtimes of different DTLZs are basically the same. The evaluation times are proportional to the POP sizes and number of iterations, so that there has been no difference among all DTLZ instances. The ARE scores, represented by DTLZ1 case, are displayed in Table 5. For the reason that MOPSO/D is inspired by MOPSO and MOEA/D, the AREs are omitted. According to the table, MOEA/D has the best efficiency among all algorithms, and NSGA-II is poorest. With reduced-dimension, α-DEMO-revised guarantees a lower complexity. UMOPSO-D and MOPSO have similar ARE value; however, the former has great advantages in convergence and diversity which have been proved above.Table 5
Comparisons of ARE between proposed algorithm and other MOEAs.
M
MOPSO
NSGA-II
MOEA/D
Gong
DEMO
UMOPSO-D
9
4.270
E
-
03
1.077
E
-
02
3.797
E
-
04
3.572
E
-
02
1.539
E
-
03
3.764
E
-
03
15
4.404
E
-
03
1.081
E
-
02
4.270
E
-
04
4.671
E
-
02
1.876
E
-
03
4.864
E
-
03
30
4.490
E
-
03
1.097
E
-
02
7.553
E
-
04
6.564
E
-
02
2.277
E
-
03
4.252
E
-
03
45
4.534
E
-
03
1.117
E
-
02
1.193
E
-
03
8.925
E
-
02
3.842
E
-
03
5.221
E
-
03Figure3 displays the convergence evolutionary curves evaluated by GD metric on DTLZ instances, 45 objectives among four well performed algorithms. The coupling method of UMOPSO-D in Figure 3 is relevant coupling. The GD curves illustrate that all the comparison algorithms are competent to further the convergence process and gradually get closer to the true PF with the generation. Note that UMOPSO-D shows poor performance at early iteration, which indicates the delayed reaction to the optimization problem. However, UMOPSO-D outperforms other algorithms in later generations. This finding can be explained by the decomposition and recomposition process which control the evolution reach optimum in several dimensions, and, with the coevolution continuing, more balanced subgroups cooperate and accelerate the convergence. Based on the results, UMOPSO-D is better than other algorithms on DTLZ1, DTLZ2, and DTLZ4 in high dimension situation and also performs a competitive result in DTLZ3.Figure 3
Performance curves on DTLZs in high dimension experiments.From the above statistical perspective and analysis, UMOPSO-D can guarantee a better or at least competitive performance in both convergence and diversity compared with the other six experimental algorithms in high-dimensional DTLZ problems. And conflict coupling has slight advantage compared to relevant coupling in objective decomposition. The computational efficiency is relatively low compared toα-DEMO-revised and MOEA/D.


## 6.1. Performance Metrics

We select performance metrics to evaluate the convergence performance, the diversity performance, and the running efficiency, to provide straightforward statistical quantifications on the comparison of MOEAs.Generational Distance (GD). This metric evaluates the convergence, which requires an approximate set which represents P
F
t
r
u
e. It is widely used in MOP performance assessment [19, 37]. It is mathematically defined in (8). Here, d
i is the Euclidean phenotypic distance between the pth solution in P
F
k
n
o
w
n and the closest member in P
F
t
r
u
e; n is the number of solutions in P
F
k
n
o
w
n. For two solution sets A and B, G
D
A
<
G
D
B
⇒
A
⊳
B.(8)
G
D
=
∑
p
=
1
n
d
p
2
1
/
2
n
.Hypervolume (HV). The metric assesses the diversity as well as the convergence performance, through the summation of all the rectangular areas boxed by coordinate values of the predesigned reference point. It and its similar forms have been widely used in many researches [5, 38, 39]. The definition of HV metric is in (9), where V
O
L
(
·
) is the Lebesgue measure. The selection of reference point is essential. Too-big or too-small references will result in high similarity evaluation values during the contrast. Based on the convergence difficulty and several repeated trials, the reference point r is set according to Table 2. For two solution sets A and B, H
V
A
>
H
V
B
⇒
A
⊳
B in either convergence or diversity or both of them.(9)
H
V
=
1
V
r
V
O
L
⋃
p
=
1
n
V
p
,where n is the number of solutions which dominate the reference point; V
p is the Lebesgue measure between solution p and reference, which reflects the small hypervolume bounded by the solution p and reference; V
r is the Lebesgue measure between coordinate origin and reference point.Table 2
Setting of reference point.
Function
Reference point
DTLZ1
3.0
,
…
,
3.0
T
DTLZ2
1.5
,
…
,
1.5
T
DTLZ3
3.0
,
…
,
3.0
T
DTLZ4
1.5
,
…
,
1.5
TAlgorithm Running Efficiency (ARE). Algorithm Running Efficiency (ARE) is often evaluated to assess the computational effect [40]. According to (10), T
R
u
n
T
i
m
e is the total calculation time and N
E
v
a
l is the number of estimations. A
R
E
A
<
A
R
E
B indicates A is better than B in efficiency.(10)
A
R
E
=
T
R
u
n
T
i
m
e
N
E
v
a
l
.


## 6.2. Parameter Settings

Benchmark Test Problems. We run the comparison between the selected algorithms on four test problems, DTLZ1 to DTLZ4. Recommended in [41], the number of decision variables is set to n
V
a
r
=
n
O
b
j
+
K
-
1. During our simulation, K is set to 5 for DTLZ1 and set to 10 for DTLZ2, DTLZ3, and DTLZ4. The sample size in the true PF is set to 1000. n
O
b
j’s are set to 9, 15, 30, and 45 for each test instance, and the corresponding maximum generations are 1000, 1000, 1500, and 2000.Settings for Algorithms. Seven MOEAs including the state-of-the-art many-objective algorithms are selected as the comparison algorithms in the comparison. Among them, three algorithms are based on the PSO metaheuristic, and the PSO parameters are defined as ω
=
0.4 and c
1
=
c
2
=
R
a
n
d. The maximal sizes of global repository and population are set to 100 for every algorithm. Based on the conclusion in [19] that Gong’s algorithm achieves the best performance on the 24 objectives’ problem when n
O
b
j reduced to 6, we choose ⌊
n
O
b
j
/
4
⌋ as the number of decomposition objectives for each instance. α in α-DEMO-revised is defined as 0.5. The hardware configuration in this paper is Intel(R) Core (TM) i5-4570.


## 6.3. Experiment Results

In this section, the detailed comparison results are organized in the following. The experimental results, including the mean and standard deviation of the performance metric GD generated by 15 independent simulations performed on each test instance, are summarized in Table3, where the best results are highlighted. The DEMO is short for α-DEMO-revised in the data table. U
(
1
) stands for UMOPSO-D with relevant decoupling; U
(
2
) stands for UMOPSO-D with conflict decoupling.Table 3
Comparisons of GD between proposed algorithm and other MOEAs.
Functions
MOPSO
MOPSO/D
NSGA-II
MOEA/D
Gong
DEMO
U
(
1
)
U
(
2
)
D
T
L
Z
1
Mean
1.636
E
+
01
5.668
E
+
00
4.114
E
-
01
3.096
E
-
01
9.330
E
-
02
7.869
E
-
02
7.866
E
-
02
2.087
E
-
02
M
=
9
Std.
8.422
E
-
02
2.799
E
-
01
2.041
E
-
01
1.859
E
-
01
4.442
E
-
01
9.859
E
-
02
1.239
E
-
02
3.130
E
-
02
D
T
L
Z
1
Mean
1.366
E
+
01
3.901
E
+
00
1.484
E
-
01
1.839
E
-
01
1.295
E
-
01
1.433
E
-
01
9.108
E
-
02
2.451
E
-
01
M
=
15
Std.
7.368
E
-
01
2.136
E
-
01
2.980
E
-
02
1.213
E
-
01
5.529
E
-
01
9.842
E
-
02
8.942
E
-
02
3.078
E
-
01
D
T
L
Z
1
Mean
1.382
E
+
01
3.973
E
+
00
1.493
E
-
01
7.470
E
-
01
9.843
E
-
01
1.544
E
-
01
1.520
E
-
01
2.742
E
-
03
M
=
30
Std.
1.234
E
+
00
1.793
E
-
01
9.386
E
-
03
8.956
E
-
02
1.384
E
+
00
1.383
E
-
01
1.182
E
+
00
1.163
E
-
03
D
T
L
Z
1
Mean
1.561
E
+
01
3.887
E
+
00
1.068
E
-
01
9.135
E
-
01
9.994
E
-
01
4.873
E
-
01
3.232
E
-
01
3.245
E
-
02
M
=
45
Std.
1.717
E
-
01
2.301
E
-
01
5.652
E
-
03
2.961
E
-
01
9.422
E
+
00
9.733
E
-
01
1.109
E
+
00
7.990
E
-
02
D
T
L
Z
2
Mean
1.524
E
-
02
1.543
E
-
02
1.919
E
-
03
1.239
E
-
03
4.339
E
-
03
2.534
E
-
03
8.421
E
-
04
2.146
E
-
03
M
=
9
Std.
5.840
E
-
04
7.058
E
-
04
5.665
E
-
05
2.006
E
-
03
1.932
E
-
01
1.428
E
-
02
5.437
E
-
03
2.584
E
-
03
D
T
L
Z
2
Mean
1.303
E
-
02
1.622
E
-
02
3.789
E
-
03
1.156
E
-
03
1.385
E
-
02
9.156
E
-
04
1.152
E
-
03
9.506
E
-
03
M
=
15
Std.
8.818
E
-
04
1.415
E
-
03
8.893
E
-
04
2.062
E
-
03
1.185
E
-
01
2.314
E
-
03
6.657
E
-
03
1.447
E
-
02
D
T
L
Z
2
Mean
1.243
E
-
02
1.550
E
-
02
6.755
E
-
03
3.329
E
-
03
1.732
E
-
02
2.592
E
-
03
1.032
E
-
03
2.542
E
-
04
M
=
30
Std.
1.428
E
-
03
8.268
E
-
04
6.551
E
-
05
1.806
E
-
03
3.215
E
-
01
9.812
E
-
03
9.123
E
-
03
2.859
E
-
04
D
T
L
Z
2
Mean
1.141
E
-
02
1.546
E
-
02
1.557
E
-
02
1.170
E
-
03
1.471
E
-
03
8.891
E
-
04
5.769
E
-
04
3.279
E
-
03
M
=
45
Std.
8.896
E
-
04
9.326
E
-
01
1.616
E
-
03
3.918
E
-
03
9.148
E
-
01
8.195
E
-
02
9.283
E
-
02
7.330
E
-
03
D
T
L
Z
3
Mean
9.027
E
+
01
4.377
E
+
01
1.538
E
+
00
4.846
E
+
00
6.353
E
-
01
7.476
E
-
01
9.476
E
-
01
5.353
E
-
01
M
=
9
Std.
3.959
E
+
00
9.981
E
-
01
3.649
E
-
01
1.400
E
+
00
9.942
E
-
01
7.613
E
-
02
6.512
E
-
01
5.794
E
-
01
D
T
L
Z
3
Mean
9.251
E
+
01
4.383
E
+
01
2.022
E
+
00
5.550
E
+
00
9.113
E
-
01
1.728
E
+
00
1.227
E
+
00
2.569
E
+
01
M
=
15
Std.
3.381
E
+
00
5.121
E
-
01
4.943
E
-
01
3.094
E
+
00
6.452
E
-
01
9.813
E
-
02
8.989
E
-
02
2.420
E
+
01
DTLZ3
Mean
9.364
E
+
01
4.396
E
+
01
2.989
E
+
00
3.210
E
+
00
4.326
E
+
00
2.329
E
+
00
2.139
E
+
00
7.517
E
+
00
M
=
30
Std.
8.276
E
-
01
7.818
E
-
01
5.291
E
-
01
2.969
E
+
00
1.482
E
+
00
8.925
E
-
01
1.379
E
+
00
1.160
E
+
01
D
T
L
Z
3
Mean
9.242
E
+
01
4.495
E
+
01
8.654
E
+
00
2.329
E
+
00
3.189
E
+
00
1.262
E
+
00
1.269
E
+
00
2.012
E
+
01
M
=
45
Std.
5.883
E
+
00
9.509
E
-
01
3.510
E
-
01
3.077
E
+
00
9.034
E
-
01
9.132
E
-
01
3.613
E
-
01
4.073
E
+
01
D
T
L
Z
4
Mean
3.637
E
-
02
1.269
E
-
02
6.763
E
-
04
4.328
E
-
04
8.422
E
-
02
6.437
E
-
02
6.438
E
-
03
9.683
E
-
04
M
=
9
Std.
1.034
E
-
02
2.932
E
-
03
2.116
E
-
05
2.581
E
-
03
9.942
E
-
02
6.336
E
-
03
9.684
E
-
02
8.127
E
-
04
D
T
L
Z
4
Mean
3.713
E
-
02
1.957
E
-
02
4.557
E
-
03
9.255
E
-
03
4.224
E
-
02
9.823
E
-
03
7.312
E
-
03
6.039
E
-
03
M
=
15
Std.
8.024
E
-
04
3.739
E
-
03
3.226
E
-
04
1.529
E
-
03
8.852
E
-
01
9.963
E
-
01
2.853
E
-
03
7.400
E
-
03
D
T
L
Z
4
Mean
3.459
E
-
02
2.487
E
-
02
5.214
E
-
03
1.211
E
-
02
9.428
E
-
02
1.954
E
-
02
6.123
E
-
03
6.563
E
-
04
M
=
30
Std.
2.503
E
-
03
2.220
E
-
03
1.495
E
-
03
4.663
E
-
03
1.331
E
-
01
7.264
E
-
03
9.742
E
-
02
5.779
E
-
04
D
T
L
Z
4
Mean
2.596
E
-
02
3.110
E
-
02
1.154
E
-
02
1.760
E
-
02
6.537
E
-
02
9.825
E
-
03
7.831
E
-
03
7.718
E
-
04
M
=
45
Std.
3.027
E
-
03
6.445
E
-
03
5.310
E
-
03
4.186
E
-
03
7.491
E
-
01
8.491
E
-
01
7.628
E
-
02
5.280
E
-
04On GD metric, first of all, we focus on the comparison between UMOPSO-D and the peer algorithms. Both relevant decoupling and conflict decoupling contribute to the UMOPSO-D performance. For experiments when the number of objectives equals 9, UMOPSO-D achieves best result in DTLZ1, DTLZ2, and DTLZ3, and, in DTLZ4, the deviation from the best performance is tiny. MOEA/D indicates a good convergence performance in DTLZ4. For results onM
=
15, UMOPSO-D, α-DEMO-revised, Gong, and NSGA-II are the best in DTLZ1 to DTLZ4 relatively. With the objective dimension increases, UMOPSO-D has greater advantage. It is evident from Table 3 that UMOPSO-D obtains better GD values other than comparison algorithms in high-dimensional experiments with M equaling 30 and 45, except in DTLZ3, 45 dimensions, where UMOPSO-D is sorted as the close second right after α-DEMO-revised but have lower standard deviation value. Furthermore, the statistical records show that UMOPSO-D is associated with poorer performance in DTLZ3 as compared to other DTLZs in all dimensions, with the relatively higher GD value from other comparison algorithms; this indicates the difficulty in searching the PF for DTLZ3. The PFs obtained by α-DEMO-revised and UMOPSO-D express good performance in general, while the UMOPSO-D works even better on the instance with more than 30 objectives. As a whole, on GD metric, UMOPSO-D together with the two recently proposed techniques, Gong and α-DEMO-revised, shares the good performance part in the comparisons of seven comparison algorithms.Secondly, the GD comparison between relevant decoupling and conflict decoupling in UMOPSO-D is illustrated as follows. Overall speaking, conflict decoupling has lower GD values in most situations, especially in DTLZ1 and DTLZ4. The differences between the two techniques in DTLZ2 and DTLZ3 are relatively small.The HV metrics of the simulations are shown in Table4. In DTLZ1, α-DEMO-revised and UMOSPO-D have relatively better performance. The differences among all comparisons, except MOPSO and MOPSO/D, are very small. It is indicated that UMOPSO-D greatly improves the performance of PSO-based algorithms in MaOP performance. In DTLZ2, UMOPSO-D with relevant decoupling has the highest scores. The average performance of MOEA/D is the second best. DTLZ3 expresses the worst HV performance, where MOPSO, MOPSO/D, NSGA-II, and MOEA/D obtain 0 or almost 0 because of the reason that nearly all solutions fall outside of the area defined by the reference point and decision space boundary. UMOPSO-D with conflict decoupling has obvious best HV score in DTLZ3 in all test dimensions. In DTLZ4, UMOPSO-D performs better when dimension is larger than 15, and MOEA/D and UMOPSO-D share the best result on HV metric. UMOPSO-D achieves the best values when dimension equals 30 and 45 (except in DTLZ1, M
=
30) and exhibits feasible values which are close to the optimums in 9 and 15 objectives. So it is reasonable to believe that UMOPSO-D performs better considering both convergence and diversity. The following good performances are provided by MOEA/D and α-DEMO-revised.Table 4
Comparisons of HV between proposed algorithm and other MOEAs.
Functions
MOPSO
MOPSO/D
NSGA-II
MOEA/D
Gong
DEMO
U
(
1
)
U
(
2
)
DTLZ1
Mean
7.800
E
-
03
5.226
E
-
02
7.428
E
-
01
8.310
E
-
01
7.562
E
-
01
8.956
E
-
01
8.862
E
-
01
9.617
E
-
01
M
=
9
Std.
1.351
E
-
02
8.272
E
-
02
2.540
E
-
02
1.609
E
-
01
2.465
E
-
03
1.540
E
-
03
5.465
E
-
02
1.296
E
-
02
DTLZ1
Mean
0.000
E
+
00
1.371
E
-
01
7.232
E
-
01
8.945
E
-
01
7.215
E
-
01
8.970
E
-
01
8.910
E
-
01
8.002
E
-
01
M
=
15
Std.
0.000
E
+
00
1.343
E
-
01
5.670
E
-
02
7.123
E
-
02
4.684
E
-
03
6.440
E
-
03
9.546
E
-
03
1.389
E
-
01
DTLZ1
Mean
0.000
E
+
00
2.543
E
-
01
7.094
E
-
01
7.135
E
-
01
7.155
E
-
01
7.896
E
-
01
7.596
E
-
01
7.783
E
-
01
M
=
30
Std.
0.000
E
+
00
1.744
E
-
01
5.250
E
-
03
6.945
E
-
02
1.346
E
-
03
5.423
E
-
02
5.642
E
-
03
3.769
E
-
02
DTLZ1
Mean
0.000
E
+
00
1.954
E
-
01
7.560
E
-
01
7.231
E
-
01
7.302
E
-
01
7.549
E
-
01
7.785
E
-
01
7.324
E
-
01
M
=
45
Std.
0.000
E
+
00
1.074
E
-
01
7.000
E
-
03
2.294
E
-
01
9.852
E
-
03
6.981
E
-
02
4.687
E
-
03
1.468
E
-
01
DTLZ2
Mean
5.602
E
-
01
4.879
E
-
01
2.834
E
-
01
9.335
E
-
01
8.991
E
-
01
6.563
E
-
01
7.846
E
-
01
9.022
E
-
01
M
=
9
Std.
5.065
E
-
02
2.392
E
-
02
3.800
E
-
03
4.544
E
-
02
5.460
E
-
03
5.460
E
-
03
9.450
E
-
03
4.318
E
-
02
DTLZ2
Mean
5.355
E
-
01
4.768
E
-
01
2.617
E
-
01
7.504
E
-
01
6.155
E
-
01
6.613
E
-
01
8.797
E
-
01
8.254
E
-
01
M
=
15
Std.
4.550
E
-
03
1.590
E
-
02
9.000
E
-
04
3.619
E
-
02
6.980
E
-
03
5.120
E
-
03
5.640
E
-
03
7.229
E
-
02
DTLZ2
Mean
3.906
E
-
01
4.909
E
-
01
4.434
E
-
01
7.299
E
-
01
6.531
E
-
01
5.457
E
-
01
8.989
E
-
01
5.652
E
-
01
M
=
30
Std.
1.555
E
-
02
1.926
E
-
02
2.850
E
-
02
5.813
E
-
02
5.468
E
-
01
3.460
E
-
03
4.120
E
-
03
8.940
E
-
02
DTLZ2
Mean
3.288
E
-
01
4.920
E
-
01
5.347
E
-
01
7.097
E
-
01
3.047
E
-
01
5.580
E
-
01
7.801
E
-
01
5.170
E
-
01
M
=
45
Std.
2.735
E
-
02
1.656
E
-
02
2.745
E
-
02
4.165
E
-
02
1.560
E
-
02
7.650
E
-
03
7.770
E
-
03
5.949
E
-
02
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
2.699
E
-
02
1.567
E
-
01
1.021
E
-
01
7.264
E
-
01
M
=
9
Std.
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
6.870
E
-
02
1.560
E
-
02
5.870
E
-
03
2.325
E
-
01
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
3.945
E
-
02
7.130
E
-
03
2.898
E
-
02
1.679
E
-
01
1.650
E
-
01
1.836
E
-
01
M
=
15
Std.
0.000
E
+
00
0.000
E
+
00
3.945
E
-
02
1.830
E
-
02
6.540
E
-
02
8.970
E
-
02
7.560
E
-
03
3.193
E
-
01
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
2.005
E
-
02
5.590
E
-
02
8.198
E
-
02
2.856
E
-
01
M
=
30
Std.
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
0.000
E
+
00
7.650
E
-
02
5.460
E
-
02
6.120
E
-
03
1.793
E
-
01
DTLZ3
Mean
0.000
E
+
00
0.000
E
+
00
2.069
E
-
01
1.210
E
-
03
1.984
E
-
02
4.897
E
-
02
5.469
E
-
02
2.953
E
-
01
M
=
45
Std.
0.000
E
+
00
0.000
E
+
00
1.630
E
-
01
2.440
E
-
03
8.680
E
-
03
5.460
E
-
03
1.560
E
-
03
2.391
E
-
01
DTLZ4
Mean
7.034
E
-
01
3.350
E
-
01
3.344
E
-
01
9.738
E
-
01
7.005
E
-
01
8.999
E
-
01
9.523
E
-
01
9.628
E
-
01
M
=
9
Std.
7.975
E
-
02
7.317
E
-
03
1.550
E
-
03
7.467
E
-
03
2.130
E
-
03
4.500
E
-
04
4.650
E
-
03
1.345
E
-
02
DTLZ4
Mean
7.780
E
-
01
3.562
E
-
01
3.199
E
-
01
9.898
E
-
01
7.995
E
-
01
9.857
E
-
01
9.957
E
-
01
9.962
E
-
01
M
=
15
Std.
3.940
E
-
02
2.222
E
-
02
1.300
E
-
03
5.261
E
-
03
2.300
E
-
04
4.520
E
-
03
1.110
E
-
03
2.907
E
-
03
DTLZ4
Mean
7.549
E
-
01
3.906
E
-
01
3.195
E
-
01
9.974
E
-
01
6.265
E
-
01
9.632
E
-
01
9.985
E
-
01
9.955
E
-
01
M
=
30
Std.
3.255
E
-
02
4.534
E
-
02
4.550
E
-
03
2.346
E
-
03
2.465
E
-
02
2.130
E
-
03
9.150
E
-
03
1.188
E
-
02
DTLZ4
Mean
7.713
E
-
01
4.049
E
-
01
3.928
E
-
01
9.183
E
-
01
5.156
E
-
01
9.131
E
-
01
9.458
E
-
01
9.864
E
-
01
M
=
45
Std.
1.905
E
-
02
3.170
E
-
02
1.299
E
-
01
7.658
E
-
04
4.750
E
-
03
5.780
E
-
03
1.450
E
-
03
5.094
E
-
02Furthermore, the HV metric indicates that the performance of relevant decoupling and conflict decoupling depends on the formulations of the given test instances. The conflict decoupling has obvious advantage in DTLZ3 but has relatively poor performance in DTLZ2. However, when taking GD into consideration, conflict decoupling has slight advantage compared to relevant decoupling.The ARE metrics of the simulations are shown in Table5. Under fixed objective dimension, the runtimes of different DTLZs are basically the same. The evaluation times are proportional to the POP sizes and number of iterations, so that there has been no difference among all DTLZ instances. The ARE scores, represented by DTLZ1 case, are displayed in Table 5. For the reason that MOPSO/D is inspired by MOPSO and MOEA/D, the AREs are omitted. According to the table, MOEA/D has the best efficiency among all algorithms, and NSGA-II is poorest. With reduced-dimension, α-DEMO-revised guarantees a lower complexity. UMOPSO-D and MOPSO have similar ARE value; however, the former has great advantages in convergence and diversity which have been proved above.Table 5
Comparisons of ARE between proposed algorithm and other MOEAs.
M
MOPSO
NSGA-II
MOEA/D
Gong
DEMO
UMOPSO-D
9
4.270
E
-
03
1.077
E
-
02
3.797
E
-
04
3.572
E
-
02
1.539
E
-
03
3.764
E
-
03
15
4.404
E
-
03
1.081
E
-
02
4.270
E
-
04
4.671
E
-
02
1.876
E
-
03
4.864
E
-
03
30
4.490
E
-
03
1.097
E
-
02
7.553
E
-
04
6.564
E
-
02
2.277
E
-
03
4.252
E
-
03
45
4.534
E
-
03
1.117
E
-
02
1.193
E
-
03
8.925
E
-
02
3.842
E
-
03
5.221
E
-
03Figure3 displays the convergence evolutionary curves evaluated by GD metric on DTLZ instances, 45 objectives among four well performed algorithms. The coupling method of UMOPSO-D in Figure 3 is relevant coupling. The GD curves illustrate that all the comparison algorithms are competent to further the convergence process and gradually get closer to the true PF with the generation. Note that UMOPSO-D shows poor performance at early iteration, which indicates the delayed reaction to the optimization problem. However, UMOPSO-D outperforms other algorithms in later generations. This finding can be explained by the decomposition and recomposition process which control the evolution reach optimum in several dimensions, and, with the coevolution continuing, more balanced subgroups cooperate and accelerate the convergence. Based on the results, UMOPSO-D is better than other algorithms on DTLZ1, DTLZ2, and DTLZ4 in high dimension situation and also performs a competitive result in DTLZ3.Figure 3
Performance curves on DTLZs in high dimension experiments.From the above statistical perspective and analysis, UMOPSO-D can guarantee a better or at least competitive performance in both convergence and diversity compared with the other six experimental algorithms in high-dimensional DTLZ problems. And conflict coupling has slight advantage compared to relevant coupling in objective decomposition. The computational efficiency is relatively low compared toα-DEMO-revised and MOEA/D.


## 7. Conclusion

MaOP is a challenge to most MOEAs; the loss of selection pressure results in poor convergence and diversity. In this paper, we introduce the decomposition-based unified evolutionary algorithm and merge it with MOPSO, to improve the performance of convergence and diversity. The innovations include five points: (1) decomposing the many objectives with discrete decoupling; (2) making connections between subgroups through unified coevolutionary strategy; (3) adaptive factorμ based on the subgroup stability to adjust the coevolution process; (4) archive strategies which contain repository reconstruction and quantity maintenance; (5) novel local/global and personal best selection technique. The proposed algorithm consists of inner and outer evolutionary process loop to pursuit convergence and diversity, respectively. We have compared the performance of UMOPSO-D with that of a few MOEAs. The experimental results show the superior performance of UMOPSO-D in high dimension MaOPs.UMOPSO-D is an attempt to solve MaOPs through reduction without discarding information; in other words, the decomposition and coevolution process reserve the original demand and objectives, which guarantees the authenticity, integrity, and originality of the optimization problem. According to the no-free-lunch principle, the complexity and data size will pay for the good performance of UMOPSO-D, and the reaction speed is slow compared with some state-of-the-art algorithms. The further experiments and statistical analysis recording the performance of scaled or other benchmark problems should be continued. In addition, probability-based strategy and coevolution based multiagent structure can reduce and share computational cost which will be exploited to UMOPSO-D to achieve better quality in our following research.



---

*Source: 6761545-2016-12-26.xml*