# Multiobjective Particle Swarm Optimization Based on Cosine Distance Mechanism and Game Strategy

Authors: Nana Li; Yanmin Liu; Qijun Shi; Shihua Wang; Kangge Zou
Journal: Computational Intelligence and Neuroscience
 (2021)

---

## Abstract

The optimization problems are taking place at all times in actual lives. They are divided into single objective problems and multiobjective problems. Single objective optimization has only one objective function, while multiobjective optimization has multiple objective functions that generate the Pareto set. Therefore, to solve multiobjective problems is a challenging task. A multiobjective particle swarm optimization, which combined cosine distance measurement mechanism and novel game strategy, has been proposed in this article. The cosine distance measurement mechanism was adopted to update Pareto optimal set in the external archive. At the same time, the candidate set was established so that Pareto optimal set deleted from the external archive could be effectively replaced, which helped to maintain the size of the external archive and improved the convergence and diversity of the swarm. In order to strengthen the selection pressure of leader, this article combined with the game update mechanism, and a global leader selection strategy that integrates the game strategy including the cosine distance mechanism was proposed. In addition, mutation was used to maintain the diversity of the swarm and prevent the swarm from prematurely converging to the true Pareto front. The performance of the proposed competitive multiobjective particle swarm optimizer was verified by benchmark comparisons with several state-of-the-art multiobjective optimizer, including seven multiobjective particle swarm optimization algorithms and seven multiobjective evolutionary algorithms. Experimental results demonstrate the promising performance of the proposed algorithm in terms of optimization quality.


---

## Body

## 1. Introduction

In the field of engineering, aviation scheduling, optimal control, and others, most of the optimization problems are multiobjective optimization problems (MOPs) [1]. MOPs are different from single objective optimization problems. More objective functions need to be optimized, which have the characteristics of conflict or influence each other [2]. This means that it is impossible for all the objective function values to be optimal, in which the optimal solution for one objective function may be the worst solution for another objective. Therefore, a set of trade-off solutions, known as Pareto optimal set, is adopted to represent the best possible compromises among objectives in MOPs. The practical problems are considered to have the characteristics of high-dimensional nonlinearity and strong constraints, so classic optimization algorithms (conjugate gradient method [3], Newton method [4], simplex algorithm [5], etc.) can no longer solve MOPs effectively. With the development of science and technology, the emergence of intelligent control makes multiobjective optimization reach a more advanced stage. The method of optimal control conditions can take different paths. For example, the introduction of the deformable MEMS device in [6] has a positive effect on improving optimal control. In addition, the intelligent optimization algorithm, which belongs to the bionic algorithm, has also attracted the attention of researchers. Among them, the particle swarm optimization (PSO) algorithm [7], which has the advantages of simple operation, fast velocity, wide application range, and few setting parameters, has become the focus of more researchers.PSO derived from the simulation of complex adaptive systems which was an evolutionary computation method based on swarm intelligence was proposed by Kennedy and Eberhart in 1995. It was developed inspired by the social behavior of a swarm of animals like birds. In PSO, individuals were called particles and each particle represents a potential solution. The swarm consists of a group of particles flying through the search space searching for the optimal solution, like birds searching for food. Individuals called “particles” in PSO “flow” through the ultradimensional search space. The position change of particles in the search space was based on the individual’s social and psychological intention surpassing other individuals successfully. It could communicate with other individuals and change its structure and behavior according to the process of “learning” or “accumulating experience.” Therefore, changes in the velocity and position of particles will be affected by the experience of other particles.With the development of intelligent algorithms, the relative simplicity and the practical success of single objective optimizer have motivated researchers to extend the usages of PSO from the single objective optimization problems into MOPs. In 2002, Coello et al. extended PSO from a single objective to multiple objectives, which was used to solve MOPs for the first time [8]. In the research of multiobjective particle swarm optimization (MOPSOs), there are at least two fundamental issues to be addressed. The first issue is how to use a standard to select excellent global leader as the learning sample of all particles flight to guide other particles in the population. Due to the important influence of the leader in the search direction, the random selection of global learning samples in the external archives may lead the algorithm to be trapped into a local optimum. At present, most of MOPSOs based on dominance use the infinite external archive to store nondominated solutions, so the maintenance and update of the external archive are also very important. The second issue is how to balance convergence and diversity of the swarm. It is crucial to the performance of MOPSOs, because PSO-based multiobjective optimizations are very likely to be trapped into the local optimum (or one of many optima) of MOPs due to their fast convergence.In this article, a novel multiobjective particle swarm optimization based on cosine distance mechanism and game strategy was proposed, which was called GCDMOPSO. To maintain the update mechanism of the external archive, the cosine distance was used to delete the worst particles in the external archive. At the same time, the same number of particles was selected in the candidate set to supplement the deleted particles in the external archive to maintain the update of the external archive dynamically. The main contributions of this article were as follows:(1)
Dynamic maintenance of the external archive updates. After each iteration of the algorithm, the nondominated solutions selected from the candidate set were added to the external archive. When the number of nondominated solutions in the external archive exceeded the maximum size, the cosine distance was used to compare the degree of crowding of the nondominated solutions in the archive, and the most crowded solutions were deleted. Then, it could also identify the removed solutions and update the crowding degree of all solutions in the domain (i.e., after deleting the most crowded solutions, recalculate the cosine distance of all other solutions). This method achieves better diversity and preservation.(2)
The method by which the individual was selected. In the update process of this algorithm, the fitness value of each individual was calculated through nondominated sorting, which will generate individuals of the same ranking value. The individuals with the same ranking value were selected into the candidate set, and the Euclidean distance between each individual and the origin of the coordinate was calculated. Then the Euclidean distance from each individual to the coordinate origin was sorted in ascending order. In order to maintain the updating of external archive dynamically, when we delete the particles in the external archive, we need to put the same number of individuals into the archive.(3)
The selection of the global leader. Based on the recently developed competitive group optimizer and combined game mechanism, this article proposed a novel global leader selection strategy based on the game mechanism. Randomly select two nondominated solutions in the external archive, and compare the cosine distances of the two nondominated solutions, respectively. The winner was selected as the global leader, leading other particles to fly. We can keep all obtained solutions converging along the real Pareto front.The remaining part of this article is structured as follows. Section2 describes the related definitions of the MOPs and MOPSOs briefly, as well as the related works from which the main ideas are inspired for designing the new algorithm in this article. Then, the details of the proposed GCDMOPSO are described in Section 3. Section 4 is the experimental part of GCDMOPSO. GCDMOPSO is compared with some selected MOPSOs and MOEAs in this article. Finally, the conclusions are drawn in Section 5.


## 2. Background

### 2.1. MOPs

In this section, the definition of the fundamentals of the MOPs is presented. The mathematical forms of the MOPs are described as follows:(1)miny=Fx=f1x,f2x,…,fmxs.t.gix≥0,i=1,2,…,phjx=0,j=1,2,…,q,where x=x1,x2,…,xd,…,xd is the decision vector of D dimension, x∈X, and X is the decision space; xd_min≤xd≤xd_max, d = 1, 2, …, D; xd_max and xd_min are the upper and lower bounds of each dimension vector; y is the objective vector, y∈Y, and Y is the objective space; m is the total number of optimization objectives; gix≤0 is the i−th inequality constraint; hjx=0 is the i−th equality constraint. These two constraints determine the feasible region of the solution.MOPs are different from single objective problems, so the same problem-solving ideas cannot be adopted by the former. It is impossible for a certain solution of MOPs to achieve optimal results for all objectives at the same time, and different solutions cannot be compared due to different objective functions. Therefore, when solving a MOP, a set of solutions are usually obtained, and these solutions have different effects for different objective functions. The solutions in this set are called the nondominated solutions or Pareto optimal solutions. The following is a detailed introduction to the related concepts.Definition 1.
Pareto dominance,xu∈X, xv∈X, X are two feasible solutions of this MOP, and xv is dominant by comparison with xu, expressed as xv≺xu, if and only if(2)∀k∈1,2,…,m,fkxv≤fkxu∧∃l∈1,2,…,m,flxv<flxu.Definition 2.
For Pareto optimal,x∗∈X is the Pareto optimal solution on X, if and only if the following conditions are satisfied(3)¬∃x∈X:x≺x∗.
That is, there is no better solution thanx∗ in the set X, so x∗ is the optimal solution in X, which is also called nondominated solution or noninferior solution.Definition 3.
For Pareto optimal set, for the MOPs, the optimal solution set can be defined as follows:(4)p∗=x∈X|∃x′∈X,fkx,k=1,2,…,m.Definition 4.
For Pareto optimal front, the curved surface consisting of the objective function values corresponding to all Pareto optimal solutions in Pareto optimal solution set is called Pareto front:(5)PF=Fx∗=f1x∗,f2x∗,…,fmx∗|x∗∈p∗.


### 2.2. Multiobjective Particle Swarm Optimization

MOPSO is an improvement of PSO. In PSO, the individual birds in the population are abstracted as massless particles. Each particle has its own velocity and position. The position and velocity ofi particle are expressed as xi=xi1,xi2,…,xiD and vi=vi1,vi2,…,viD, respectively. Searching for food in N is the space, and food is considered as the optimal solution. Particles are updated according to the following formula:(6)vit+1=wvit+c1r1pbestit−xit+c2r2gbestit−xit,(7)xit+1=xit+vit+1.The right side of equation (6) consists of three parts. The first part is the inertia quantity, where w is the inertia weight. Its size determines how much the particle inherits to the current velocity. If the value of w is large, the overall search capability of the algorithm will be enhanced; if the value of w is small, the local search function of the algorithm will be improved. w is generally limited to a random number less than 1. The second part is the cognition of the individual, which represents the movement of the individual to the best position according to his historical flight experience. Among them, pbest represents he optimal position of the individual, r1 is a random number normally distributed in the interval (0, 1), and c1 is the learning factor, representing the degree of particles learning. The third part is the amount of social cognition, which leads to the amount of particles that move to the global optimal position. gbest represents the global optimal position, r2 is a random number normally distributed in the interval (0, 1), and c2 is the learning factor, where c1=c2=2 is usually taken. The coordination of these three parts determines the overall performance of the algorithm.With the deepening of research, many scholars have extended PSO to MOPSO, so that the algorithm is more suitable to solve MOPs. In MOPs, the number of the optimal solutions is not unique due to the increase of constrained objective. Combined with PSO, the difference of MOPSO is not only the selection of the historical optimal position and the global leader under multiple constraints but also the storage of the historical optimal position and the global leader. Therefore, MOPSOs used the external archive mechanism to solve storage problems and used the external archive to save the nondominated solutions generated during the search in the entire swarm. The nondominated solutions in the external archive are not dominated by any other particles in the external archive. Therefore, all nondominated solutions in the external archive should meet the two following requirements: (a) The nondominated solutions in the external archive collection do not have a mutual dominance relationship, and it is impossible to compare which of the nondominated solutions are better. (b) The introduced particles are stronger than the solutions in the original external archives, and the weaker solutions in the original external archives should be eliminated.


### 2.3. Existing MOPSOs

The first PSO variant was proposed by Coello et al. [9]. The authors incorporated the concept of Pareto advantage into the method of PSO. The local optima and the global optima in the swarm were determined by the Pareto dominance principle. For the first time, the secondary storage library (i.e., the external archive) was used to store the nondominated solutions obtained after each iteration. This was the first time that PSO has been used to solve MOPs. Compared with classic MOEAs such as NSGA-II [10] and PAES [11], the first MOPSO proposed was more competitive in solved MOPs, but it was unable to solve MOPs with complex landscapes. To address this issue, Sierra and Coello et al. [12] proposed an improved PSO-based multiobjective optimization, in which Pareto advantage and congestion factor were used to select a list of available leading solutions; and the swarm was divided into three subswarms simultaneously; then different mutation operators were suggested for different subswarms divided by users in advance. In addition, the experience of this algorithm used ε dominance to fix the size of the external archive. Experimental results show that the performance of the improved optimization on MOPs with multiple local fronts is more competitive.A speed-constrained MOPSO was proposed by Nebro et al., called SMPSO [13], in which the velocity of all particles was restricted in order to tackle MOPs with multimodal landscapes. The SMPSO allowed new effective particle positions to be generated when the velocities were too large. Other features of the SMPSO included polynomial mutation as turbulence factor and the external archive was comprised of nondominated solutions which were found during the search process. However, most of MOPSOs could not solve MOPs effectively due to the fact that velocities in such algorithms were too rapid.The above MOPSOs only used a single search strategy to update particle’s velocity. So, Lin et al. proposed a novel MOPSO based on multiple search strategies [14], which used a decomposition method to transform MOPs into a set of aggregation issues, and then allocated each particle accordingly to optimize each aggregation issue. This algorithm designed two search strategies to update the velocity of each particle. After that, all nondominated solutions visited by particles were preserved in an external archive, and the evolutionary search strategy was further executed to exchange useful information between them. These multiple search strategies enabled this novel MOPSO to handle various MOPs more effectively.In contrast to the MOPSOs where the global optimal solution is determined by dominance relations, Zhang and Li used the framework of MOEA/D [15] to try to embed the decomposition mechanism into the PSO-based multiobjective optimization for the first time and proposed a MOPSO by decomposing a MOP into a number of single objective optimization problems [16]. The algorithm used the PSO search method instead of the genetic operator. Later, an improved version of this multiobjective optimization called SDMOPSO [17] was proposed by Al Moubayed et al. In SDMOPSO, the global optima were only selected from the neighborhood of particles, and crowded files were used to preserve the diversity of swarm leaders. Dai et al. divided the solution space into multiple subspaces and retained only one optimal solution in each subspace so that the nondominated solutions can be evenly distributed. This MOPSO was based on object space decomposition [18]. Based on the decomposition method, Martłnez and Coello also proposed a version of multiobjective optimization called dMOPSO [19], in which the global leader was determined according to the scalar aggregation value. Moreover, a memory reinitializationstrategy was used when a particle reached a certain value. The main aim of this approach was to preserve diversity and to avoid trapping in local fronts. Although the improvement of this algorithm holds a lower computational cost than most of the other MOPSOs which often need to maintain an archive, it is difficult to converge to the true Pareto front when dealing with complex models.In 2020, Alkebsi and Du proposed a novel MOPSO. This algorithm was a novel archive update mechanism based on the nearest neighbor method, called MOPSONN [20]. In the early stage of this algorithm, the external archive was updated based on the nearby distance measurement. In later generations, two new rules were used, namely, the maximum cost rule and the cost sum rule, to update the archive. These two archive update strategies updated the nondominated solutions in the archives.In addition, a few scholars have improved the MOPSOs from the aspect of parameter setting to make the MOPSO more optimized [21]. In view of the effective analysis of the abovementioned existing algorithms, this article combined with the cosine distance update mechanism and the meshing strategy. A novel multiobjective game particle swarm optimization based on the cosine distance update mechanism was proposed, which effectively improves the convergence and diversity of solving MOPs. The following section describes the proposed algorithm in detail.


### 2.4. Acronyms in the GCDMOPSO

In order to read the article more clearly, a table of acronyms is listed in this article. The specific contents are shown in Table1.Table 1
List of acronyms.
AcronymsThe full name of an acronymMOPs [1]Multiobjective optimization problemsPSO [7]Particle swarm optimizationMOPSOsMultiobjective particle swarm optimization algorithmsMOEAsMultiobjective evolutionary algorithmsGCDMOPSOMultiobjective particle swarm optimization based on cosine distance mechanism and game strategyMOPSO [9]Handling multiple objectives with particle swarm optimizationNSGA-II [10]A fast and elitist multiobjective genetic algorithmPAES [11]Approximating the nondominated front using the Pareto archived evolution strategySMPSO [13]A new PSO-based metaheuristic for multiobjective optimizationMMOPSO [14]A novel multiobjective particle swarm optimization with multiple search strategiesMOEA/D [15]A multiobjective evolutionary algorithm based on decompositionSDMOPSO [17]A novel smart multiobjective particle swarm optimization using decompositiondMOPSO [19]A multiobjective particle swarm optimizer based on decompositionMOPSONN [20]A fast multiobjective particle swarm optimization algorithm based on a new archive updating mechanismIGD [22]Inverted generational distanceNMPSO [23]Particle swarm optimization with a balance able fitness estimation for many-objective optimization problemsMOPSOCD [24]An effective use of crowding distance in multiobjective particle swarm optimizationMPSO/D [18]A new multiobjective particle swarm optimization algorithm based on decompositionNSGA-III [25]An evolutionary many-objective optimization algorithm using reference point-based nondominated sorting approach, part I: solving problems with box constraintsMOEAIGDNS [26]A multiobjective evolutionary algorithm based on an enhanced inverted generational distance metricSPEAR [27]A strength Pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimizationSPEA2 [28]Improving the strength Pareto evolutionary algorithmIBEA [29]Indicator-based selection in multiobjective searchNThe population sizeMThe number of objectivesDDimension of the decision variableFEsThe maximum number of evaluationspcCrossover probabilitypmMutation probabilitySBXSimulated binary crossoverPMPolynomial-based mutationηcThe distribution indexes of SBXηmThe distribution indexes of PMFParameters set by the author in differential evolutionCRParameters set by the author in differential evolutiondivThe division network number of cellspbestPersonal best particlegbestGlobal best particle


## 2.1. MOPs

In this section, the definition of the fundamentals of the MOPs is presented. The mathematical forms of the MOPs are described as follows:(1)miny=Fx=f1x,f2x,…,fmxs.t.gix≥0,i=1,2,…,phjx=0,j=1,2,…,q,where x=x1,x2,…,xd,…,xd is the decision vector of D dimension, x∈X, and X is the decision space; xd_min≤xd≤xd_max, d = 1, 2, …, D; xd_max and xd_min are the upper and lower bounds of each dimension vector; y is the objective vector, y∈Y, and Y is the objective space; m is the total number of optimization objectives; gix≤0 is the i−th inequality constraint; hjx=0 is the i−th equality constraint. These two constraints determine the feasible region of the solution.MOPs are different from single objective problems, so the same problem-solving ideas cannot be adopted by the former. It is impossible for a certain solution of MOPs to achieve optimal results for all objectives at the same time, and different solutions cannot be compared due to different objective functions. Therefore, when solving a MOP, a set of solutions are usually obtained, and these solutions have different effects for different objective functions. The solutions in this set are called the nondominated solutions or Pareto optimal solutions. The following is a detailed introduction to the related concepts.Definition 1.
Pareto dominance,xu∈X, xv∈X, X are two feasible solutions of this MOP, and xv is dominant by comparison with xu, expressed as xv≺xu, if and only if(2)∀k∈1,2,…,m,fkxv≤fkxu∧∃l∈1,2,…,m,flxv<flxu.Definition 2.
For Pareto optimal,x∗∈X is the Pareto optimal solution on X, if and only if the following conditions are satisfied(3)¬∃x∈X:x≺x∗.
That is, there is no better solution thanx∗ in the set X, so x∗ is the optimal solution in X, which is also called nondominated solution or noninferior solution.Definition 3.
For Pareto optimal set, for the MOPs, the optimal solution set can be defined as follows:(4)p∗=x∈X|∃x′∈X,fkx,k=1,2,…,m.Definition 4.
For Pareto optimal front, the curved surface consisting of the objective function values corresponding to all Pareto optimal solutions in Pareto optimal solution set is called Pareto front:(5)PF=Fx∗=f1x∗,f2x∗,…,fmx∗|x∗∈p∗.


## 2.2. Multiobjective Particle Swarm Optimization

MOPSO is an improvement of PSO. In PSO, the individual birds in the population are abstracted as massless particles. Each particle has its own velocity and position. The position and velocity ofi particle are expressed as xi=xi1,xi2,…,xiD and vi=vi1,vi2,…,viD, respectively. Searching for food in N is the space, and food is considered as the optimal solution. Particles are updated according to the following formula:(6)vit+1=wvit+c1r1pbestit−xit+c2r2gbestit−xit,(7)xit+1=xit+vit+1.The right side of equation (6) consists of three parts. The first part is the inertia quantity, where w is the inertia weight. Its size determines how much the particle inherits to the current velocity. If the value of w is large, the overall search capability of the algorithm will be enhanced; if the value of w is small, the local search function of the algorithm will be improved. w is generally limited to a random number less than 1. The second part is the cognition of the individual, which represents the movement of the individual to the best position according to his historical flight experience. Among them, pbest represents he optimal position of the individual, r1 is a random number normally distributed in the interval (0, 1), and c1 is the learning factor, representing the degree of particles learning. The third part is the amount of social cognition, which leads to the amount of particles that move to the global optimal position. gbest represents the global optimal position, r2 is a random number normally distributed in the interval (0, 1), and c2 is the learning factor, where c1=c2=2 is usually taken. The coordination of these three parts determines the overall performance of the algorithm.With the deepening of research, many scholars have extended PSO to MOPSO, so that the algorithm is more suitable to solve MOPs. In MOPs, the number of the optimal solutions is not unique due to the increase of constrained objective. Combined with PSO, the difference of MOPSO is not only the selection of the historical optimal position and the global leader under multiple constraints but also the storage of the historical optimal position and the global leader. Therefore, MOPSOs used the external archive mechanism to solve storage problems and used the external archive to save the nondominated solutions generated during the search in the entire swarm. The nondominated solutions in the external archive are not dominated by any other particles in the external archive. Therefore, all nondominated solutions in the external archive should meet the two following requirements: (a) The nondominated solutions in the external archive collection do not have a mutual dominance relationship, and it is impossible to compare which of the nondominated solutions are better. (b) The introduced particles are stronger than the solutions in the original external archives, and the weaker solutions in the original external archives should be eliminated.


## 2.3. Existing MOPSOs

The first PSO variant was proposed by Coello et al. [9]. The authors incorporated the concept of Pareto advantage into the method of PSO. The local optima and the global optima in the swarm were determined by the Pareto dominance principle. For the first time, the secondary storage library (i.e., the external archive) was used to store the nondominated solutions obtained after each iteration. This was the first time that PSO has been used to solve MOPs. Compared with classic MOEAs such as NSGA-II [10] and PAES [11], the first MOPSO proposed was more competitive in solved MOPs, but it was unable to solve MOPs with complex landscapes. To address this issue, Sierra and Coello et al. [12] proposed an improved PSO-based multiobjective optimization, in which Pareto advantage and congestion factor were used to select a list of available leading solutions; and the swarm was divided into three subswarms simultaneously; then different mutation operators were suggested for different subswarms divided by users in advance. In addition, the experience of this algorithm used ε dominance to fix the size of the external archive. Experimental results show that the performance of the improved optimization on MOPs with multiple local fronts is more competitive.A speed-constrained MOPSO was proposed by Nebro et al., called SMPSO [13], in which the velocity of all particles was restricted in order to tackle MOPs with multimodal landscapes. The SMPSO allowed new effective particle positions to be generated when the velocities were too large. Other features of the SMPSO included polynomial mutation as turbulence factor and the external archive was comprised of nondominated solutions which were found during the search process. However, most of MOPSOs could not solve MOPs effectively due to the fact that velocities in such algorithms were too rapid.The above MOPSOs only used a single search strategy to update particle’s velocity. So, Lin et al. proposed a novel MOPSO based on multiple search strategies [14], which used a decomposition method to transform MOPs into a set of aggregation issues, and then allocated each particle accordingly to optimize each aggregation issue. This algorithm designed two search strategies to update the velocity of each particle. After that, all nondominated solutions visited by particles were preserved in an external archive, and the evolutionary search strategy was further executed to exchange useful information between them. These multiple search strategies enabled this novel MOPSO to handle various MOPs more effectively.In contrast to the MOPSOs where the global optimal solution is determined by dominance relations, Zhang and Li used the framework of MOEA/D [15] to try to embed the decomposition mechanism into the PSO-based multiobjective optimization for the first time and proposed a MOPSO by decomposing a MOP into a number of single objective optimization problems [16]. The algorithm used the PSO search method instead of the genetic operator. Later, an improved version of this multiobjective optimization called SDMOPSO [17] was proposed by Al Moubayed et al. In SDMOPSO, the global optima were only selected from the neighborhood of particles, and crowded files were used to preserve the diversity of swarm leaders. Dai et al. divided the solution space into multiple subspaces and retained only one optimal solution in each subspace so that the nondominated solutions can be evenly distributed. This MOPSO was based on object space decomposition [18]. Based on the decomposition method, Martłnez and Coello also proposed a version of multiobjective optimization called dMOPSO [19], in which the global leader was determined according to the scalar aggregation value. Moreover, a memory reinitializationstrategy was used when a particle reached a certain value. The main aim of this approach was to preserve diversity and to avoid trapping in local fronts. Although the improvement of this algorithm holds a lower computational cost than most of the other MOPSOs which often need to maintain an archive, it is difficult to converge to the true Pareto front when dealing with complex models.In 2020, Alkebsi and Du proposed a novel MOPSO. This algorithm was a novel archive update mechanism based on the nearest neighbor method, called MOPSONN [20]. In the early stage of this algorithm, the external archive was updated based on the nearby distance measurement. In later generations, two new rules were used, namely, the maximum cost rule and the cost sum rule, to update the archive. These two archive update strategies updated the nondominated solutions in the archives.In addition, a few scholars have improved the MOPSOs from the aspect of parameter setting to make the MOPSO more optimized [21]. In view of the effective analysis of the abovementioned existing algorithms, this article combined with the cosine distance update mechanism and the meshing strategy. A novel multiobjective game particle swarm optimization based on the cosine distance update mechanism was proposed, which effectively improves the convergence and diversity of solving MOPs. The following section describes the proposed algorithm in detail.


## 2.4. Acronyms in the GCDMOPSO

In order to read the article more clearly, a table of acronyms is listed in this article. The specific contents are shown in Table1.Table 1
List of acronyms.
AcronymsThe full name of an acronymMOPs [1]Multiobjective optimization problemsPSO [7]Particle swarm optimizationMOPSOsMultiobjective particle swarm optimization algorithmsMOEAsMultiobjective evolutionary algorithmsGCDMOPSOMultiobjective particle swarm optimization based on cosine distance mechanism and game strategyMOPSO [9]Handling multiple objectives with particle swarm optimizationNSGA-II [10]A fast and elitist multiobjective genetic algorithmPAES [11]Approximating the nondominated front using the Pareto archived evolution strategySMPSO [13]A new PSO-based metaheuristic for multiobjective optimizationMMOPSO [14]A novel multiobjective particle swarm optimization with multiple search strategiesMOEA/D [15]A multiobjective evolutionary algorithm based on decompositionSDMOPSO [17]A novel smart multiobjective particle swarm optimization using decompositiondMOPSO [19]A multiobjective particle swarm optimizer based on decompositionMOPSONN [20]A fast multiobjective particle swarm optimization algorithm based on a new archive updating mechanismIGD [22]Inverted generational distanceNMPSO [23]Particle swarm optimization with a balance able fitness estimation for many-objective optimization problemsMOPSOCD [24]An effective use of crowding distance in multiobjective particle swarm optimizationMPSO/D [18]A new multiobjective particle swarm optimization algorithm based on decompositionNSGA-III [25]An evolutionary many-objective optimization algorithm using reference point-based nondominated sorting approach, part I: solving problems with box constraintsMOEAIGDNS [26]A multiobjective evolutionary algorithm based on an enhanced inverted generational distance metricSPEAR [27]A strength Pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimizationSPEA2 [28]Improving the strength Pareto evolutionary algorithmIBEA [29]Indicator-based selection in multiobjective searchNThe population sizeMThe number of objectivesDDimension of the decision variableFEsThe maximum number of evaluationspcCrossover probabilitypmMutation probabilitySBXSimulated binary crossoverPMPolynomial-based mutationηcThe distribution indexes of SBXηmThe distribution indexes of PMFParameters set by the author in differential evolutionCRParameters set by the author in differential evolutiondivThe division network number of cellspbestPersonal best particlegbestGlobal best particle


## 3. The Proposed the GCDMOPSO

In this section, the details of our proposed GCDMOPSO are introduced. The algorithm generates a new population from all individuals initialized randomly. The particles of this population will generate many levels according to their dominance relationship. The first-level individuals generated by the nondominated relationship flow into the candidate set, and a new external file is further created. Then, based on the grid technology and the cosine distance strategy, the individuals introduced in the candidate set are screened to dynamically maintain the external archive. At the same time, the nondominated solutions in the external archives are screened through game strategy as the global leader to guide other individuals to fly. After that, this program updates the velocity and position of the group according to equations (6) and (7).


### 3.1. Selection of Introduced Particles

Any individual only chooses the appropriate type of talents as the learning object, and only the outstanding individuals will be selected into the external archives as leaders to lead other individuals to update and iterate. According to the previous MOPSOs, the program calculated the fitness value of each individual and randomly selected individuals with the same ranking value as candidate solutions to enter the external archive to guide other individuals to fly. Due to the fact that the fitness value was calculated to generate the first-level ranking value after the iterative update of the algorithm may have the same value, the random selection method in the previous algorithm could not better select the candidate solution. This article has improved it in this part. As shown in Figure1, in our algorithm, a candidate set is added. The fitness value of each individual is calculated, and the first-level individuals flow into the candidate set. At the same time, the candidate set is regarded as a grid, and the Euclidean distance from the fitness value of each individual to the origin of the coordinate is recalculated. Then the distance from each individual to the origin of the coordinate is sorted in ascending order, and individuals closer to the origin of the coordinates are selected into the external archive. If the nondominated solutions in the external archive do not reach the maximum size, all individuals in the candidate set are entered into the external archive according to the individual fitness ranking value, and they are stored; if the nondominated solutions in the external archive reach the maximum size, the individuals with the smaller cosine distance in the external archive will be eliminated.Figure 1
Schematic diagram of selecting introduced particles.In other words, in order to maintain the number of particles in the external archive mechanism at stable level, when a certain number of particles are deleted, the same number of particles will be added from the candidate set.


### 3.2. Maintenance and Update of External Archives

Archiving strategy is an important part of MOPSOs. Excellent maintenance capabilities can not only improve the search efficiency of the algorithm but also improve the convergence of the algorithm on the other hand. This article mainly adopts the external archive scheme to store the nondominated solutions generated during the entire iterative update. The maintenance principle of the external archive mainly uses the cosine distance measurement mechanism. The cosine distance measurement mechanism is usually used in the field of text classification. Since the text space and the multiobjective space are both multidimensional spaces, they have certain similarities at the same time. Therefore, the cosine distance measurement mechanism is applied to the multiobjective optimization. If a dimension is represented by a vector, the dimension of a vector can be regarded as a single objective. The cosine distance between objectives can be used to determine the density relationship between individuals.Definition 5.
For weight ratio, suppose that the population size isN and the objective function value of particle i is expressed as fi1x,fi2x,…,fikx,…,fimx. For the i−th particle, the weight ratio of the objective function value in the k dimension is as follows:(8)Wik=fikx∑i=0Nfikx.Definition 6.
For cosine distance, suppose that the objective vector of any particlei is expressed as di=Wi1,Wi2,…,Wik,…,Wim; according to the cosine formula, the cosine distance between two objectives is(9)CDdi,dj=1−cosdi,dj=1−∑k=1mWik×Wjk∑k=1mWik2×∑k=1mWjk2.
In this article, in order to better control the size of the external archive, the size of the external archive is set to 200. As shown in Figure2, the objective space is divided into k subregions. Then a subregion with highest density is selected, and the cosine distance between each nondominated solution in each subspace and its neighboring particles is compared. The smaller cosine distance between the nondominated solution and its neighboring particles, the greater the density of the nondominated solution and the poorer distribution.
The GCDMOPSO calculates the cosine distance between the nondominated solution and its neighbor particles according to Definitions5 and 6 and sorts the cosine distance in ascending order. Then, the nondominated solutions with minimum cosine distance, minimum angle, and maximum density are selected for dynamic deletion. In addition, only one nondominated solution is deleted. Then the cosine distances of other nondominated solutions are recalculated, and the nondominated solution with the smallest cosine distance is deleted. The solid black dots are the remaining nondominated solutions, and the hollow circles are the deleted individuals, with a deletion rate of 40%. At the same time, the same number of individuals is selected in the set of candidate solutions to supply the nondominated solutions deleted in the external archive to maintain the update of the external archive.
Leaders guiding the optimization process are an effective way to design MOPSOs. Among the many strategies currently available, the direction that prompts particles to explore some potential areas guides the search. The cosine distance strategy proposed in this article is quite different from the random strategy proposed in the past. Figure3 shows a schematic diagram of the comparison between the cosine distance strategy and the random strategy. First of all, all the evaluation indicators of the two strategies (ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, UF1–UF10) are run 30 times, respectively. The data of all evaluation indicators running 30 times are sorted in descending order into 30 levels. Then all the evaluation indicators of each level are averaged. The ordinate indicates the average of all evaluation indicators for each level, and the abscissa indicates that each strategy has been run 30 times. It can be seen from Figure 3 that, in the same level, the average of the cosine distance strategy is better than the average of the random strategy significantly, which fully illustrates the feasibility of the cosine distance strategy.
Figure4 shows that the GCDMOPSO used the cosine distance strategy to detect the evolution state. Taking ZDT1 as an example, it was compared to seven state-of-the-art MOPSOs and seven classic MOEAs on ZDT1. (a) shows the convergence trajectory of the GCDMOPSO and seven MOPSOs on ZDT1; (b) shows the convergence trajectory of the GCDMOPSO and seven MOEAs on ZDT1. The experimental results indicate the promising convergence speed of the proposed GCDMOPSO in comparison with the seven state-of-the-art MOPSOs and seven classic MOEAs on ZDT1.
As further observations, Figure5 presents the nondominated set associated with the best IGD value among 30 runs obtained by the GCDMOPSO, and then MOPSOs and MOEAs were compared on multiobjective DTLZ1. The nondominated sets were obtained by dMOPSO, MOPSO, NMPSO, SMPSO, MOPSOCD, MPSO/D, MMOPSO, NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, IBEA, and GCDMOPSO, respectively. The experimental results showed that the proposed GCDMOPSO outperforms the compared MOPSOs and MOEAs in terms of both convergence and diversity on multiobjective DTLZ1.Figure 2
Example diagram of nondominated archive deletion outside.Figure 3
Schematic diagram of comparison between random strategy and cosine distance strategy.Figure 4
Illustration for detecting the evolutionary state by the cosine distance strategy. (a) The convergence trajectory of MOPSOs on ZDT1. (b) The convergence trajectory of MOEAs comparison on ZDT1.
(a)(b)Figure 5
The nondominated set associated with the best IGD value among 30 runs obtained by the GCDMOPSO, and then compared MOPSOs and MOEAs on multiobjective DTLZ1.


### 3.3. Selection Strategy of Global Leader

In MOPSOs, each individual has location information and velocity information, as well as the characteristics of information exchange between individuals. These individuals can learn from the best position in history (pbest) and the best position in the world (gbest) and then their position and velocity are updated through equations (6) and (7) in Section 2 to produce a new generation of groups. The choice of the global optimal position (gbest) is closely related to the distribution of nondominated solutions. If few dense nondominated solutions are distributed in a certain area, the sparsely distributed particles are more likely to become the global optimal particles. In order to strengthen the selection pressure of gbest, it was combined with the game update mechanism. Thus, a novel global optimal selection strategy of the game strategy was proposed. The original game group optimizer theory divides the original population into two parts: game success and game failure. The failed part of the game strategy learns from the successful part of the game, and the population is updated iteratively on this basis. References for the specific game process can be found in [30]. The game strategy proposed in this article is different from the original game mechanism. In this article, the game is played in the external archive, and the particles to be updated are randomly selected from two individuals in the external archive. The winner of the game will become the leader, guiding the failed individuals to search for the optimal set, and the successful individuals will maintain the original speed and direction. The specific update process is shown in Figure 6.Figure 6
Game update strategy.The game individuals in this game strategy were elected through nondominated sorting and grid optimal distance. The success or failure of the game is determined according to the cosine distance between the game individuals. The winner of the game acts as the global optimal individual to guide other individuals in the population to fly. In each pair of games, the individuals to be updated randomly select two nondominated solutionsa and b from the external archive. The two nondominated solutions a and b are played through the cosine distance, and the game with a small cosine distance is successful. As shown in the pseudocode algorithm, the cosine distance between the nondominated solution a and individual k to be updated is small, so the nondominated solution a guides individual k to be updated to update the speed and position. The update formula is as follows:(10)vi′=c3vi+c4Xk−Xi,Xi′=Xi+vi′.In the above formula,c3 and c4 are randomly generated vectors between [0, 1], Xk is the position of the winner of the game, Xi is the current position of the particle, and vi is the current velocity of the particle.The whole process from selecting an external archive to comparing cosine distances is called game. Because the selected nondominated solution is random, the individual to be updated is not sure which guide will be selected in the end. The attributes of the leader will determine the effect of individual renewal, and the leader with better attributes will lead the update better. The effect of individual update depends on the leader entirely, so it is called game.


### 3.4. Steps of the GCDMOPSO

For MOPs, the objectives are mutually restricted. In MOPSOs, blindness is inevitable when controlling external archives and selecting the global optimum. This article proposes a novel strategy for external archive updates and global optimization. The main flow chart is shown in Figure7 and the main steps of GCDMOPSO are as follows:Step 1. The population was initialized, and acceleration constants c1 and c2 were set to guide other parameters.Step 2. The fitness value of each individual was calculated, and nondominated sorting was performed by comparing its fitness value during the current iteration with the best historical fitness value.Step 3. Whether the terminal conditions were met was determined. If met, output the results and terminate the algorithm. Otherwise, continue to the next step.Step 4. A candidate set was created. By calculating the Euclidean distance from the origin of the coordinates to each individual, individuals with a shorter Euclidean distance were selected into the external archive.Step 5. An external archive was created and the worst solution part of the external archive was deleted using the cosine distance measurement mechanism. At the same time, the candidate set was added as a storage mechanism for screened advantageous individuals’ mechanism.Step 6. The global optimal sample was selected. Using roulette and combining the game update mechanism, design a game strategy that incorporates the cosine distance measurement mechanism to select the global optimal sample.Step 7. According to formulas (6) and (7), update the position and velocity.Step 8. The fitness value of the current individuals was evaluated and ranked.Step 9. gencount = gencount + 1 was set; then move to step 3.Figure 7
Main flow chart of the GCDMOPSO.


## 3.1. Selection of Introduced Particles

Any individual only chooses the appropriate type of talents as the learning object, and only the outstanding individuals will be selected into the external archives as leaders to lead other individuals to update and iterate. According to the previous MOPSOs, the program calculated the fitness value of each individual and randomly selected individuals with the same ranking value as candidate solutions to enter the external archive to guide other individuals to fly. Due to the fact that the fitness value was calculated to generate the first-level ranking value after the iterative update of the algorithm may have the same value, the random selection method in the previous algorithm could not better select the candidate solution. This article has improved it in this part. As shown in Figure1, in our algorithm, a candidate set is added. The fitness value of each individual is calculated, and the first-level individuals flow into the candidate set. At the same time, the candidate set is regarded as a grid, and the Euclidean distance from the fitness value of each individual to the origin of the coordinate is recalculated. Then the distance from each individual to the origin of the coordinate is sorted in ascending order, and individuals closer to the origin of the coordinates are selected into the external archive. If the nondominated solutions in the external archive do not reach the maximum size, all individuals in the candidate set are entered into the external archive according to the individual fitness ranking value, and they are stored; if the nondominated solutions in the external archive reach the maximum size, the individuals with the smaller cosine distance in the external archive will be eliminated.Figure 1
Schematic diagram of selecting introduced particles.In other words, in order to maintain the number of particles in the external archive mechanism at stable level, when a certain number of particles are deleted, the same number of particles will be added from the candidate set.


## 3.2. Maintenance and Update of External Archives

Archiving strategy is an important part of MOPSOs. Excellent maintenance capabilities can not only improve the search efficiency of the algorithm but also improve the convergence of the algorithm on the other hand. This article mainly adopts the external archive scheme to store the nondominated solutions generated during the entire iterative update. The maintenance principle of the external archive mainly uses the cosine distance measurement mechanism. The cosine distance measurement mechanism is usually used in the field of text classification. Since the text space and the multiobjective space are both multidimensional spaces, they have certain similarities at the same time. Therefore, the cosine distance measurement mechanism is applied to the multiobjective optimization. If a dimension is represented by a vector, the dimension of a vector can be regarded as a single objective. The cosine distance between objectives can be used to determine the density relationship between individuals.Definition 5.
For weight ratio, suppose that the population size isN and the objective function value of particle i is expressed as fi1x,fi2x,…,fikx,…,fimx. For the i−th particle, the weight ratio of the objective function value in the k dimension is as follows:(8)Wik=fikx∑i=0Nfikx.Definition 6.
For cosine distance, suppose that the objective vector of any particlei is expressed as di=Wi1,Wi2,…,Wik,…,Wim; according to the cosine formula, the cosine distance between two objectives is(9)CDdi,dj=1−cosdi,dj=1−∑k=1mWik×Wjk∑k=1mWik2×∑k=1mWjk2.
In this article, in order to better control the size of the external archive, the size of the external archive is set to 200. As shown in Figure2, the objective space is divided into k subregions. Then a subregion with highest density is selected, and the cosine distance between each nondominated solution in each subspace and its neighboring particles is compared. The smaller cosine distance between the nondominated solution and its neighboring particles, the greater the density of the nondominated solution and the poorer distribution.
The GCDMOPSO calculates the cosine distance between the nondominated solution and its neighbor particles according to Definitions5 and 6 and sorts the cosine distance in ascending order. Then, the nondominated solutions with minimum cosine distance, minimum angle, and maximum density are selected for dynamic deletion. In addition, only one nondominated solution is deleted. Then the cosine distances of other nondominated solutions are recalculated, and the nondominated solution with the smallest cosine distance is deleted. The solid black dots are the remaining nondominated solutions, and the hollow circles are the deleted individuals, with a deletion rate of 40%. At the same time, the same number of individuals is selected in the set of candidate solutions to supply the nondominated solutions deleted in the external archive to maintain the update of the external archive.
Leaders guiding the optimization process are an effective way to design MOPSOs. Among the many strategies currently available, the direction that prompts particles to explore some potential areas guides the search. The cosine distance strategy proposed in this article is quite different from the random strategy proposed in the past. Figure3 shows a schematic diagram of the comparison between the cosine distance strategy and the random strategy. First of all, all the evaluation indicators of the two strategies (ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, UF1–UF10) are run 30 times, respectively. The data of all evaluation indicators running 30 times are sorted in descending order into 30 levels. Then all the evaluation indicators of each level are averaged. The ordinate indicates the average of all evaluation indicators for each level, and the abscissa indicates that each strategy has been run 30 times. It can be seen from Figure 3 that, in the same level, the average of the cosine distance strategy is better than the average of the random strategy significantly, which fully illustrates the feasibility of the cosine distance strategy.
Figure4 shows that the GCDMOPSO used the cosine distance strategy to detect the evolution state. Taking ZDT1 as an example, it was compared to seven state-of-the-art MOPSOs and seven classic MOEAs on ZDT1. (a) shows the convergence trajectory of the GCDMOPSO and seven MOPSOs on ZDT1; (b) shows the convergence trajectory of the GCDMOPSO and seven MOEAs on ZDT1. The experimental results indicate the promising convergence speed of the proposed GCDMOPSO in comparison with the seven state-of-the-art MOPSOs and seven classic MOEAs on ZDT1.
As further observations, Figure5 presents the nondominated set associated with the best IGD value among 30 runs obtained by the GCDMOPSO, and then MOPSOs and MOEAs were compared on multiobjective DTLZ1. The nondominated sets were obtained by dMOPSO, MOPSO, NMPSO, SMPSO, MOPSOCD, MPSO/D, MMOPSO, NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, IBEA, and GCDMOPSO, respectively. The experimental results showed that the proposed GCDMOPSO outperforms the compared MOPSOs and MOEAs in terms of both convergence and diversity on multiobjective DTLZ1.Figure 2
Example diagram of nondominated archive deletion outside.Figure 3
Schematic diagram of comparison between random strategy and cosine distance strategy.Figure 4
Illustration for detecting the evolutionary state by the cosine distance strategy. (a) The convergence trajectory of MOPSOs on ZDT1. (b) The convergence trajectory of MOEAs comparison on ZDT1.
(a)(b)Figure 5
The nondominated set associated with the best IGD value among 30 runs obtained by the GCDMOPSO, and then compared MOPSOs and MOEAs on multiobjective DTLZ1.


## 3.3. Selection Strategy of Global Leader

In MOPSOs, each individual has location information and velocity information, as well as the characteristics of information exchange between individuals. These individuals can learn from the best position in history (pbest) and the best position in the world (gbest) and then their position and velocity are updated through equations (6) and (7) in Section 2 to produce a new generation of groups. The choice of the global optimal position (gbest) is closely related to the distribution of nondominated solutions. If few dense nondominated solutions are distributed in a certain area, the sparsely distributed particles are more likely to become the global optimal particles. In order to strengthen the selection pressure of gbest, it was combined with the game update mechanism. Thus, a novel global optimal selection strategy of the game strategy was proposed. The original game group optimizer theory divides the original population into two parts: game success and game failure. The failed part of the game strategy learns from the successful part of the game, and the population is updated iteratively on this basis. References for the specific game process can be found in [30]. The game strategy proposed in this article is different from the original game mechanism. In this article, the game is played in the external archive, and the particles to be updated are randomly selected from two individuals in the external archive. The winner of the game will become the leader, guiding the failed individuals to search for the optimal set, and the successful individuals will maintain the original speed and direction. The specific update process is shown in Figure 6.Figure 6
Game update strategy.The game individuals in this game strategy were elected through nondominated sorting and grid optimal distance. The success or failure of the game is determined according to the cosine distance between the game individuals. The winner of the game acts as the global optimal individual to guide other individuals in the population to fly. In each pair of games, the individuals to be updated randomly select two nondominated solutionsa and b from the external archive. The two nondominated solutions a and b are played through the cosine distance, and the game with a small cosine distance is successful. As shown in the pseudocode algorithm, the cosine distance between the nondominated solution a and individual k to be updated is small, so the nondominated solution a guides individual k to be updated to update the speed and position. The update formula is as follows:(10)vi′=c3vi+c4Xk−Xi,Xi′=Xi+vi′.In the above formula,c3 and c4 are randomly generated vectors between [0, 1], Xk is the position of the winner of the game, Xi is the current position of the particle, and vi is the current velocity of the particle.The whole process from selecting an external archive to comparing cosine distances is called game. Because the selected nondominated solution is random, the individual to be updated is not sure which guide will be selected in the end. The attributes of the leader will determine the effect of individual renewal, and the leader with better attributes will lead the update better. The effect of individual update depends on the leader entirely, so it is called game.


## 3.4. Steps of the GCDMOPSO

For MOPs, the objectives are mutually restricted. In MOPSOs, blindness is inevitable when controlling external archives and selecting the global optimum. This article proposes a novel strategy for external archive updates and global optimization. The main flow chart is shown in Figure7 and the main steps of GCDMOPSO are as follows:Step 1. The population was initialized, and acceleration constants c1 and c2 were set to guide other parameters.Step 2. The fitness value of each individual was calculated, and nondominated sorting was performed by comparing its fitness value during the current iteration with the best historical fitness value.Step 3. Whether the terminal conditions were met was determined. If met, output the results and terminate the algorithm. Otherwise, continue to the next step.Step 4. A candidate set was created. By calculating the Euclidean distance from the origin of the coordinates to each individual, individuals with a shorter Euclidean distance were selected into the external archive.Step 5. An external archive was created and the worst solution part of the external archive was deleted using the cosine distance measurement mechanism. At the same time, the candidate set was added as a storage mechanism for screened advantageous individuals’ mechanism.Step 6. The global optimal sample was selected. Using roulette and combining the game update mechanism, design a game strategy that incorporates the cosine distance measurement mechanism to select the global optimal sample.Step 7. According to formulas (6) and (7), update the position and velocity.Step 8. The fitness value of the current individuals was evaluated and ranked.Step 9. gencount = gencount + 1 was set; then move to step 3.Figure 7
Main flow chart of the GCDMOPSO.


## 4. Experimental Study

### 4.1. Test Problems

Comprehensive and diverse test problems were employed in order to assess the performance of GCDMOPSO. First, the ZDT test problems were adopted. If there are only the ZDT series of test functions, they are impossible to show the superior performance of GCDMOPSO. Therefore, other more difficult MOPs, the UF test problems, are used based on complex characteristics. In order to further test the performance of GCDMOPSO in processing MOPs with three objectives, DTLZ1–DTLZ5 and UF8–UF10 test problems are used in this article. These test problems cover most of the challenges in this area, such as many local Pareto fronts, convergence deviations, concavities, and discontinuities. The relevant settings of these test problems are given in Table2.Table 2
Population size, number of objectives, dimensions, and the maximum number of evaluations of the chosen test problems.
ProblemsNMDFEsZDT1–ZDT320023010000ZDT4 and ZDT620021010000DTLZ12003710000DTLZ2–DTLZ520031210000UF1–UF720023010000UF8–UF1020033010000Among them,N represents size of the population; M represents the number of objectives; D represents dimension of the decision variable; FEs represents the maximum number of evaluations. For fair comparison, all relevant parameters of the comparison algorithm are set according to the suggestions in the original reference. The population size N of two objectives and three objectives of each algorithm is set to 200, and the maximum number of fitness evaluations is fixed to 10000. For ZDT1–ZDT3 and all UF test problems, 30 decision variables are used, ZDT4 and ZDT6 used 10 decision variables, DTLZ1 used 7 decision variables, and DTLZ2–DTLZ5 used 12 decision variables. For ZDT1–ZDT3 and all UF test problems, 30 decision variables are used, ZDT4 and ZDT6 used 10 decision variables, DTLZ1 used 7 decision variables, and DTLZ2–DTLZ5 used 12 decision variables. In order to draw statistical conclusions, the number of independent runs of each test experiment is set to 30. For detailed information about ZDT, UF, and DTLZ test problems, the reader is referred to [31–33], respectively.


### 4.2. Performance Measures

The goal of MOPs is to find a uniformly distributed set that is as close to the true Pareto fronts as possible. In order to compare with other algorithms, this article uses inverted generation distance (IGD) [22] to evaluate the performance of GCDMOPSO. It is believed that this performance index can not only explain the convergence effects of the algorithm but also explain the distribution of the final solution. The true Pareto front for computing IGD was downloaded from http://jmetal.sourceforge.net/problems.html.


### 4.3. Experimental Settings

In the experiment, in order to verify the performance of GCDMOPSO in a convincing way, it was compared with seven state-of-the-art MOPSOs (i.e., dMOPSO [19], MOPSO [9], NMPSO [23], SMPSO [13], MOPSOCD [24], MPSO/D [18], and MMOPSO [14]) and seven classic MOEAs (i.e., NSGA-II [10], NSGA-III [25], MOEA/D [15], MOEAIGDNS [26], SPEAR [27], SPEA2 [28], and IBEA [29]), respectively. For fair comparison, all relevant parameters in the comparison algorithm are set according to their original references, as shown in Table 3. pc and pm are crossover probability and mutation probability in Table 3, respectively; ηc and ηm are the distribution indexes of SBX and PM, respectively; F and CR are parameters set by the authors in differential evolution; T is the number of divisions in genetic algorithm; div is the division network number of cells; w, c1, and c2 are the parameters of the velocity update equation used in the MOPSOs. The population size N of two objectives and three objectives of each algorithm is set to 200, and the maximum number of fitness evaluations is fixed to 10000; the size of the external file is set to be the same as N. In order to draw a statistical conclusion, the number of independent runs of each test experiment is set to 30. The average and standard deviation (std) on IGD are collected in corresponding Tables 4 and 5 for performance comparison. In addition, in order to determine the statistical significance, a Wilcoxon rank-sum test was further carried out to test the statistical significance of the difference between the results obtained by GCDMOPSO and the results obtained by other algorithms at α = 0.05. All experimental results are obtained on PC with 2.3 GHz CPU and 8 GB memory. All source codes of these competing algorithms are provided in the platform PlatEMO [34].Table 3
Parameters settings of GCDMOPSO and all the compared algorithms.
AlgorithmsParameters setting1dMOPSO [19]w∈0.1,0.5,c1c2∈1.5,2.52MOPSO [9]w∈0.1,0.5,c1c2∈1.5,2.5,div=103SMPSO [13]w∈0.1,0.5,c1c2∈1.5,2.5,pm=1/n,ηm=204MOPSOCD [24]w∈0.1,0.5,c1c2∈1.5,2.55MPSO/D [18]w∈0.1,0.5,c1c2∈1.5,2.5,pc=0.9,F=0.5,CR=0.5,pm=1/n,ηm=206MMOPSO [14]w∈0.1,0.5,c1c2∈1.5,2.5,pc=0.9,pm=1/n,ηc=ηm=207NMPSO [23]w∈0.1,0.5,c1c2c3∈1.5,2.5,pm=1/n,ηc=ηm=208NSGA-II [10]pc=1.0,pm=1/n,ηc=ηm=209NSGA-III [25]pc=1.0,pm=1/n,ηc=ηm=2010MOEA/D [15]pc=1.0,pm=1/n,ηc=ηm=20,T=2011MOEAIGDNS [26]pc=1.0,pm=1/n,ηc=ηm=2012SPEAR [27]pc=1.0,pm=1/n,ηc=ηm=2013SPEA2 [28]pc=1.0,pm=1/n,ηc=ηm=2014IBEA [29]pc=1.0,pm=1/n,ηc=ηm=2015GCDMOPSOw=0.4,c1c2=2,div=50Table 4
IGD values of the proposed GCDMOPSO and seven MOPSOs on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 test problems.
ProblemsdMOPSOMOPSONMPSOSMPSOMOPSOCDMPSO/DMMOPSOGCDMOPSOZDT15.3199e − 2 (1.84e − 2)−1.2818e + 0 (1.61e − 1)−3.5090e − 2 (2.49e − 2)−7.8490e − 2 (8.12e − 2)−1.2410e − 2 (3.41e − 2)−1.0097e − 1 (3.75e − 2)−2.4320e − 3 (9.90e − 5)+5.5096e − 3 (5.47e − 4)ZDT24.0278e − 2 (1.65e − 2)−1.9587e + 0 (3.14e − 1)−3.2220e − 2 (5.23e − 2)−8.8623e − 2 (1.40e − 1)−1.3199e − 1 (2.20e − 1)−1.3635e − 1 (9.22e − 2)−1.8831e − 1 (2.43e − 1)−5.9683e − 3 (3.86e − 5)ZDT33.6856e − 2 (1.09e − 2) +7.9559e − 1 (1.88e − 1)−9.3162e − 2 (1.80e − 2)+1.9286e − 1 (8.21e − 2) =5.2211e − 2 (6.74e − 2)+1.9101e − 1 (5.42e − 2)=5.4929e − 3 (1.51e − 2)+2.0214e − 1 (4.10e − 3)ZDT45.6682e + 0 (6.02e + 0) −1.0959e + 1 (4.09e + 0)−1.5558e + 1 (6.00e + 0)−9.6916e + 0 (5.27e + 0) −1.9321e + 1 (9.00e + 0)−3.6610e + 1 (6.82e + 0)−6.4024e + 0 (3.87e + 0)−5.1106e − 3 (5.31e − 4)ZDT64.7132e − 3 (5.34e − 3)−2.6553e − 1 (7.51e − 1)−2.2710e − 3 (1.83e − 4)−1.9179e − 3 (6.27e − 5) =5.6155e − 3 (8.77e − 3)−1.7602e − 2 (1.00e − 2)−2.0980e − 3 (9.98e − 5)=1.9036e − 3 (2.19E − 4)DTLZ11.0110e + 1 (6.03e + 0) −1.1068e + 1 (3.98e + 0)−5.3123e + 0 (3.22e + 0)−3.7308e + 0 (3.56e + 0) −1.9868e + 1 (3.43e + 0)−1.0204e + 1 (2.84e + 0)−2.6475e + 0 (2.13e + 0)−3.1893e − 2 (1.60e − 3)DTLZ21.0357e − 1 (4.89e − 3)−9.9168e − 2 (1.83e − 2)−5.5695e − 2 (1.66e − 3)−6.2961e − 2 (5.67e − 3) +9.6187e − 2 (1.07e − 2)+4.5104e − 2 (1.27e − 3)+5.1981e − 2 (1.22e − 3)+1.3156e − 1 (1.24e − 2)DTLZ39.5459e + 1 (7.27e + 1) +1.8585e + 2 (4.40e + 1) =1.1797e + 2 (2.45e + 1) =4.2214e + 1 (4.28e + 1) +1.2284e + 2 (4.00e + 1)=1.4031e + 2 (1.58e + 1)=9.6313e + 1 (2.83e + 1) +1.2848e + 2 (4.16e + 1)DTLZ43.3629e − 1 (2.32e − 2)−3.5379e − 1 (1.02e − 1)−5.7723e − 2 (1.48e − 3)+4.0061e − 1 (1.22e − 1)−3.2468e − 1 (4.23e − 2)−1.3759e − 1 (3.72e − 2)=8.0754e − 2 (1.63e − 1)+2.1915e − 1 (5.23−2)DTLZ52.7069e − 2 (4.04e − 3) =7.3854e − 3 (1.46e − 3)+7.1965e − 3 (1.09e − 3)+3.5139e − 3 (3.37e − 4) +3.5753e − 2 (1.28e − 2)=5.5742e − 2 (6.20e − 3)−3.6474e − 3 (3.25e − 4)+3.0289e − 2 (5.98e − 3)UF16.6464e − 1 (7.81e − 2)−5.2791e − 1 (1.19e − 1)−1.3296e − 1 (5.34e − 2)=3.9727e − 1 (8.95e − 2)−6.5297e − 1 (1.48e − 1)−2.6644e − 1 (4.60e − 2)−1.2561e − 1 (6.35e − 2)=1.1136e − 1 (1.20e − 2)UF29.1522e − 2 (6.36e − 3)−1.0596e − 1 (1.30e − 2)−8.2356e − 2 (6.97e − 3)−1.0320e − 1 (1.21e − 2)−1.4038e − 1 (1.37e − 2)−1.1472e − 1 (6.45e − 3)−7.0445e − 2 (6.81e − 3)−5.7949e − 2 (6.63e − 3)UF35.7528e − 1 (2.11e − 2)−5.3232e − 1 (1.45e − 2)−6.1950e − 1 (4.55e − 2)−5.3918e − 1 (1.35e − 2)−6.6073e − 1 (4.87e − 2)−6.7669e − 1 (2.46e − 2)−5.6722e − 1 (1.45e − 2)−2.6948e − 1 (3.46e − 2)UF41.3762e − 1 (5.27e − 3)−1.1569e − 1 (1.17e − 2)−6.2625e − 2 (9.38e − 3)=1.1333e − 1 (7.72e − 3)−7.8445e − 2 (7.46e − 3)−9.7497e − 2 (5.79e − 3)−5.6336e − 2 (3.49e − 3)+6.9376e − 2 (1.27e − 2)UF53.3212e + 0 (2.49e − 1)−3.3737e + 0 (2.78e − 1)−1.6778e + 0 (5.00e − 1)−2.8624e + 0 (5.32e − 1)−3.7922e + 0 (3.91e − 1)−2.7759e + 0 (2.63e − 1)−1.5025e + 0 (3.04e − 1)=1.3195e + 0 (2.50e − 1)UF62.1692e + 0 (5.25e − 1)−2.4512e + 0 (4.97e − 1)−6.9450e − 1 (1.55e − 1)−1.3552e + 0 (3.86e − 1)−2.8954e + 0 (5.38e − 1)−1.4377e + 0 (2.33e − 1)−5.7258e − 1 (1.09e − 1)=5.7057e − 1 (1.33e − 1)UF73.7871e − 1 (6.98e − 2)−6.2837e − 1 (9.78e − 2)−1.8881e − 1 (1.44e − 1)−3.5724e − 1 (1.15e − 1)−6.0699e − 1 (1.35e − 1)−2.5060e − 1 (7.27e − 2)−1.1800e − 1 (8.76e − 2)−6.6068e − 2 (9.87e − 3)UF83.4764e − 1 (4.67e − 2) =4.2142e − 1 (3.93e − 2)−4.7503e − 1 (1.03e − 1)−3.9131e − 1 (4.44e − 2) =8.7353e − 1 (1.71e − 1)−5.5120e − 1 (5.13e − 2)−2.6889e − 1 (1.21e − 2)=3.8469e − 1 (7.12e − 2)UF95.8445e − 1 (3.75e − 2)−5.5568e − 1 (4.36e − 2)−4.7656e − 1 (6.25e − 2)−5.7107e − 1 (3.58e − 2)−8.6673e − 1 (1.19e − 1)−6.5999e − 1 (3.74e − 2)−4.3376e − 1 (5.09e − 2)−1.5833e − 1 (4.39e − 2)UF109.3743e − 1 (4.31e − 2)−2.2931e + 0 (3.26e − 1)−1.5264e + 0 (3.37e − 1)−2.7945e + 0 (4.45e − 1)−4.8780e + 0 (7.67e − 1)−4.1813e + 0 (3.21e − 1)−1.2502e + 0 (3.77e − 1)−3.7067e − 1 (7.55e − 2)+/−/=2/16/21/18/13/14/33/14/33/16/11/16/36/8/6—Best/all0/200/201/202/200/201/204/2012/20Table 5
IGD values of the proposed GCDMOPSO and seven MOEAs on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 test problems.
ProblemsNSGA-IINSGA-IIIMOEA/DMOEAIGDNSSPEARSPEA2IBEAGCDMOPSOZDT11.3351e − 2 (2.24e − 3)−1.0794e − 1 (1.64e − 2)−1.4869e − 1 (7.18e − 2)−8.0204e − 2 (1.34e − 2)−1.8544e − 1 (4.17e − 2)−4.5791e − 2 (1.02e − 2)−3.0575e − 2 (6.09e − 3)−5.5096e − 3 (5.47e − 4)ZDT23.7065e − 2 (5.67e − 2)−2.0316e − 1 (4.74e − 2)−5.1303e − 1 (1.03e − 1)−1.5661e − 1 (2.61e − 2)−4.0898e − 1 (1.29e − 1)−7.5782e − 2 (1.76e − 2)−4.5806e − 1 (2.25e − 1)−5.9683e − 3 (1.00e − 3)ZDT31.4048e − 2 (9.19e − 3)+9.3239e − 2 (1.33e − 2)+1.5966e − 1 (4.04e − 2)=6.5803e − 2 (1.32e − 2)+1.5273e − 1 (1.70e − 2)=3.8329e − 2 (9.18e − 3)+2.4122e − 2 (5.68e − 3)+2.0214e − 1 (4.10e − 3)ZDT49.1119e − 1 (3.95e − 1)−2.7254e + 0 (9.71e − 1)−4.7901e − 1 (1.92e − 1)−1.9498e + 0 (8.48e − 1)−1.9591e + 0 (6.21e − 1)−8.7718e − 1 (4.89e − 1)−1.6959e + 0 (5.78e − 1)−5.1106e − 3 (5.31e − 4)ZDT65.7138e − 1 (1.55e − 1)−1.5068e + 0 (3.09e − 1)−8.9624e − 2 (3.52e − 2)−1.2194e + 0 (2.58e − 1)−1.1220e + 0 (2.14e − 1)−5.8304e − 1 (1.80e − 1)−4.0693e − 1 (1.37e − 1)−1.9036e − 3 (2.19E − 4)DTLZ11.9064e − 1 (2.17e − 1)−8.7852e − 1 (3.52e − 1)−4.0238e − 1 (5.09e − 1)−7.5255e − 1 (2.57e − 1)−8.5648e − 1 (3.23e − 1)−3.7942e − 1 (2.38e − 1)−2.5592e − 1 (2.18e − 1)−3.1893e − 2 (1.60e − 3)DTLZ25.0991e − 2 (1.25e − 3)+4.0110e − 2 (6.49e − 4)+3.9672e − 2 (8.95e − 4)+4.3567e − 2 (1.45e − 3)+4.2995e − 2 (1.69e − 3)+3.9796e − 2 (5.62e − 4)+6.0008e − 2 (1.88e − 3)+1.3156e − 1 (1.24e − 2)DTLZ31.5011e + 1 (5.61e + 0) +3.3597e + 1 (7.77e + 0)+1.9932e + 1 (1.05e + 1)+3.0896e + 1 (8.95e + 0)+3.5538e + 1 (8.93e + 0)+1.4161e + 1 (4.45e + 0)+1.1652e + 1 (4.42e + 0) +1.2848e + 2 (4.16e + 1)DTLZ46.7625e − 2 (8.95e − 2)+5.7588e − 2 (9.14e − 2)=3.7432e − 1 (3.48e − 1)=6.0124e − 2 (9.09e − 2)+4.4537e − 2 (1.19e − 3)+7.4018e − 2 (1.27e − 1)+5.8439e − 2 (1.48e − 3)+2.1915e − 1 (5.23−2)DTLZ53.9962e − 3 (2.48e − 4)+7.1312e − 3 (9.16e − 4)+2.0348e − 2 (6.23e − 4)+5.6171e − 3 (7.32e − 4)+2.2074e − 2 (1.56e − 3)=4.5566e − 3 (5.73e − 4)+1.1354e − 2 (9.22e − 4)+3.0289e − 2 (5.98e − 3)UF11.1632e − 1 (2.49e − 2)−1.4092e − 1 (4.21e − 2)−3.3299e − 1 (1.01e − 1)−1.1721e − 1 (2.51e − 2)−1.3790e − 1 (2.30e − 2)−1.2188e − 1 (3.16e − 2)−1.2150e − 1 (2.75e − 2)−1.1136e − 1 (1.20e − 2)UF26.5645e − 2 (6.00e − 3)−8.0437e − 2 (5.54e − 3)−1.8876e − 1 (6.80e − 2)−7.5721e − 2 (4.95e − 3)−7.0807e − 2 (8.07e − 3)−6.8572e − 2 (6.20e − 3)−6.5305e − 2 (6.26e − 3)−5.7949e − 2 (6.63e − 3)UF34.3498e − 1 (2.51e − 2)−4.7938e − 1 (1.13e − 2)−3.3698e − 1 (2.81e − 2)−4.6226e − 1 (8.68e − 3)−4.2464e − 1 (1.60e − 2)−4.4909e − 1 (1.74e − 2)−4.3557e − 1 (2.52e − 2)−2.6948e − 1 (3.46e − 2)UF48.0553e − 2 (3.46e − 3)−9.4935e − 2 (3.23e − 3)−1.1790e − 1 (5.10e − 3)−8.8455e − 2 (2.99e − 3)−8.5693e − 2 (2.53e − 3)−8.0996e − 2 (2.55e − 3)−8.0710e − 2 (2.88e − 3)−6.9376e − 2 (1.27e − 2)UF57.8265e − 1 (2.68e − 1)+1.6238e + 0 (3.91e − 1)−1.3193e + 0 (2.96e − 1)=1.0254e + 0 (2.49e − 1)=1.2043e + 0 (2.25e − 1)=9.3783e − 1 (2.90e − 1)+7.4200e − 1 (1.62e − 1)+1.3195e + 0 (2.50e − 1)UF65.3210e − 1 (8.41e − 2)=7.8385e − 1 (1.85e − 1)−5.9812e − 1 (2.41e − 1)−6.0366e − 1 (1.20e − 1)−6.8918e − 1 (1.02e − 1)−5.1892e − 1 (8.12e − 2)=5.1057e − 1 (9.97e − 2)=5.7057e − 1 (1.33e − 1)UF71.7024e − 1 (9.95e − 2)−1.7604e − 1 (6.34e − 2)−4.6220e − 1 (1.73e − 1)−2.1070e − 1 (9.19e − 2)−1.8685e − 1 (7.08e − 2)−1.5383e − 1 (9.99e − 2)−1.4710e − 1 (7.88e − 2)−6.6068e − 2 (9.87e − 3)UF83.1419e − 1 (3.67e − 2)=3.3684e − 1 (3.82e − 2)=5.7398e − 1 (2.50e − 1)−3.7209e − 1 (4.31e − 2)=3.1745e − 1 (2.05e − 2)+3.0404e − 1 (3.44e − 2)+3.7170e − 1 (5.25e − 2)=3.8469e − 1 (7.12e − 2)UF94.3302e − 1 (5.11e − 2)−4.9207e − 1 (4.63e − 2)−5.0362e − 1 (9.59e − 2)−4.9717e − 1 (5.14e − 2)−4.7406e − 1 (5.61e − 2)−4.4935e − 1 (5.18e − 2)−4.0120e − 1 (6.62e − 2)−1.5833e − 1 (4.39e − 2)UF101.3928e + 0 (4.05e − 1)−2.4384e + 0 (4.75e − 1)−7.1987e − 1 (8.22e − 2)−1.5321e + 0 (3.69e − 1)−2.0141e + 0 (4.27e − 1)−1.4443e + 0 (5.10e − 1)−1.0332e + 0 (3.23e − 1)−3.7067e − 1 (7.55e − 2)+/−/=6/12/24/14/23/14/35/13/24/13/37/12/16/12/2—Best/all2/200/201/200/201/201/203/2012/20


### 4.4. Comparisons of GCDMOPSO with Seven State-of-the-Art MOPSOs

In GCDMOPSO, seven MOPSOs and seven MOEAs are selected, and the program runs the average and standard deviation of the IGD values on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 in Table4. Moreover, the Wilcoxon rank-sum test is adopted at a significance level of 0.05, where the symbols “+,” “−,” and “=” in the last row of the tables indicate that the result is significantly better than, significantly worse than, and statistically similar to that obtained by GCDMOPSO, respectively. The best average for each test instance is shown in bold.It can be directly observed that the performance of the proposed GCDMOPSO is significantly better than the existing seven compared MOPSOs in terms of benchmark testing, that is, dMOPSO, MOPSO, NMPSO, SMPSO, MOPSOCD, MPSO/D, and MMOPSO. Of all 20 test instances, GCDMOPSO achieved statistically significantly better IGD values on 12 test instances which were far greater than those of the competing MOPSOs. For example, the numbers of optimal IGD values for dMOPSO, MOPSO, and MOPSOCD are zero, the number of optimal IGD values for MPSO/D is one, the numbers of optimal IGD values for NMPSO and SMPSO are two, and MMOPSO has five optimal IGD values.For two-objective ZDT2, ZDT4, and ZDT6, the proposed GCDMOPSO can obtain a set of nondominant solutions, which can approximate the entire Pareto front well and maintain a good distribution. For the three-objective DTLZ1, the proposed GCDMOPSO can still achieve competitive performance, but, on the three-objective DTLZ2–DTLZ5, the performance of GCDMOPSO does not seem to be so ideal. It is worth noting that MMOPSO performed best on the two-objective ZDT1 and ZDT3, due to the fact that it has adopted the crossover and mutation operators in MOEAs in addition to the updating strategies of PSO. In UF1–UF10, the performance is far better than those of other comparison algorithms. Generally speaking, compared with the existing MOPSOs, the proposed GCDMOPSO proves the overall best performance. At the same time, when different algorithms are run independently 30 times, the partial statistical block diagram of the evaluation index IGD of GCDMOPSO algorithm and the comparison algorithm is shown in Figure8 (1, 2, 3, 4, 5, 6, 7, and 8 represent dMOPSO, MOPSO, NMPSO, SMPSO, MOPSOCD, MPSO/D, MMOPSO, and GCDMOPSO, respectively). As shown in Figure 8, GCDMOPSO recorded the minimum values on ZDT2, ZDT4, ZDT6, DTLZ1, UF1–UF3, UF5–UF7, and UF9-UF10. It can be clearly seen from Figure 8 that GCDMOPSO can obtain better nondominated solutions compared with other MOPSOs. The results are consistent with the qualitative analysis in Table 4.Figure 8
Statistical boxplot of IGD indicator of different MOPSOs and statistical boxplot of IGD indicator of different MOPSOs on ZDT2, ZDT4, ZDT6, DTLZ1, UF1–UF3, UF5–UF7, and UF9-UF10 problems, respectively.From the above empirical results, we can conclude that, compared with the existing MOPSOs, GCDMOPSO has application prospects in solving PSO.


### 4.5. Comparisons of GCDMOPSO with Seven Competitive MOEAs

Table5 presents the mean and standard deviation of IGD values of NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, and IBEA on ZDT1 to ZDT4 and ZDT6, DTLZ1 to DTLZ5, and UF1 to UF10, where the Wilcoxon rank-sum test is also adopted and the best mean for each test instance is shown in bold. It can be observed that the performance of the proposed GCDMOPSO is significantly better than those of the seven compared MOEAs (i.e., NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, and IBEA) in terms of benchmark testing. According to the results, there are 12 test cases with statistically significant best performance among 20 test examples.For two-objective ZDT1-ZDT2, ZDT4, and ZDT6, UF1–UF4, and UF7, GCDMOPSO performs best compared to the seven algorithms. For example, the numbers of optimal IGD values for NSGA-III and MOEAIGDNS are zero, the numbers of optimal IGD values for MOEA/D, SPEAR, and SPEA2 are one, the number of optimal IGD values for NSGA-II is three, and IBEA has four best IGD values. For the three-objective DTLZ series, compared MOEAs are obviously better than GCDMOPSO, and this is because genetic factors are more suitable for solving MOPs with local frontiers. Therefore, in the existing MOPs, more researchers suggest the main reason for using genetic factors.At the same time, when different algorithms are run independently 30 times, the partial statistical block diagram of the evaluation index IGD of the GCDMOPSO and the comparison algorithm is shown in Figure9 (1, 2, 3, 4, 5, 6, 7, and 8 represent NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, IBEA, and GCDMOPSO, respectively). As shown in Figure 9, GCDMOPSO recorded the minimum values on ZDT1, ZDT2, ZDT4, ZDT6, DTLZ1, UF1 to UF4, UF7, UF9, and UF10. It can be clearly seen from Figure 9 that GCDMOPSO can obtain best nondominated solutions compared with other MOEAs. The results are consistent with the qualitative analysis in Table 5.Figure 9
Statistical boxplot of IGD indicator of different MOEAs and statistical boxplot of IGD indicator of different MOEAs on ZDT1-ZDT2, ZDT4, ZDT6, DTLZ1, UF1–UF4, UF7, and UF9-UF10 problems, respectively.From the above empirical results, we can conclude that, compared with the existing MOEAs, GCDMOPSO has application prospects in solving PSO.


### 4.6. Complexity of the GCDMOPSO

The complexity of the proposed GCDMOPSO depends on the complexity of its components, that is, the complexity of game strategy and cosine distance. The following is the complexity analysis of GCDMOPSO.Suppose that the population size isN, where there are m nondominated individuals. In general, it is assumed that km≤k≤N games have been played. According to the game strategy, an individual will be eliminated after each game. Therefore, a total of k individuals were eliminated, including q0<q≤m dominated individuals and p0≤p<N−m nondominated individuals. After k times of games, N−k individuals become winners among the N individuals. For the convenience of analysis, assuming that, in each game, N−k dominated individuals have the same probability of being selected, after k games, there are(11)Tn=N−1+N−2−N−kk+N−3−2N−kk+⋯+N−k−k−1N−kk=N−1+N−kk2−N−kk+kN−kkk2+N−k=N−1k2+N−k12≤N2.The time complexity of the game strategy isTn=ON2. At the same time, in the process of updating the external archive of the game strategy, the calculation complexity of the cosine distance is OM×2Nlog22N. Then the total computational complexity is OM×N2, where M is the number of objectives.In addition, this article uses MATLAB functions (tic and toc) to calculate the runtime (unit: second) of each algorithm when the number of evaluations is 10000. It can be seen from Tables6 and 7 that even though GCDMOPSO uses the cosine distance measurement mechanism and the game strategy, the time complexity of GCDMOPSO and other comparison algorithms is on the same order of magnitude on functions ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10.Table 6
Runtime of different MOPSOs and GCDMOPSO on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 problems, respectively.
ProblemsFEsdMOPSOMOPSONMPSOSMPSOMOPSOCDMPSODMMOPSOGCDMOPSOZDT1100007.8676e − 13.1199e − 11.5439e + 13.0488e − 13.4421e − 11.8922e + 03.7923e − 14.2437e + 0ZDT2100006.8131e − 12.6821e − 11.1491e + 12.3180e − 13.7589e − 11.5781e + 03.1551e − 14.7586e + 0ZDT3100007.8204e − 12.6363e − 11.1106e + 12.3377e − 12.1194e − 11.5873e + 03.2188e − 13.2039e + 0ZDT4100008.7783e − 12.4611e − 12.2032e + 02.0048e − 11.7586e − 11.0354e + 02.4560e − 14.3560e + 0ZDT6100006.8091e − 12.9741e − 11.8178e + 12.0287e − 13.3332e − 11.2271e + 02.8039e − 14.3096e + 0DTLZ1100009.7676e − 12.5560e − 13.6316e + 01.9261e − 11.8182e − 12.1156e + 03.3008e − 12.7750e + 0DTLZ2100008.6479e − 15.5054e − 11.3995e + 13.4870e − 12.3072e − 12.0819e + 04.0736e − 13.1383e + 0DTLZ3100009.2875e − 12.4352e − 12.6860e + 02.1345e − 11.8944e − 12.1073e + 02.7857e − 11.5740e + 0DTLZ4100008.7179e − 13.3241e − 11.3662e + 12.5100e − 11.8809e − 11.4432e + 04.0681e − 10.8514e + 0DTLZ5100008.8027e − 14.6302e − 11.0695e + 13.5398e − 12.0460e − 11.4525e + 04.0731e − 11.7879e + 0UF1100008.3878e − 12.7608e − 12.2603e + 02.3215e − 12.1324e − 11.8870e + 03.2098e − 11.0027e + 0UF2100009.0479e − 12.9694e − 13.5757e + 02.5161e − 12.2116e − 11.9781e + 03.4488e − 11.7896e + 0UF3100008.4054e − 12.9903e − 15.4222e + 02.4683e − 12.2645e − 11.8899e + 03.6710e − 11.3945e + 0UF4100009.1935e − 12.7600e − 18.3688e + 02.4176e − 12.2351e − 12.0474e + 03.3159e − 11.7119e + 0UF5100009.3696e − 12.6467e − 12.1922e + 02.3675e − 12.1536e − 11.7893e + 03.3005e − 17.5826e − 1UF6100009.1887e − 12.7415e − 12.2196e + 02.4281e − 12.2226e − 11.7920e + 03.3701e − 18.5198e − 1UF7100007.7783e − 12.7314e − 12.2618e + 02.3713e − 12.1070e − 11.8708e + 03.1525e − 18.7601e − 1UF8100007.6917e − 13.9688e − 16.0293e + 03.2237e − 12.1981e − 11.5660e + 03.9585e − 12.0080e + 0UF9100008.0635e − 14.1594e − 14.4678e + 03.2879e − 12.2249e − 11.6600e + 03.9587e − 11.8525e + 0UF10100007.1560e − 13.3209e − 12.6416e + 02.5976e − 12.2396e − 11.6415e + 03.5417e − 11.1690e + 0Table 7
Runtime of different MOEAs and GCDMOPSO on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 problems, respectively.
ProblemsFEsNSGA-IINSGA-IIIMOEADMOEAIGDNSSPEA2SPEARIBEAGCDMOPSOZDT1100003.4758e − 15.3468e − 13.4007e + 06.4332e − 18.0079e + 08.6639e + 01.0740e + 14.2437e + 0ZDT2100006.7123e − 14.8913e − 13.3432e + 03.6390e − 17.9921e + 08.5811e + 01.0624e + 14.7586e + 0ZDT3100002.4592e − 14.3497e − 13.3789e + 06.4406e − 18.0529e + 08.6078e + 01.0731e + 13.2039e + 0ZDT4100003.5868e − 16.3845e − 13.2340e + 03.6940e − 18.1632e + 08.5680e + 01.0601e + 14.3560e + 0ZDT6100002.7101e − 14.3891e − 13.2598e + 03.0581e − 18.0220e + 08.6345e + 01.0646e + 14.3096e + 0DTLZ1100002.9300e − 15.3163e − 13.3872e + 04.5224e − 18.1141e + 08.3389e + 01.0676e + 12.7750e + 0DTLZ2100003.2915e − 18.2367e − 13.3891e + 04.6041e + 11.4410e + 18.9867e + 01.2031e + 13.1383e + 0DTLZ3100003.3083e − 15.3091e − 13.6684e + 04.5267e − 18.6110e + 09.2516e + 01.2214e + 11.5740e + 0DTLZ4100003.6689e − 16.9115e − 13.7662e + 04.0429e + 11.4007e + 18.9418e + 01.1746e + 10.8514e + 0DTLZ5100003.6991e − 17.7597e − 13.7441e + 01.5471e + 11.1243e + 18.9396e + 01.1829e + 11.7879e + 0UF1100003.1563e − 14.9168e − 13.9203e + 04.7115e − 19.1414e + 09.5004e + 01.2108e + 11.0027e + 0UF2100002.8833e − 14.9032e − 14.0969e + 08.5106e − 19.1164e + 09.5507e + 01.2087e + 11.7896e + 0UF3100003.2962e − 15.1931e − 14.0620e + 05.5841e − 19.1166e + 09.6254e + 01.2138e + 11.3945e + 0UF4100002.9796e − 15.5766e − 14.0546e + 01.0266e + 09.0826e + 09.6639e + 01.1300e + 11.7119e + 0UF5100003.0116e − 15.8167e − 13.9241e + 03.7765e − 18.7468e + 09.1719e + 01.2134e + 17.5826e − 1UF6100003.1538e − 15.4860e − 13.8002e + 04.0976e − 18.7895e + 09.3935e + 01.1596e + 18.5198e − 1UF7100002.8455e − 15.3397e − 13.7370e + 04.2447e − 18.6857e + 09.3448e + 01.1451e + 18.7601e − 1UF8100003.5545e − 16.8885e − 13.6264e + 01.8384e + 08.6025e + 09.2178e + 01.1520e + 12.0080e + 0UF9100003.5060e − 16.9686e − 14.2788e + 01.3978e + 08.6964e + 09.0618e + 01.1917e + 11.8525e + 0UF10100003.4883e − 16.7182e − 14.2034e + 01.0353e + 08.7814e + 09.1103e + 01.1806e + 11.1690e + 0


## 4.1. Test Problems

Comprehensive and diverse test problems were employed in order to assess the performance of GCDMOPSO. First, the ZDT test problems were adopted. If there are only the ZDT series of test functions, they are impossible to show the superior performance of GCDMOPSO. Therefore, other more difficult MOPs, the UF test problems, are used based on complex characteristics. In order to further test the performance of GCDMOPSO in processing MOPs with three objectives, DTLZ1–DTLZ5 and UF8–UF10 test problems are used in this article. These test problems cover most of the challenges in this area, such as many local Pareto fronts, convergence deviations, concavities, and discontinuities. The relevant settings of these test problems are given in Table2.Table 2
Population size, number of objectives, dimensions, and the maximum number of evaluations of the chosen test problems.
ProblemsNMDFEsZDT1–ZDT320023010000ZDT4 and ZDT620021010000DTLZ12003710000DTLZ2–DTLZ520031210000UF1–UF720023010000UF8–UF1020033010000Among them,N represents size of the population; M represents the number of objectives; D represents dimension of the decision variable; FEs represents the maximum number of evaluations. For fair comparison, all relevant parameters of the comparison algorithm are set according to the suggestions in the original reference. The population size N of two objectives and three objectives of each algorithm is set to 200, and the maximum number of fitness evaluations is fixed to 10000. For ZDT1–ZDT3 and all UF test problems, 30 decision variables are used, ZDT4 and ZDT6 used 10 decision variables, DTLZ1 used 7 decision variables, and DTLZ2–DTLZ5 used 12 decision variables. For ZDT1–ZDT3 and all UF test problems, 30 decision variables are used, ZDT4 and ZDT6 used 10 decision variables, DTLZ1 used 7 decision variables, and DTLZ2–DTLZ5 used 12 decision variables. In order to draw statistical conclusions, the number of independent runs of each test experiment is set to 30. For detailed information about ZDT, UF, and DTLZ test problems, the reader is referred to [31–33], respectively.


## 4.2. Performance Measures

The goal of MOPs is to find a uniformly distributed set that is as close to the true Pareto fronts as possible. In order to compare with other algorithms, this article uses inverted generation distance (IGD) [22] to evaluate the performance of GCDMOPSO. It is believed that this performance index can not only explain the convergence effects of the algorithm but also explain the distribution of the final solution. The true Pareto front for computing IGD was downloaded from http://jmetal.sourceforge.net/problems.html.


## 4.3. Experimental Settings

In the experiment, in order to verify the performance of GCDMOPSO in a convincing way, it was compared with seven state-of-the-art MOPSOs (i.e., dMOPSO [19], MOPSO [9], NMPSO [23], SMPSO [13], MOPSOCD [24], MPSO/D [18], and MMOPSO [14]) and seven classic MOEAs (i.e., NSGA-II [10], NSGA-III [25], MOEA/D [15], MOEAIGDNS [26], SPEAR [27], SPEA2 [28], and IBEA [29]), respectively. For fair comparison, all relevant parameters in the comparison algorithm are set according to their original references, as shown in Table 3. pc and pm are crossover probability and mutation probability in Table 3, respectively; ηc and ηm are the distribution indexes of SBX and PM, respectively; F and CR are parameters set by the authors in differential evolution; T is the number of divisions in genetic algorithm; div is the division network number of cells; w, c1, and c2 are the parameters of the velocity update equation used in the MOPSOs. The population size N of two objectives and three objectives of each algorithm is set to 200, and the maximum number of fitness evaluations is fixed to 10000; the size of the external file is set to be the same as N. In order to draw a statistical conclusion, the number of independent runs of each test experiment is set to 30. The average and standard deviation (std) on IGD are collected in corresponding Tables 4 and 5 for performance comparison. In addition, in order to determine the statistical significance, a Wilcoxon rank-sum test was further carried out to test the statistical significance of the difference between the results obtained by GCDMOPSO and the results obtained by other algorithms at α = 0.05. All experimental results are obtained on PC with 2.3 GHz CPU and 8 GB memory. All source codes of these competing algorithms are provided in the platform PlatEMO [34].Table 3
Parameters settings of GCDMOPSO and all the compared algorithms.
AlgorithmsParameters setting1dMOPSO [19]w∈0.1,0.5,c1c2∈1.5,2.52MOPSO [9]w∈0.1,0.5,c1c2∈1.5,2.5,div=103SMPSO [13]w∈0.1,0.5,c1c2∈1.5,2.5,pm=1/n,ηm=204MOPSOCD [24]w∈0.1,0.5,c1c2∈1.5,2.55MPSO/D [18]w∈0.1,0.5,c1c2∈1.5,2.5,pc=0.9,F=0.5,CR=0.5,pm=1/n,ηm=206MMOPSO [14]w∈0.1,0.5,c1c2∈1.5,2.5,pc=0.9,pm=1/n,ηc=ηm=207NMPSO [23]w∈0.1,0.5,c1c2c3∈1.5,2.5,pm=1/n,ηc=ηm=208NSGA-II [10]pc=1.0,pm=1/n,ηc=ηm=209NSGA-III [25]pc=1.0,pm=1/n,ηc=ηm=2010MOEA/D [15]pc=1.0,pm=1/n,ηc=ηm=20,T=2011MOEAIGDNS [26]pc=1.0,pm=1/n,ηc=ηm=2012SPEAR [27]pc=1.0,pm=1/n,ηc=ηm=2013SPEA2 [28]pc=1.0,pm=1/n,ηc=ηm=2014IBEA [29]pc=1.0,pm=1/n,ηc=ηm=2015GCDMOPSOw=0.4,c1c2=2,div=50Table 4
IGD values of the proposed GCDMOPSO and seven MOPSOs on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 test problems.
ProblemsdMOPSOMOPSONMPSOSMPSOMOPSOCDMPSO/DMMOPSOGCDMOPSOZDT15.3199e − 2 (1.84e − 2)−1.2818e + 0 (1.61e − 1)−3.5090e − 2 (2.49e − 2)−7.8490e − 2 (8.12e − 2)−1.2410e − 2 (3.41e − 2)−1.0097e − 1 (3.75e − 2)−2.4320e − 3 (9.90e − 5)+5.5096e − 3 (5.47e − 4)ZDT24.0278e − 2 (1.65e − 2)−1.9587e + 0 (3.14e − 1)−3.2220e − 2 (5.23e − 2)−8.8623e − 2 (1.40e − 1)−1.3199e − 1 (2.20e − 1)−1.3635e − 1 (9.22e − 2)−1.8831e − 1 (2.43e − 1)−5.9683e − 3 (3.86e − 5)ZDT33.6856e − 2 (1.09e − 2) +7.9559e − 1 (1.88e − 1)−9.3162e − 2 (1.80e − 2)+1.9286e − 1 (8.21e − 2) =5.2211e − 2 (6.74e − 2)+1.9101e − 1 (5.42e − 2)=5.4929e − 3 (1.51e − 2)+2.0214e − 1 (4.10e − 3)ZDT45.6682e + 0 (6.02e + 0) −1.0959e + 1 (4.09e + 0)−1.5558e + 1 (6.00e + 0)−9.6916e + 0 (5.27e + 0) −1.9321e + 1 (9.00e + 0)−3.6610e + 1 (6.82e + 0)−6.4024e + 0 (3.87e + 0)−5.1106e − 3 (5.31e − 4)ZDT64.7132e − 3 (5.34e − 3)−2.6553e − 1 (7.51e − 1)−2.2710e − 3 (1.83e − 4)−1.9179e − 3 (6.27e − 5) =5.6155e − 3 (8.77e − 3)−1.7602e − 2 (1.00e − 2)−2.0980e − 3 (9.98e − 5)=1.9036e − 3 (2.19E − 4)DTLZ11.0110e + 1 (6.03e + 0) −1.1068e + 1 (3.98e + 0)−5.3123e + 0 (3.22e + 0)−3.7308e + 0 (3.56e + 0) −1.9868e + 1 (3.43e + 0)−1.0204e + 1 (2.84e + 0)−2.6475e + 0 (2.13e + 0)−3.1893e − 2 (1.60e − 3)DTLZ21.0357e − 1 (4.89e − 3)−9.9168e − 2 (1.83e − 2)−5.5695e − 2 (1.66e − 3)−6.2961e − 2 (5.67e − 3) +9.6187e − 2 (1.07e − 2)+4.5104e − 2 (1.27e − 3)+5.1981e − 2 (1.22e − 3)+1.3156e − 1 (1.24e − 2)DTLZ39.5459e + 1 (7.27e + 1) +1.8585e + 2 (4.40e + 1) =1.1797e + 2 (2.45e + 1) =4.2214e + 1 (4.28e + 1) +1.2284e + 2 (4.00e + 1)=1.4031e + 2 (1.58e + 1)=9.6313e + 1 (2.83e + 1) +1.2848e + 2 (4.16e + 1)DTLZ43.3629e − 1 (2.32e − 2)−3.5379e − 1 (1.02e − 1)−5.7723e − 2 (1.48e − 3)+4.0061e − 1 (1.22e − 1)−3.2468e − 1 (4.23e − 2)−1.3759e − 1 (3.72e − 2)=8.0754e − 2 (1.63e − 1)+2.1915e − 1 (5.23−2)DTLZ52.7069e − 2 (4.04e − 3) =7.3854e − 3 (1.46e − 3)+7.1965e − 3 (1.09e − 3)+3.5139e − 3 (3.37e − 4) +3.5753e − 2 (1.28e − 2)=5.5742e − 2 (6.20e − 3)−3.6474e − 3 (3.25e − 4)+3.0289e − 2 (5.98e − 3)UF16.6464e − 1 (7.81e − 2)−5.2791e − 1 (1.19e − 1)−1.3296e − 1 (5.34e − 2)=3.9727e − 1 (8.95e − 2)−6.5297e − 1 (1.48e − 1)−2.6644e − 1 (4.60e − 2)−1.2561e − 1 (6.35e − 2)=1.1136e − 1 (1.20e − 2)UF29.1522e − 2 (6.36e − 3)−1.0596e − 1 (1.30e − 2)−8.2356e − 2 (6.97e − 3)−1.0320e − 1 (1.21e − 2)−1.4038e − 1 (1.37e − 2)−1.1472e − 1 (6.45e − 3)−7.0445e − 2 (6.81e − 3)−5.7949e − 2 (6.63e − 3)UF35.7528e − 1 (2.11e − 2)−5.3232e − 1 (1.45e − 2)−6.1950e − 1 (4.55e − 2)−5.3918e − 1 (1.35e − 2)−6.6073e − 1 (4.87e − 2)−6.7669e − 1 (2.46e − 2)−5.6722e − 1 (1.45e − 2)−2.6948e − 1 (3.46e − 2)UF41.3762e − 1 (5.27e − 3)−1.1569e − 1 (1.17e − 2)−6.2625e − 2 (9.38e − 3)=1.1333e − 1 (7.72e − 3)−7.8445e − 2 (7.46e − 3)−9.7497e − 2 (5.79e − 3)−5.6336e − 2 (3.49e − 3)+6.9376e − 2 (1.27e − 2)UF53.3212e + 0 (2.49e − 1)−3.3737e + 0 (2.78e − 1)−1.6778e + 0 (5.00e − 1)−2.8624e + 0 (5.32e − 1)−3.7922e + 0 (3.91e − 1)−2.7759e + 0 (2.63e − 1)−1.5025e + 0 (3.04e − 1)=1.3195e + 0 (2.50e − 1)UF62.1692e + 0 (5.25e − 1)−2.4512e + 0 (4.97e − 1)−6.9450e − 1 (1.55e − 1)−1.3552e + 0 (3.86e − 1)−2.8954e + 0 (5.38e − 1)−1.4377e + 0 (2.33e − 1)−5.7258e − 1 (1.09e − 1)=5.7057e − 1 (1.33e − 1)UF73.7871e − 1 (6.98e − 2)−6.2837e − 1 (9.78e − 2)−1.8881e − 1 (1.44e − 1)−3.5724e − 1 (1.15e − 1)−6.0699e − 1 (1.35e − 1)−2.5060e − 1 (7.27e − 2)−1.1800e − 1 (8.76e − 2)−6.6068e − 2 (9.87e − 3)UF83.4764e − 1 (4.67e − 2) =4.2142e − 1 (3.93e − 2)−4.7503e − 1 (1.03e − 1)−3.9131e − 1 (4.44e − 2) =8.7353e − 1 (1.71e − 1)−5.5120e − 1 (5.13e − 2)−2.6889e − 1 (1.21e − 2)=3.8469e − 1 (7.12e − 2)UF95.8445e − 1 (3.75e − 2)−5.5568e − 1 (4.36e − 2)−4.7656e − 1 (6.25e − 2)−5.7107e − 1 (3.58e − 2)−8.6673e − 1 (1.19e − 1)−6.5999e − 1 (3.74e − 2)−4.3376e − 1 (5.09e − 2)−1.5833e − 1 (4.39e − 2)UF109.3743e − 1 (4.31e − 2)−2.2931e + 0 (3.26e − 1)−1.5264e + 0 (3.37e − 1)−2.7945e + 0 (4.45e − 1)−4.8780e + 0 (7.67e − 1)−4.1813e + 0 (3.21e − 1)−1.2502e + 0 (3.77e − 1)−3.7067e − 1 (7.55e − 2)+/−/=2/16/21/18/13/14/33/14/33/16/11/16/36/8/6—Best/all0/200/201/202/200/201/204/2012/20Table 5
IGD values of the proposed GCDMOPSO and seven MOEAs on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 test problems.
ProblemsNSGA-IINSGA-IIIMOEA/DMOEAIGDNSSPEARSPEA2IBEAGCDMOPSOZDT11.3351e − 2 (2.24e − 3)−1.0794e − 1 (1.64e − 2)−1.4869e − 1 (7.18e − 2)−8.0204e − 2 (1.34e − 2)−1.8544e − 1 (4.17e − 2)−4.5791e − 2 (1.02e − 2)−3.0575e − 2 (6.09e − 3)−5.5096e − 3 (5.47e − 4)ZDT23.7065e − 2 (5.67e − 2)−2.0316e − 1 (4.74e − 2)−5.1303e − 1 (1.03e − 1)−1.5661e − 1 (2.61e − 2)−4.0898e − 1 (1.29e − 1)−7.5782e − 2 (1.76e − 2)−4.5806e − 1 (2.25e − 1)−5.9683e − 3 (1.00e − 3)ZDT31.4048e − 2 (9.19e − 3)+9.3239e − 2 (1.33e − 2)+1.5966e − 1 (4.04e − 2)=6.5803e − 2 (1.32e − 2)+1.5273e − 1 (1.70e − 2)=3.8329e − 2 (9.18e − 3)+2.4122e − 2 (5.68e − 3)+2.0214e − 1 (4.10e − 3)ZDT49.1119e − 1 (3.95e − 1)−2.7254e + 0 (9.71e − 1)−4.7901e − 1 (1.92e − 1)−1.9498e + 0 (8.48e − 1)−1.9591e + 0 (6.21e − 1)−8.7718e − 1 (4.89e − 1)−1.6959e + 0 (5.78e − 1)−5.1106e − 3 (5.31e − 4)ZDT65.7138e − 1 (1.55e − 1)−1.5068e + 0 (3.09e − 1)−8.9624e − 2 (3.52e − 2)−1.2194e + 0 (2.58e − 1)−1.1220e + 0 (2.14e − 1)−5.8304e − 1 (1.80e − 1)−4.0693e − 1 (1.37e − 1)−1.9036e − 3 (2.19E − 4)DTLZ11.9064e − 1 (2.17e − 1)−8.7852e − 1 (3.52e − 1)−4.0238e − 1 (5.09e − 1)−7.5255e − 1 (2.57e − 1)−8.5648e − 1 (3.23e − 1)−3.7942e − 1 (2.38e − 1)−2.5592e − 1 (2.18e − 1)−3.1893e − 2 (1.60e − 3)DTLZ25.0991e − 2 (1.25e − 3)+4.0110e − 2 (6.49e − 4)+3.9672e − 2 (8.95e − 4)+4.3567e − 2 (1.45e − 3)+4.2995e − 2 (1.69e − 3)+3.9796e − 2 (5.62e − 4)+6.0008e − 2 (1.88e − 3)+1.3156e − 1 (1.24e − 2)DTLZ31.5011e + 1 (5.61e + 0) +3.3597e + 1 (7.77e + 0)+1.9932e + 1 (1.05e + 1)+3.0896e + 1 (8.95e + 0)+3.5538e + 1 (8.93e + 0)+1.4161e + 1 (4.45e + 0)+1.1652e + 1 (4.42e + 0) +1.2848e + 2 (4.16e + 1)DTLZ46.7625e − 2 (8.95e − 2)+5.7588e − 2 (9.14e − 2)=3.7432e − 1 (3.48e − 1)=6.0124e − 2 (9.09e − 2)+4.4537e − 2 (1.19e − 3)+7.4018e − 2 (1.27e − 1)+5.8439e − 2 (1.48e − 3)+2.1915e − 1 (5.23−2)DTLZ53.9962e − 3 (2.48e − 4)+7.1312e − 3 (9.16e − 4)+2.0348e − 2 (6.23e − 4)+5.6171e − 3 (7.32e − 4)+2.2074e − 2 (1.56e − 3)=4.5566e − 3 (5.73e − 4)+1.1354e − 2 (9.22e − 4)+3.0289e − 2 (5.98e − 3)UF11.1632e − 1 (2.49e − 2)−1.4092e − 1 (4.21e − 2)−3.3299e − 1 (1.01e − 1)−1.1721e − 1 (2.51e − 2)−1.3790e − 1 (2.30e − 2)−1.2188e − 1 (3.16e − 2)−1.2150e − 1 (2.75e − 2)−1.1136e − 1 (1.20e − 2)UF26.5645e − 2 (6.00e − 3)−8.0437e − 2 (5.54e − 3)−1.8876e − 1 (6.80e − 2)−7.5721e − 2 (4.95e − 3)−7.0807e − 2 (8.07e − 3)−6.8572e − 2 (6.20e − 3)−6.5305e − 2 (6.26e − 3)−5.7949e − 2 (6.63e − 3)UF34.3498e − 1 (2.51e − 2)−4.7938e − 1 (1.13e − 2)−3.3698e − 1 (2.81e − 2)−4.6226e − 1 (8.68e − 3)−4.2464e − 1 (1.60e − 2)−4.4909e − 1 (1.74e − 2)−4.3557e − 1 (2.52e − 2)−2.6948e − 1 (3.46e − 2)UF48.0553e − 2 (3.46e − 3)−9.4935e − 2 (3.23e − 3)−1.1790e − 1 (5.10e − 3)−8.8455e − 2 (2.99e − 3)−8.5693e − 2 (2.53e − 3)−8.0996e − 2 (2.55e − 3)−8.0710e − 2 (2.88e − 3)−6.9376e − 2 (1.27e − 2)UF57.8265e − 1 (2.68e − 1)+1.6238e + 0 (3.91e − 1)−1.3193e + 0 (2.96e − 1)=1.0254e + 0 (2.49e − 1)=1.2043e + 0 (2.25e − 1)=9.3783e − 1 (2.90e − 1)+7.4200e − 1 (1.62e − 1)+1.3195e + 0 (2.50e − 1)UF65.3210e − 1 (8.41e − 2)=7.8385e − 1 (1.85e − 1)−5.9812e − 1 (2.41e − 1)−6.0366e − 1 (1.20e − 1)−6.8918e − 1 (1.02e − 1)−5.1892e − 1 (8.12e − 2)=5.1057e − 1 (9.97e − 2)=5.7057e − 1 (1.33e − 1)UF71.7024e − 1 (9.95e − 2)−1.7604e − 1 (6.34e − 2)−4.6220e − 1 (1.73e − 1)−2.1070e − 1 (9.19e − 2)−1.8685e − 1 (7.08e − 2)−1.5383e − 1 (9.99e − 2)−1.4710e − 1 (7.88e − 2)−6.6068e − 2 (9.87e − 3)UF83.1419e − 1 (3.67e − 2)=3.3684e − 1 (3.82e − 2)=5.7398e − 1 (2.50e − 1)−3.7209e − 1 (4.31e − 2)=3.1745e − 1 (2.05e − 2)+3.0404e − 1 (3.44e − 2)+3.7170e − 1 (5.25e − 2)=3.8469e − 1 (7.12e − 2)UF94.3302e − 1 (5.11e − 2)−4.9207e − 1 (4.63e − 2)−5.0362e − 1 (9.59e − 2)−4.9717e − 1 (5.14e − 2)−4.7406e − 1 (5.61e − 2)−4.4935e − 1 (5.18e − 2)−4.0120e − 1 (6.62e − 2)−1.5833e − 1 (4.39e − 2)UF101.3928e + 0 (4.05e − 1)−2.4384e + 0 (4.75e − 1)−7.1987e − 1 (8.22e − 2)−1.5321e + 0 (3.69e − 1)−2.0141e + 0 (4.27e − 1)−1.4443e + 0 (5.10e − 1)−1.0332e + 0 (3.23e − 1)−3.7067e − 1 (7.55e − 2)+/−/=6/12/24/14/23/14/35/13/24/13/37/12/16/12/2—Best/all2/200/201/200/201/201/203/2012/20


## 4.4. Comparisons of GCDMOPSO with Seven State-of-the-Art MOPSOs

In GCDMOPSO, seven MOPSOs and seven MOEAs are selected, and the program runs the average and standard deviation of the IGD values on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 in Table4. Moreover, the Wilcoxon rank-sum test is adopted at a significance level of 0.05, where the symbols “+,” “−,” and “=” in the last row of the tables indicate that the result is significantly better than, significantly worse than, and statistically similar to that obtained by GCDMOPSO, respectively. The best average for each test instance is shown in bold.It can be directly observed that the performance of the proposed GCDMOPSO is significantly better than the existing seven compared MOPSOs in terms of benchmark testing, that is, dMOPSO, MOPSO, NMPSO, SMPSO, MOPSOCD, MPSO/D, and MMOPSO. Of all 20 test instances, GCDMOPSO achieved statistically significantly better IGD values on 12 test instances which were far greater than those of the competing MOPSOs. For example, the numbers of optimal IGD values for dMOPSO, MOPSO, and MOPSOCD are zero, the number of optimal IGD values for MPSO/D is one, the numbers of optimal IGD values for NMPSO and SMPSO are two, and MMOPSO has five optimal IGD values.For two-objective ZDT2, ZDT4, and ZDT6, the proposed GCDMOPSO can obtain a set of nondominant solutions, which can approximate the entire Pareto front well and maintain a good distribution. For the three-objective DTLZ1, the proposed GCDMOPSO can still achieve competitive performance, but, on the three-objective DTLZ2–DTLZ5, the performance of GCDMOPSO does not seem to be so ideal. It is worth noting that MMOPSO performed best on the two-objective ZDT1 and ZDT3, due to the fact that it has adopted the crossover and mutation operators in MOEAs in addition to the updating strategies of PSO. In UF1–UF10, the performance is far better than those of other comparison algorithms. Generally speaking, compared with the existing MOPSOs, the proposed GCDMOPSO proves the overall best performance. At the same time, when different algorithms are run independently 30 times, the partial statistical block diagram of the evaluation index IGD of GCDMOPSO algorithm and the comparison algorithm is shown in Figure8 (1, 2, 3, 4, 5, 6, 7, and 8 represent dMOPSO, MOPSO, NMPSO, SMPSO, MOPSOCD, MPSO/D, MMOPSO, and GCDMOPSO, respectively). As shown in Figure 8, GCDMOPSO recorded the minimum values on ZDT2, ZDT4, ZDT6, DTLZ1, UF1–UF3, UF5–UF7, and UF9-UF10. It can be clearly seen from Figure 8 that GCDMOPSO can obtain better nondominated solutions compared with other MOPSOs. The results are consistent with the qualitative analysis in Table 4.Figure 8
Statistical boxplot of IGD indicator of different MOPSOs and statistical boxplot of IGD indicator of different MOPSOs on ZDT2, ZDT4, ZDT6, DTLZ1, UF1–UF3, UF5–UF7, and UF9-UF10 problems, respectively.From the above empirical results, we can conclude that, compared with the existing MOPSOs, GCDMOPSO has application prospects in solving PSO.


## 4.5. Comparisons of GCDMOPSO with Seven Competitive MOEAs

Table5 presents the mean and standard deviation of IGD values of NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, and IBEA on ZDT1 to ZDT4 and ZDT6, DTLZ1 to DTLZ5, and UF1 to UF10, where the Wilcoxon rank-sum test is also adopted and the best mean for each test instance is shown in bold. It can be observed that the performance of the proposed GCDMOPSO is significantly better than those of the seven compared MOEAs (i.e., NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, and IBEA) in terms of benchmark testing. According to the results, there are 12 test cases with statistically significant best performance among 20 test examples.For two-objective ZDT1-ZDT2, ZDT4, and ZDT6, UF1–UF4, and UF7, GCDMOPSO performs best compared to the seven algorithms. For example, the numbers of optimal IGD values for NSGA-III and MOEAIGDNS are zero, the numbers of optimal IGD values for MOEA/D, SPEAR, and SPEA2 are one, the number of optimal IGD values for NSGA-II is three, and IBEA has four best IGD values. For the three-objective DTLZ series, compared MOEAs are obviously better than GCDMOPSO, and this is because genetic factors are more suitable for solving MOPs with local frontiers. Therefore, in the existing MOPs, more researchers suggest the main reason for using genetic factors.At the same time, when different algorithms are run independently 30 times, the partial statistical block diagram of the evaluation index IGD of the GCDMOPSO and the comparison algorithm is shown in Figure9 (1, 2, 3, 4, 5, 6, 7, and 8 represent NSGA-II, NSGA-III, MOEA/D, MOEAIGDNS, SPEAR, SPEA2, IBEA, and GCDMOPSO, respectively). As shown in Figure 9, GCDMOPSO recorded the minimum values on ZDT1, ZDT2, ZDT4, ZDT6, DTLZ1, UF1 to UF4, UF7, UF9, and UF10. It can be clearly seen from Figure 9 that GCDMOPSO can obtain best nondominated solutions compared with other MOEAs. The results are consistent with the qualitative analysis in Table 5.Figure 9
Statistical boxplot of IGD indicator of different MOEAs and statistical boxplot of IGD indicator of different MOEAs on ZDT1-ZDT2, ZDT4, ZDT6, DTLZ1, UF1–UF4, UF7, and UF9-UF10 problems, respectively.From the above empirical results, we can conclude that, compared with the existing MOEAs, GCDMOPSO has application prospects in solving PSO.


## 4.6. Complexity of the GCDMOPSO

The complexity of the proposed GCDMOPSO depends on the complexity of its components, that is, the complexity of game strategy and cosine distance. The following is the complexity analysis of GCDMOPSO.Suppose that the population size isN, where there are m nondominated individuals. In general, it is assumed that km≤k≤N games have been played. According to the game strategy, an individual will be eliminated after each game. Therefore, a total of k individuals were eliminated, including q0<q≤m dominated individuals and p0≤p<N−m nondominated individuals. After k times of games, N−k individuals become winners among the N individuals. For the convenience of analysis, assuming that, in each game, N−k dominated individuals have the same probability of being selected, after k games, there are(11)Tn=N−1+N−2−N−kk+N−3−2N−kk+⋯+N−k−k−1N−kk=N−1+N−kk2−N−kk+kN−kkk2+N−k=N−1k2+N−k12≤N2.The time complexity of the game strategy isTn=ON2. At the same time, in the process of updating the external archive of the game strategy, the calculation complexity of the cosine distance is OM×2Nlog22N. Then the total computational complexity is OM×N2, where M is the number of objectives.In addition, this article uses MATLAB functions (tic and toc) to calculate the runtime (unit: second) of each algorithm when the number of evaluations is 10000. It can be seen from Tables6 and 7 that even though GCDMOPSO uses the cosine distance measurement mechanism and the game strategy, the time complexity of GCDMOPSO and other comparison algorithms is on the same order of magnitude on functions ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10.Table 6
Runtime of different MOPSOs and GCDMOPSO on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 problems, respectively.
ProblemsFEsdMOPSOMOPSONMPSOSMPSOMOPSOCDMPSODMMOPSOGCDMOPSOZDT1100007.8676e − 13.1199e − 11.5439e + 13.0488e − 13.4421e − 11.8922e + 03.7923e − 14.2437e + 0ZDT2100006.8131e − 12.6821e − 11.1491e + 12.3180e − 13.7589e − 11.5781e + 03.1551e − 14.7586e + 0ZDT3100007.8204e − 12.6363e − 11.1106e + 12.3377e − 12.1194e − 11.5873e + 03.2188e − 13.2039e + 0ZDT4100008.7783e − 12.4611e − 12.2032e + 02.0048e − 11.7586e − 11.0354e + 02.4560e − 14.3560e + 0ZDT6100006.8091e − 12.9741e − 11.8178e + 12.0287e − 13.3332e − 11.2271e + 02.8039e − 14.3096e + 0DTLZ1100009.7676e − 12.5560e − 13.6316e + 01.9261e − 11.8182e − 12.1156e + 03.3008e − 12.7750e + 0DTLZ2100008.6479e − 15.5054e − 11.3995e + 13.4870e − 12.3072e − 12.0819e + 04.0736e − 13.1383e + 0DTLZ3100009.2875e − 12.4352e − 12.6860e + 02.1345e − 11.8944e − 12.1073e + 02.7857e − 11.5740e + 0DTLZ4100008.7179e − 13.3241e − 11.3662e + 12.5100e − 11.8809e − 11.4432e + 04.0681e − 10.8514e + 0DTLZ5100008.8027e − 14.6302e − 11.0695e + 13.5398e − 12.0460e − 11.4525e + 04.0731e − 11.7879e + 0UF1100008.3878e − 12.7608e − 12.2603e + 02.3215e − 12.1324e − 11.8870e + 03.2098e − 11.0027e + 0UF2100009.0479e − 12.9694e − 13.5757e + 02.5161e − 12.2116e − 11.9781e + 03.4488e − 11.7896e + 0UF3100008.4054e − 12.9903e − 15.4222e + 02.4683e − 12.2645e − 11.8899e + 03.6710e − 11.3945e + 0UF4100009.1935e − 12.7600e − 18.3688e + 02.4176e − 12.2351e − 12.0474e + 03.3159e − 11.7119e + 0UF5100009.3696e − 12.6467e − 12.1922e + 02.3675e − 12.1536e − 11.7893e + 03.3005e − 17.5826e − 1UF6100009.1887e − 12.7415e − 12.2196e + 02.4281e − 12.2226e − 11.7920e + 03.3701e − 18.5198e − 1UF7100007.7783e − 12.7314e − 12.2618e + 02.3713e − 12.1070e − 11.8708e + 03.1525e − 18.7601e − 1UF8100007.6917e − 13.9688e − 16.0293e + 03.2237e − 12.1981e − 11.5660e + 03.9585e − 12.0080e + 0UF9100008.0635e − 14.1594e − 14.4678e + 03.2879e − 12.2249e − 11.6600e + 03.9587e − 11.8525e + 0UF10100007.1560e − 13.3209e − 12.6416e + 02.5976e − 12.2396e − 11.6415e + 03.5417e − 11.1690e + 0Table 7
Runtime of different MOEAs and GCDMOPSO on ZDT1–ZDT4 and ZDT6, DTLZ1–DTLZ5, and UF1–UF10 problems, respectively.
ProblemsFEsNSGA-IINSGA-IIIMOEADMOEAIGDNSSPEA2SPEARIBEAGCDMOPSOZDT1100003.4758e − 15.3468e − 13.4007e + 06.4332e − 18.0079e + 08.6639e + 01.0740e + 14.2437e + 0ZDT2100006.7123e − 14.8913e − 13.3432e + 03.6390e − 17.9921e + 08.5811e + 01.0624e + 14.7586e + 0ZDT3100002.4592e − 14.3497e − 13.3789e + 06.4406e − 18.0529e + 08.6078e + 01.0731e + 13.2039e + 0ZDT4100003.5868e − 16.3845e − 13.2340e + 03.6940e − 18.1632e + 08.5680e + 01.0601e + 14.3560e + 0ZDT6100002.7101e − 14.3891e − 13.2598e + 03.0581e − 18.0220e + 08.6345e + 01.0646e + 14.3096e + 0DTLZ1100002.9300e − 15.3163e − 13.3872e + 04.5224e − 18.1141e + 08.3389e + 01.0676e + 12.7750e + 0DTLZ2100003.2915e − 18.2367e − 13.3891e + 04.6041e + 11.4410e + 18.9867e + 01.2031e + 13.1383e + 0DTLZ3100003.3083e − 15.3091e − 13.6684e + 04.5267e − 18.6110e + 09.2516e + 01.2214e + 11.5740e + 0DTLZ4100003.6689e − 16.9115e − 13.7662e + 04.0429e + 11.4007e + 18.9418e + 01.1746e + 10.8514e + 0DTLZ5100003.6991e − 17.7597e − 13.7441e + 01.5471e + 11.1243e + 18.9396e + 01.1829e + 11.7879e + 0UF1100003.1563e − 14.9168e − 13.9203e + 04.7115e − 19.1414e + 09.5004e + 01.2108e + 11.0027e + 0UF2100002.8833e − 14.9032e − 14.0969e + 08.5106e − 19.1164e + 09.5507e + 01.2087e + 11.7896e + 0UF3100003.2962e − 15.1931e − 14.0620e + 05.5841e − 19.1166e + 09.6254e + 01.2138e + 11.3945e + 0UF4100002.9796e − 15.5766e − 14.0546e + 01.0266e + 09.0826e + 09.6639e + 01.1300e + 11.7119e + 0UF5100003.0116e − 15.8167e − 13.9241e + 03.7765e − 18.7468e + 09.1719e + 01.2134e + 17.5826e − 1UF6100003.1538e − 15.4860e − 13.8002e + 04.0976e − 18.7895e + 09.3935e + 01.1596e + 18.5198e − 1UF7100002.8455e − 15.3397e − 13.7370e + 04.2447e − 18.6857e + 09.3448e + 01.1451e + 18.7601e − 1UF8100003.5545e − 16.8885e − 13.6264e + 01.8384e + 08.6025e + 09.2178e + 01.1520e + 12.0080e + 0UF9100003.5060e − 16.9686e − 14.2788e + 01.3978e + 08.6964e + 09.0618e + 01.1917e + 11.8525e + 0UF10100003.4883e − 16.7182e − 14.2034e + 01.0353e + 08.7814e + 09.1103e + 01.1806e + 11.1690e + 0


## 5. Conclusions

This paper has proposed a novel multiobjective particle swarm optimization based on cosine distance mechanism and game strategy to solve MOPs. The optimization was used to update the Pareto set in the external archives through the update strategy of the cosine distance measurement mechanism and add a candidate set as a storage for screened advantageous individuals’ mechanism. The optimization is conducive to Pareto optimal set close to the true Pareto optimal front and maintains the diversity of the swarm. In order to improve the performance of optimization, this article combined the game update strategy to design a global optimal selection strategy of the game strategy based on the cosine distance measurement mechanism. These experimental studies have shown that the proposed GCDMOPSO has better performance than several state-of-the-art MOPSOs and competitive MOEAs.



---

*Source: 6440338-2021-11-06.xml*