# A Fusion Multiobjective Empire Split Algorithm

Authors: Liang Liang
Journal: Journal of Control Science and Engineering
 (2020)

---

## Abstract

In the last two decades, swarm intelligence optimization algorithms have been widely studied and applied to multiobjective optimization problems. In multiobjective optimization, reproduction operations and the balance of convergence and diversity are two crucial issues. Imperialist competitive algorithm (ICA) and sine cosine algorithm (SCA) are two potential algorithms for handling single-objective optimization problems, but the research of them in multiobjective optimization is scarce. In this paper, a fusion multiobjective empire split algorithm (FMOESA) is proposed. First, an initialization operation based on opposition-based learning strategy is hired to generate a good initial population. A new reproduction of offspring is introduced, which combines ICA and SCA. Besides, a novel power evaluation mechanism is proposed to identify individual performance, which takes into account both convergence and diversity of population. Experimental studies on several benchmark problems show that FMOESA is competitive compared with the state-of-the-art algorithms. Given both good performance and nice properties, the proposed algorithm could be an alternative tool when dealing with multiobjective optimization problems.


---

## Body

## 1. Introduction

With the continuous innovation of technology and the rapid development of industrial production, the multiobjective optimization problem (MOP) has gradually become a research focus in the current scientific and engineering fields [1].The subobjectives in a multiobjective optimization problem are usually mutually constrained. There is no absolute optimal solution, and only the dominance of the solutions can be adopted to evaluate the pros and cons of the solutions. Therefore, intelligent algorithms are usually used to approximate to the Pareto front, and a set of Pareto optimal solution sets of algorithm is received. The swarm intelligence evolution algorithm is optimized in the form of swarms. In the past few decades, swarm intelligence evolution algorithm has been continuously developed and extended, such as genetic algorithm (GA) [2], differential evolution (DE) [3], evolution strategy (ES) [4], ant colony algorithm (ACO) [5], and particle swarm algorithm (PSO) [6]. They have been proven to be very effective single-objective optimization algorithms and are widely used in engineering practice, such as water cycle [7], distributed assembly permutation flow shop problem [8], a fuel cell/battery/supercapacitor hybrid power train [9], and workforce planning [10]. One of their most significant features is that they can obtain multiple solutions in one iteration. Therefore, they have the advantages of simple implementation, low calculation cost, and high efficiency. Recently, the employment of swarm intelligence evolutionary algorithms to deal with multiobjective optimization problems has been widely studied, and a large number of swarm intelligence-based algorithms have been proposed. According to different candidate solution selection mechanisms, multiobjective evolutionary algorithms (MOEAs) can be roughly divided into the following three categories.The first type is domination-based algorithms. This type of algorithm is represented by methods such as NSGAII [11] and SPEA2 [12]. Their basic idea is to use Pareto dominance relationships to classify groups and then calculate the density of individuals in each category. Based on the dominant relationship and density estimation, the population is fully sorted, and the relatively superior individuals are selected to enter the next generation. Crowding distance, k-nearest neighbor, ε-domination, and grid-divided are often used to estimate the density of individuals. Since the MOEA algorithm based on the Pareto dominance relationship has the advantages of simple principles, easy understanding, and fewer parameters, this type of algorithm has attracted many researchers’ in-depth research and extensive applications.The second type is the MOEA algorithm based on decomposition. MOEA based on decomposition (MOEA/D) [13] is another classic MOEA algorithm framework. MOEA/D decomposes MOP into a series of subproblems and organizes these subproblems to solve at the same time to obtain an approximation of the Pareto solution set. Because the algorithm runs only once, it can achieve high computing efficiency. In MOEA/D, each subproblem is a single-objective optimization problem, so the MOEA/D algorithm framework can accommodate various types of single-objective optimization methods and local search methods. Thus, it naturally establishes the connection between heuristic algorithms and traditional mathematical programming methods. The MOEA/D framework has attracted more and more researchers’ attention [14–16]. However, this algorithm requires a predefined set of weight vectors. Without prior knowledge, uniformly defined weight vectors cannot solve Pareto front with special shapes, which add unnecessary difficulty to solve MOPs [17].The third type of algorithm is the MOEA algorithm based on evaluation indicators. This type of algorithm is represented by algorithms such as IBEA [18] and HypE [19]. The basic idea is to optimize the original MOP indirectly by directly optimizing the performance indicator of the Pareto approximation set. This is actually converting a multiobjective optimization problem into a single-objective optimization problem. In this type of method, hypervolume evaluation indicators are the most commonly used. This type of MOEA algorithm avoids a large number of comparison problems caused by Pareto dominance, but due to the large amount of calculation of the hypervolume, it is necessary to introduce methods such as Monte Carlo estimation to improve the calculation speed [19]. In addition, with the increase of the number of objectives, the calculation amount of such methods is increasing exponentially.In the past two decades, a variety of intelligent optimization algorithms have been introduced to deal with multiobjective optimization problems and have achieved the expected results, such as particle swarm optimization, grey wolf optimization [20], imperialist competitive algorithm [21], and sine cosine algorithm [22]. Among them, the imperialist competitive algorithm (ICA) [21] is an evolutionary algorithm based on the imperialist colonial competition mechanism proposed by Atashpaz-Gargari and Lucas in 2007. It belongs to a socially inspired random optimization search method. At present, ICA has been successfully applied to a variety of optimization problems, such as ship design optimization [23], water distribution networks [24], and production scheduling problems [25]. ICA has a fast convergence speed, but it is easy to fall into a local optimum. But in dealing with multiobjective optimization problems, there is not much research on ICA. In solving the single-objective optimization problem, multiple colonies obtain the final optimal solution by approaching the empire. It should be noted that, at the end of the algorithm, only one empire remains in the population, and the position of the empire is the optimal solution. However, when dealing with multiobjective optimization problems, a set of trade-off solutions is needed at the end of the algorithm. Therefore, inspired by ICA, a reverse ICA algorithm is studied in this paper. While the algorithm is running, the nondominated solutions are considered as the individual empire. In the end, the algorithm gets an approximate Pareto solution set composed of a group of empire individuals.In order to prevent the population from falling into the local optimal solution, mutation operation is a commonly used strategy in multiobjective evolutionary algorithms. However, the use of mutation operations may change the original trajectory of some excellent solutions. Therefore, in order to improve the global search ability and improve the diversity of the proposed algorithm, a hybrid generation method is introduced. The sine cosine algorithm (SCA) [26] is a new metaheuristic algorithm. It is a numerical optimization calculation method based on self-organization and group intelligence based on the sine cosine function. The self-organizing model of the concept of sine and cosine was first proposed by Mirjalili. In this paper, SCA is used to update iterations of empire individuals to improve their global search capabilities.In addition, archive strategy is also adopted by many algorithms [27–29]. The archiving strategy can better save the historical information during the algorithm running process, so as to obtain the final better candidate solution. However, the update operation of the archive strategy often occupies additional computing resources and increases the computational burden of the algorithm. In this paper, archive strategy is abandoned. The excellent solution of each generation of the population is regarded as the empire individual, and the evolutionary direction of the colony is updated. In other words, the candidate solutions after each iteration directly guide the evolution of the next generation.In this paper, a fusion multiobjective empire split algorithm (FMOESA) is proposed. Inspired by the imperialist competitive algorithm, when dealing with multiobjective optimization, the excellent solutions are saved through the behavior of empire splitting. The approach of colonial individuals to empire individuals was also exploited when producing offspring individuals. In addition, in order to balance convergence and diversity, a new individual power assessment mechanism is also proposed. Finally, in order to verify the effectiveness of the proposed algorithm, FMOESA is compared with four state-of-the-art MOEAs on various well-known benchmark MOPs. The experimental results show that FMOESA is capable of obtaining high-quality solutions and the power assessment mechanism works well on maintaining good balance of population diversity and convergence.The main contributions of this paper are highlighted as follows.(i)
A new reproduction of offspring is introduced, which combines three operators: ICA, SCA, and GA. For empire individuals, the offspring are generated by performing sine and cosine operators with other empire individuals. For colonial individuals, the offspring are generated through crossover and mutation operations with their empire. In other words, the idea of colonial individuals approaching empire individuals through crossover and mutation operations is similar to that in ICA.(ii)
A novel power evaluation mechanism is proposed to identify individual performance. When evaluating the performance of an individual, convergence and diversity are considered simultaneously. This evaluation mechanism is not only used to distinguish between imperial and colonial individuals but also to eliminate redundant individuals in the population. This strategy can balance the convergence and diversity of the entire population.(iii)
Archive strategy is not adopted in this paper. The outstanding individuals selected after each iteration constitute a candidate solution set, and, at the same time, they are used as the parent population of the next iteration to directly guide the process of the next iteration. This operation saves computing resources and reduces unnecessary computational complexity.The remainder of this paper is organized as follows. Section2 presents the main concepts of multiobjective optimization and basic content of ICA and SCA. The proposed algorithm is described in Section 3. Section 4 presents the experimental design and results. Finally, Section 5 presents conclusions and future research directions.


## 2. Basic Concepts and Motivation

### 2.1. Multiobjective Optimization Problems

In general, multiobjective optimization problems (MOP) can be defined as(1)MinFX=f1X,f2X,f3X,…,fmX,s.t.X∈ΩD,where fi (i∈1,2,3,…,m) are conflicting objective functions. ΩD is the decision variable space. Denote a solution X by X = (x1, x2, x3,…, xD), where D is the number of decision variables.Definition 1.
X≺X′, which solution X is dominate solution X′, if fiX<fiX′, ∀i∈m.Definition 2.
A solutionX is Pareto optimal if and only if there is no other X′, X′≺X.Definition 3.
A setPS of all Pareto optimal solution is called Pareto optimal set, PS=X|¬∃X′≺X.Definition 4.
A set that contains all the Pareto optimal objective vectors is called the Pareto front, denoted byPF=fX|X∈PS.


### 2.2. The Traditional Imperialist Competitive Algorithm

The traditional imperialist competitive algorithm (ICA) is mainly used to deal with single-objective optimization problems. It is a sociopolitical evolutionary algorithm proposed by Atashpaz-Gargari and Lucas [21] in 2007, which is a simulation of the colonial competition process of human society. The main process of the Empire competition algorithm is as follows.(i)
Step 1: form an empire. The imperialist competitive algorithm first generates an initial country by a random method, and each country represents a solution to the problem. These countries are divided into two categories: colonial countries and colonies according to the size of the power (the quality of the solution). The former several countries became colonial countries. Then the remaining countries were assigned as colonies to the colonial countries in order according to the power of the colonial countries. The more powerful the colonial countries, the more colonies were assigned. The colonial countries and the colonies they belong to are collectively called empires.(ii)
Step 2: assimilation and revolution. After the formation of the empire, the economic, cultural, and language attributes of the colonies will inevitably tend to belong to the colonial countries. This process is called assimilation. The goal of assimilation is to improve the quality of the solution of all countries, which can increase the influence of colonial countries on colonies. In order to be consistent with history, the process of colonial tending to empire always has a certain deviation. In extreme cases, there may even be a reverse deviation, that is, the colonial revolution. If the colony is undergoing assimilation and revolution, in the process, the power surpassed the colonial country; then the colony will replace the colonial country and establish a new empire.(iii)
Step 3: colonial competition. There is competition between empires. The decline of the power between empires will make the colonies of weak empires deprived of powerful empires until the weak empires disappear. At the same time, new empires will continue to appear in the competition. After generations of assimilation, revolution, and competition, ideally only one empire will remain, and all countries are members of that empire. Through such a series of evolutionary operations, the algorithm finally finds the global optimal solution.


### 2.3. The Standard Sine Cosine Algorithm

The standard sine cosine algorithm (SCA) was proposed by Australian scholar Mirjalili in 2016 [26]. The algorithm starts with a set of random solutions and continuously approaches the global optimal solution through the search and development phases. First, the position of the solution is initialized, and the algorithm is updated as shown in(2)Xijt+1=Xijt+r1×sinr2×r3Pgjt−Xijt,r4<0.5,Xijt+r1×cosr2×r3Pgjt−Xijt,r4≥0.5,where Xijt is the position of the i-th individual in the j-th search space in the t-th iteration; r1 is a linear decreasing function, and it is updated as shown in(3)r1=a−atTmax.In (3), a is a constant and a=2; Tmax is the maximum number of iterations; r2 is a random number in the range 0,2π; r3 is a random number in the range −2,2; Pgj is the global extremum of the population.As shown in (2), there are four main parameters in the SCA, that is, r1, r2, r3, and r4. The parameter r1 determines the area (or moving direction) of the next position. It can be either the area between the current solution and the target solution, or it can be an area other than the two. Parameter r2 defines the distance of the current solution toward or away from the target solution; parameter r3 randomly assigns a weight to the target solution, the purpose of which is to strengthen (r3>1) or weaken (r3<1) the distance defined by the target solution. The parameter r4 indicates that the probability of updating the sine and cosine in (2) is equal.The theoretical advantages of SCA in solving the global optimal solution of an optimization problem with sufficient candidate solution set size and number of iterations are as follows:(i)
SCA is the same as other swarm intelligence optimization algorithms. Compared with the algorithm of a single candidate solution, the candidate solution set of a certain size achieves a stronger search ability and the ability to escape the local optimal trap, and SCA has sufficient random search ability.(ii)
The optimal candidate solution is always retained during the iteration process and used as a basis for updating the candidate solution set, and there is a tendency to move to the optimal solution space during the search process.(iii)
The randomness of its global search and local development has stronger adaptability and stability than searching and developing in two stages.


## 2.1. Multiobjective Optimization Problems

In general, multiobjective optimization problems (MOP) can be defined as(1)MinFX=f1X,f2X,f3X,…,fmX,s.t.X∈ΩD,where fi (i∈1,2,3,…,m) are conflicting objective functions. ΩD is the decision variable space. Denote a solution X by X = (x1, x2, x3,…, xD), where D is the number of decision variables.Definition 1.
X≺X′, which solution X is dominate solution X′, if fiX<fiX′, ∀i∈m.Definition 2.
A solutionX is Pareto optimal if and only if there is no other X′, X′≺X.Definition 3.
A setPS of all Pareto optimal solution is called Pareto optimal set, PS=X|¬∃X′≺X.Definition 4.
A set that contains all the Pareto optimal objective vectors is called the Pareto front, denoted byPF=fX|X∈PS.


## 2.2. The Traditional Imperialist Competitive Algorithm

The traditional imperialist competitive algorithm (ICA) is mainly used to deal with single-objective optimization problems. It is a sociopolitical evolutionary algorithm proposed by Atashpaz-Gargari and Lucas [21] in 2007, which is a simulation of the colonial competition process of human society. The main process of the Empire competition algorithm is as follows.(i)
Step 1: form an empire. The imperialist competitive algorithm first generates an initial country by a random method, and each country represents a solution to the problem. These countries are divided into two categories: colonial countries and colonies according to the size of the power (the quality of the solution). The former several countries became colonial countries. Then the remaining countries were assigned as colonies to the colonial countries in order according to the power of the colonial countries. The more powerful the colonial countries, the more colonies were assigned. The colonial countries and the colonies they belong to are collectively called empires.(ii)
Step 2: assimilation and revolution. After the formation of the empire, the economic, cultural, and language attributes of the colonies will inevitably tend to belong to the colonial countries. This process is called assimilation. The goal of assimilation is to improve the quality of the solution of all countries, which can increase the influence of colonial countries on colonies. In order to be consistent with history, the process of colonial tending to empire always has a certain deviation. In extreme cases, there may even be a reverse deviation, that is, the colonial revolution. If the colony is undergoing assimilation and revolution, in the process, the power surpassed the colonial country; then the colony will replace the colonial country and establish a new empire.(iii)
Step 3: colonial competition. There is competition between empires. The decline of the power between empires will make the colonies of weak empires deprived of powerful empires until the weak empires disappear. At the same time, new empires will continue to appear in the competition. After generations of assimilation, revolution, and competition, ideally only one empire will remain, and all countries are members of that empire. Through such a series of evolutionary operations, the algorithm finally finds the global optimal solution.


## 2.3. The Standard Sine Cosine Algorithm

The standard sine cosine algorithm (SCA) was proposed by Australian scholar Mirjalili in 2016 [26]. The algorithm starts with a set of random solutions and continuously approaches the global optimal solution through the search and development phases. First, the position of the solution is initialized, and the algorithm is updated as shown in(2)Xijt+1=Xijt+r1×sinr2×r3Pgjt−Xijt,r4<0.5,Xijt+r1×cosr2×r3Pgjt−Xijt,r4≥0.5,where Xijt is the position of the i-th individual in the j-th search space in the t-th iteration; r1 is a linear decreasing function, and it is updated as shown in(3)r1=a−atTmax.In (3), a is a constant and a=2; Tmax is the maximum number of iterations; r2 is a random number in the range 0,2π; r3 is a random number in the range −2,2; Pgj is the global extremum of the population.As shown in (2), there are four main parameters in the SCA, that is, r1, r2, r3, and r4. The parameter r1 determines the area (or moving direction) of the next position. It can be either the area between the current solution and the target solution, or it can be an area other than the two. Parameter r2 defines the distance of the current solution toward or away from the target solution; parameter r3 randomly assigns a weight to the target solution, the purpose of which is to strengthen (r3>1) or weaken (r3<1) the distance defined by the target solution. The parameter r4 indicates that the probability of updating the sine and cosine in (2) is equal.The theoretical advantages of SCA in solving the global optimal solution of an optimization problem with sufficient candidate solution set size and number of iterations are as follows:(i)
SCA is the same as other swarm intelligence optimization algorithms. Compared with the algorithm of a single candidate solution, the candidate solution set of a certain size achieves a stronger search ability and the ability to escape the local optimal trap, and SCA has sufficient random search ability.(ii)
The optimal candidate solution is always retained during the iteration process and used as a basis for updating the candidate solution set, and there is a tendency to move to the optimal solution space during the search process.(iii)
The randomness of its global search and local development has stronger adaptability and stability than searching and developing in two stages.


## 3. Proposed Algorithm

In this section, the details of the proposed fusion multiobjective empire split algorithm (FMOESA) are documented. Particularly, the framework of the proposed algorithm is presented first in Section3.1. In the following, the different key stages in the algorithm are described.


### 3.1. Framework of the Proposed Algorithm

The first part of the algorithm is the initialization phase (lines 2–8 in Algorithm1). Consistent with most optimization algorithms, N individuals are randomly generated. Immediately after, the opposition-based learning is performed to obtain a reverse population. Then, the power of the existing 2N individuals is evaluated and the empire and colony are divided according to the value of power (lines 7–8 in Algorithm 1). The power assessment mechanism is described in detail in Section 3.4. At the end of the first phase, the N individuals with the greatest power value constitute the final initial population.Algorithm 1: Framework of the proposed FMOESA.
Input:N,FEmax,KOutput:X(1)
Part 1: Initialization(2)
evaluation=0(3)
InitializeN population (X)(4)
Execute the opposition-based learning operation(5)
Evaluate the fitness value of each individual(6)
evaluation=evaluation+2N(7)
Evaluate the power of each individual(8)
Select empires and then assign colonies to them(9)
Part 2: Iteration and Update(10)
whileevaluation<FEmaxdo(11)
Xnew = Reproduction (X)(12)
Evaluate the fitness value of each individualV(13)
evaluation=evaluation+N(14)
UnitX=X∪Xnew(15)
Evaluate the power of each individual inUnitX(16)
Redistributing the empire and their colonies according to the power(17)
ifempire<N(18)
Sort the colonies in reverse order(19)
X=empire∪N−empirecolonies(20)
else(21)
ifempire>N(22)
Implementing empire reduction strategy until the number of empires isN(23)
end if(24)
X=empire(25)
end if(26)
end while(27)
ReturnXThe second part of the algorithm is the iterative update phase (lines 10–26 in Algorithm1). If the maximum number of fitness evaluations (FEmax) is not reached, the iterative cycle is not terminated. First of all, the offspring population is generated through a fusion reproduction strategy (line 11 in Algorithm 1). The detailed steps of the fusion reproduction strategy are described in Section 3.3. After fitness and power evaluation, the empire and the colony are divided (lines 12–16 in Algorithm 1). If there are less than N empire individuals, the colony individuals are arranged in reverse order of power value, and (N−empire) individuals are selected as candidate solutions (lines 17–19 in Algorithm 1). If the number of empire individuals is equal to N, we assign all empire individuals to X as the parent population of the next iteration (line 24 in Algorithm 1). If the number of empire individuals is greater than N, the population is deleted to obtain the final N empires with better performance (lines 21–23 in Algorithm 1). Detailed empire reduction strategy is exhibited in Section 3.6.


### 3.2. Initialization Based on Opposition-Based Learning

Most of the traditional algorithms adopt the initialization method to generate the initial population. Due to the lack of prior knowledge, the probability of searching the population to a better area is greatly reduced. Opposition-based learning (OBL) [30] is an important method to enhance the performance of stochastic optimization algorithms, which greedily selects the fitness value of the objective function between the current solution and the backward solution population. In this way, the diversity of the population is enhanced, and the ability of the algorithm to approach the global optimal solution is improved.In this paper, a reverse population is obtained based on OBL after randomly generating an initial population. In the original population and the reverse population, the optimalN candidate solutions are selected to form the initial population of the algorithm. This strategy can obtain more suitable initialization candidate solutions without prior knowledge, thereby increasing the probability of the population exploring a better region. For an individual Xij=Xi1,Xi2,…,XiD in the population, its reverse solution is generated according to the following:(4)Xij′=aj+bj−Xij,where j=1,2,…,D and aj and bj are the maximum and minimum values in the j-th dimension decision variable, respectively. All the solutions in the original population X are reversed to generate a reverse population X′. In these two populations, N individuals are selected to form the final initial population based on individual power assessment. The detailed operation of individual power assessment is in Section 3.4.


### 3.3. Fusion Reproduction Strategy

In the algorithm, populationX consists of two parts, the empire individuals, and their colony individuals. In general, the individual empire is superior to the individual colony. Therefore, these two parts need to be updated with different evolution operators. In this paper, sine and cosine operator (SCA) is employed to generate offspring individuals for empire individuals. For colonial individuals, their goal is to move closer to the empire and to gain greater power. Therefore, the colony obtains better convergence through crossover operations with the empire, and then performs mutation operations to increase diversity. The crossover operation adopts simulated binary crossover (SBX) [31], and the mutation operation uses polynomial mutation (PM) [3]. The detailed operation steps are shown in Algorithm 2. It should be noted that each colony belongs to an empire. In SBX operation, the colony crosses its corresponding empire (line 6 in Algorithm 2).Algorithm 2:Xnew = reproduction (X).
Input:X,NOutput:Xnew(1)
for each Xi∈X(2)
ifXi∈empire(3)
Randomly choose an toPg(4)
Produce offspringXnewi according to equation (2)(5)
else(6)
Xtempi=SBXXi,empire(7)
Xnewi=PMXtempi(8)
end if(9)
end for(10)
ReturnXnewThrough the fusion reproduction strategy, sufficient information was exchanged not only between empires but also between colonies and empires. The former focuses on diversity, while the latter focuses on convergence.


### 3.4. Empire Power Evaluation Mechanism

The empire power evaluation mechanism includes two different evaluation methods. The first case is the assessment of the empire’s power during the initialization phase. The second case is the assessment of the empire’s power during the update iteration.In the initialization phase, convergence is generally poor, so the assessment of individual power is mainly based on convergence. For thei-th individual Xi in the population X, its power is calculated according to the following:(5)poweri=fi1+fi2+⋯+fim,where m is the number of objective functions.In the second stage, not only does the entire population need to improve convergence, but also diversity is important. Therefore, when evaluating individual power, it is necessary to consider both convergence and diversity. During the update iteration phase, for thei-th individual Xi in the population X, its power is calculated according to(6)poweri=−Ci+Di,Ci=Ci′−CminCmax−Cmin,Di=Di′−DminDmax−Dmin,where Ci′=fi1+fi2+⋯+fim and Cmax and Cmin are the maximum and minimum values of C, respectively. Similarly, Dmax and Dmin are the maximum and minimum values of D, respectively. Di′ is defined by the following equation:(7)Di′=minangleXi,empire,where angleA,B means the angle between A and B. Di′ means the minimum angle between Xi and all empires.It is worth noting that before calculating individual power, the convergence index (C) and the diversity index (D) need to be unified to the same order of magnitude. In other words, the value range of Ci and Di is 0,1; thus, the value range of power is 0,2. The greater power of Xi means that Xi has better convergence and diversity.


### 3.5. Empire Distribution Strategy

In the population, each individual has his own role: empire or colony. In the FMOESA, individuals are assigned to corresponding roles according to their nondominated level and power. First, all nondominated solutions in the population are selected as empires. Then, the remaining individuals are sorted in descending order according to the value of power. Finally, allocate colonial individuals among the remaining populations. The specific method is as follows: we pick the individual with the largest power at a time and then assign it to the nearest empire, until (N−empire) individuals are selected and assigned tasks are completed.It should be noted that the number of colonies contained in each empire is not fixed. That is, it is possible that some empires do not have colonial individuals, and some empires contain more than one colony individual.


### 3.6. Empire Reduction Strategy

In the later stages of the algorithm, the number of empires may exceedN. At this point, reduction strategies are essential. The main goal at this time is to select N better-performing solutions as the parent population of the next iteration. In this paper, N empires with high power are selected. The power of empire is evaluated according to (6). The empire with the lowest power is deleted one by one until the number of empires is N. The detailed steps are shown in Algorithm 3.Algorithm 3:empirenew = reduction (empire).
Input:empireOutput:empirenew(1)
empirenew=empire(2)
whileempirenew>Ndo(3)
Calculate the empire’s power according to equation (6).(4)
del=minpower(5)
Removeempirenewdel from empirenew(6)
end while(7)
Returnempirenew


## 3.1. Framework of the Proposed Algorithm

The first part of the algorithm is the initialization phase (lines 2–8 in Algorithm1). Consistent with most optimization algorithms, N individuals are randomly generated. Immediately after, the opposition-based learning is performed to obtain a reverse population. Then, the power of the existing 2N individuals is evaluated and the empire and colony are divided according to the value of power (lines 7–8 in Algorithm 1). The power assessment mechanism is described in detail in Section 3.4. At the end of the first phase, the N individuals with the greatest power value constitute the final initial population.Algorithm 1: Framework of the proposed FMOESA.
Input:N,FEmax,KOutput:X(1)
Part 1: Initialization(2)
evaluation=0(3)
InitializeN population (X)(4)
Execute the opposition-based learning operation(5)
Evaluate the fitness value of each individual(6)
evaluation=evaluation+2N(7)
Evaluate the power of each individual(8)
Select empires and then assign colonies to them(9)
Part 2: Iteration and Update(10)
whileevaluation<FEmaxdo(11)
Xnew = Reproduction (X)(12)
Evaluate the fitness value of each individualV(13)
evaluation=evaluation+N(14)
UnitX=X∪Xnew(15)
Evaluate the power of each individual inUnitX(16)
Redistributing the empire and their colonies according to the power(17)
ifempire<N(18)
Sort the colonies in reverse order(19)
X=empire∪N−empirecolonies(20)
else(21)
ifempire>N(22)
Implementing empire reduction strategy until the number of empires isN(23)
end if(24)
X=empire(25)
end if(26)
end while(27)
ReturnXThe second part of the algorithm is the iterative update phase (lines 10–26 in Algorithm1). If the maximum number of fitness evaluations (FEmax) is not reached, the iterative cycle is not terminated. First of all, the offspring population is generated through a fusion reproduction strategy (line 11 in Algorithm 1). The detailed steps of the fusion reproduction strategy are described in Section 3.3. After fitness and power evaluation, the empire and the colony are divided (lines 12–16 in Algorithm 1). If there are less than N empire individuals, the colony individuals are arranged in reverse order of power value, and (N−empire) individuals are selected as candidate solutions (lines 17–19 in Algorithm 1). If the number of empire individuals is equal to N, we assign all empire individuals to X as the parent population of the next iteration (line 24 in Algorithm 1). If the number of empire individuals is greater than N, the population is deleted to obtain the final N empires with better performance (lines 21–23 in Algorithm 1). Detailed empire reduction strategy is exhibited in Section 3.6.


## 3.2. Initialization Based on Opposition-Based Learning

Most of the traditional algorithms adopt the initialization method to generate the initial population. Due to the lack of prior knowledge, the probability of searching the population to a better area is greatly reduced. Opposition-based learning (OBL) [30] is an important method to enhance the performance of stochastic optimization algorithms, which greedily selects the fitness value of the objective function between the current solution and the backward solution population. In this way, the diversity of the population is enhanced, and the ability of the algorithm to approach the global optimal solution is improved.In this paper, a reverse population is obtained based on OBL after randomly generating an initial population. In the original population and the reverse population, the optimalN candidate solutions are selected to form the initial population of the algorithm. This strategy can obtain more suitable initialization candidate solutions without prior knowledge, thereby increasing the probability of the population exploring a better region. For an individual Xij=Xi1,Xi2,…,XiD in the population, its reverse solution is generated according to the following:(4)Xij′=aj+bj−Xij,where j=1,2,…,D and aj and bj are the maximum and minimum values in the j-th dimension decision variable, respectively. All the solutions in the original population X are reversed to generate a reverse population X′. In these two populations, N individuals are selected to form the final initial population based on individual power assessment. The detailed operation of individual power assessment is in Section 3.4.


## 3.3. Fusion Reproduction Strategy

In the algorithm, populationX consists of two parts, the empire individuals, and their colony individuals. In general, the individual empire is superior to the individual colony. Therefore, these two parts need to be updated with different evolution operators. In this paper, sine and cosine operator (SCA) is employed to generate offspring individuals for empire individuals. For colonial individuals, their goal is to move closer to the empire and to gain greater power. Therefore, the colony obtains better convergence through crossover operations with the empire, and then performs mutation operations to increase diversity. The crossover operation adopts simulated binary crossover (SBX) [31], and the mutation operation uses polynomial mutation (PM) [3]. The detailed operation steps are shown in Algorithm 2. It should be noted that each colony belongs to an empire. In SBX operation, the colony crosses its corresponding empire (line 6 in Algorithm 2).Algorithm 2:Xnew = reproduction (X).
Input:X,NOutput:Xnew(1)
for each Xi∈X(2)
ifXi∈empire(3)
Randomly choose an toPg(4)
Produce offspringXnewi according to equation (2)(5)
else(6)
Xtempi=SBXXi,empire(7)
Xnewi=PMXtempi(8)
end if(9)
end for(10)
ReturnXnewThrough the fusion reproduction strategy, sufficient information was exchanged not only between empires but also between colonies and empires. The former focuses on diversity, while the latter focuses on convergence.


## 3.4. Empire Power Evaluation Mechanism

The empire power evaluation mechanism includes two different evaluation methods. The first case is the assessment of the empire’s power during the initialization phase. The second case is the assessment of the empire’s power during the update iteration.In the initialization phase, convergence is generally poor, so the assessment of individual power is mainly based on convergence. For thei-th individual Xi in the population X, its power is calculated according to the following:(5)poweri=fi1+fi2+⋯+fim,where m is the number of objective functions.In the second stage, not only does the entire population need to improve convergence, but also diversity is important. Therefore, when evaluating individual power, it is necessary to consider both convergence and diversity. During the update iteration phase, for thei-th individual Xi in the population X, its power is calculated according to(6)poweri=−Ci+Di,Ci=Ci′−CminCmax−Cmin,Di=Di′−DminDmax−Dmin,where Ci′=fi1+fi2+⋯+fim and Cmax and Cmin are the maximum and minimum values of C, respectively. Similarly, Dmax and Dmin are the maximum and minimum values of D, respectively. Di′ is defined by the following equation:(7)Di′=minangleXi,empire,where angleA,B means the angle between A and B. Di′ means the minimum angle between Xi and all empires.It is worth noting that before calculating individual power, the convergence index (C) and the diversity index (D) need to be unified to the same order of magnitude. In other words, the value range of Ci and Di is 0,1; thus, the value range of power is 0,2. The greater power of Xi means that Xi has better convergence and diversity.


## 3.5. Empire Distribution Strategy

In the population, each individual has his own role: empire or colony. In the FMOESA, individuals are assigned to corresponding roles according to their nondominated level and power. First, all nondominated solutions in the population are selected as empires. Then, the remaining individuals are sorted in descending order according to the value of power. Finally, allocate colonial individuals among the remaining populations. The specific method is as follows: we pick the individual with the largest power at a time and then assign it to the nearest empire, until (N−empire) individuals are selected and assigned tasks are completed.It should be noted that the number of colonies contained in each empire is not fixed. That is, it is possible that some empires do not have colonial individuals, and some empires contain more than one colony individual.


## 3.6. Empire Reduction Strategy

In the later stages of the algorithm, the number of empires may exceedN. At this point, reduction strategies are essential. The main goal at this time is to select N better-performing solutions as the parent population of the next iteration. In this paper, N empires with high power are selected. The power of empire is evaluated according to (6). The empire with the lowest power is deleted one by one until the number of empires is N. The detailed steps are shown in Algorithm 3.Algorithm 3:empirenew = reduction (empire).
Input:empireOutput:empirenew(1)
empirenew=empire(2)
whileempirenew>Ndo(3)
Calculate the empire’s power according to equation (6).(4)
del=minpower(5)
Removeempirenewdel from empirenew(6)
end while(7)
Returnempirenew


## 4. Experimental and Discussion

In order to demonstrate the effectiveness of the proposed framework, we compare its results with respect to those obtained by MOEA/D [13], dMOPSO [32], NSGAII [11], MOEA/D-STM [33], and MOEA/D-ACD [34]. Firstly, the selected performance metrics and benchmark are introduced and then the experimental setup is presented. The corresponding parameter settings are shown in Table 1. Then, the performance comparison and convergence analysis on these MOEAs are demonstrated.Table 1
Parameter settings of all compared algorithms.
AlgorithmParameter settingsMOEA/DT=20,pc=0.5,pm=1/n,ηc=ηm=20dMOPSOT=20,agemax=2NSGAIIpc=0.9,pm=1/n,ηc=ηm=20MOEA/D-STMT=20,pc=0.5,pm=1/n,ηc=ηm=20MOEA/D-ACDCR=1,pc=0.5,pm=1/n,ηc=ηm=20,nr=2


### 4.1. Experimental Settings

We adopted eight test problems whose Pareto fronts have different characteristics. In these functions, convexity, concavity, disconnections, and multifrontality are included. The 2-objective test suite of Zitzler-Deb Thiele (ZDT) [35] (ZDI1, ZDT2, ZDT3, and ZDT6) is also adopted. For 3-objective functions, four functions are adopted which is taken from the Deb-Thiele-Laumanns Zitzler (DTLZ) test suite [36] (DTLZ1, DTLZ2, DTLZ4, and DTLZ7). We used 30 decision variables for ZDT1, ZDT2, and ZDT3. ZDT6 was tested using 10 decision variables. For DTLZ2 and DTLZ4, 12 variables were adopted. DTLZ1 and DTLZ7 were tested with 7 and 22 decision variables, respectively. The analysis on ZDT and DTLZ benchmark is presented at last.The general parameter settings are as follows: ZDT:m=2,N=100,FEmax=30000; DTLZ: m=3,N=210,FEmax=210000. All the algorithms run 30 times independently for each test function.


### 4.2. Performance Metric

In our experimental study, the widely used metrics inverted generational distance (IGD) [37] and hypervolume (HV) are chosen to evaluate the performance of each algorithm. They are used as performance metrics because they provide a joint measurement of both the convergence and diversity of the obtained solutions.The IGD metric is defined as follows. IfP∗ is a set of nondominated points uniformly distributed along the true Pareto front in the objective space and P is the obtained approximation set of nondominated solutions in the objective space from a MOEA, the IGD value for the approximation set is calculated by(8)IGDA,P∗=∑z∗∈P∗distz∗,PP∗,where distz∗,P is the minimum Euclidean distance between z∗ and points in P and P∗ is the cardinality of P∗.IfP∗ is large enough to represent the Pareto front, both diversity and convergence of the approximated set P could be measured using IGDP,P∗. If the approximated set P is close enough to the true Pareto front and cannot miss any part of the whole PF, the smaller values of this metric are obtained. The advantages of IGD measure include two aspects: one is its computational efficiency and the other is its generality. For an MOEA, a smaller IGD value is desirable. The low value of IGD indicates that the obtained solution set is close to the true Pareto front.The hypervolume (HV) metric is defined as the volume of the hypercube enclosed in the objective space by the reference point and every vector in the Pareto approximation setP. This is mathematically defined as follows:(9)HV=∪iVOLi|si∈P,where si is a nondominated vector from Pareto approximation set P, VOLi is the volume from the hypercube formed by the reference point and the nondominated vector si, and reference point is zref in the objective space.The HV metric is applied to access both convergence and maximum spread of the solutions for the Pareto approximation set obtained with any MOESs. In addition, lager values of this measure value that the solutions are closer to the true PF and that the solutions cover a wider extension of it. In this paper, the HV metric is calculated with respect to a given reference pointzref=z1ref,…,zmref. zref=2,2 is designed for ZDT test functions, zref=1,1,1 is used for DTLZ1 and zref=2,2,2 is used for DTLZ2 and DTLZ4, while zref=2,2,7 is designed for DTLZ7.


### 4.3. Results and Analysis

Table2 shows the mean and standard deviation (std) results on all the four ZDT and four DTLZ test instances in terms of the IGD metric. The Wilcoxon rank-sum test is recorded as p value in Table 2, and the results with confidence level 0.95 have been conducted based on the IGD values to assess the statistical significance. In Table 2, the symbols “+,” “=,” and “−,” respectively, indicate that FMOESA performances are statistically better than, equivalent to, and slightly worse than the compared algorithms.Table 2
IGD results on the eight problems.
FunctionFMOESAMOEA/DdMOPSONSGAIISTMACDZDT1Mean4.664E − 037.806E − 033.928E − 034.922E − 031.907E − 026.429E − 03Std5.834E − 048.352E − 043.765E − 052.585E − 043.583E − 035.734E − 03p value3.013E − 154.363E − 052.147E − 062.827E − 196.083E − 13ZDT2Mean4.205E − 032.984E − 026.926E − 024.354E − 031.847E − 021.548E − 02Std2.475E − 041.038E − 011.352E − 012.082E − 043.452E − 033.154E − 02p value1.193E − 028.068E − 035.093E − 141.748E − 209.273E − 05ZDT3Mean4.947E − 031.312E − 021.094E − 027.223E − 032.245E − 021.072E − 02Std3.073E − 045.587E − 037.298E − 047.734E − 035.827E − 036.863E − 03p value9.834E − 044.002E − 261.105E − 039.641E − 178.267E − 03ZDT6Mean2.315E − 031.928E − 031.788E − 032.606E − 031.509E − 022.101E − 03Std1.894E − 046.547E − 054.863E − 052.521E − 041.696E − 024.028E − 05p value1.945E − 051.356E − 179.137E − 053.905E − 027.302E − 05DTLZ1Mean4.119E − 021.824E − 023.201E + 001.920E − 028.202E + 002.868E − 02Std1.439E − 024.737E − 041.810E + 016.101E − 042.037E + 005.827E − 04p value2.938E − 108.076E − 084.466E − 103.082E − 186.286E − 10DTLZ2Mean4.380E − 024.579E − 024.751E − 025.424E − 027.442E − 024.661E − 02Std1.326E − 031.218E − 031.498E − 032.337E − 033.001E − 032.319E − 03p value2.270E − 055.386E − 097.156E − 171.090E − 293.917E − 09DTLZ4Mean1.486E − 015.106E − 021.517E − 015.373E − 021.582E − 015.704E − 02Std1.435E − 011.984E − 037.267E − 021.772E − 033.916E − 022.397E − 03p value5.681E − 043.569E − 018.324E − 041.729E − 019.143E − 04DTLZ7Mean4.943E − 021.926E − 011.256E − 016.809E − 025.321E − 021.275E − 01Std2.686E − 035.016E − 036.278E − 035.011E − 021.682E − 036.764E − 03p value3.672E − 362.579E − 306.788E − 035.156E − 013.582E − 3+/=/−5/0/35/1/26/0/26/2/05/0/3As shown, FMOESA is the most effective algorithm in terms of the number of the best results it obtains. MOEA/D performs very competitively to FMOESA.For the two-objective test function, FMOESA obtains the best performance on ZDT2 and ZDT3. The performance of dMOPSO is poor compared to that of its competitors, and it performs best only on ZDT1 and ZDT6. Our proposed FMOESA obtains significantly better performance than NSGAII and MOEA/D-STM. Except for ZDT6, the performance of MOEA/D and MOEA/D-ACD is worse than FMOESA.For the three-objective test function, FMOESA and MOEA/D have comparable performance. FMOESA shows clear improvements over the other four compared algorithms on DTLZ2 and DTLZ7. For MOEA/D, it obtains the best performance on DTLZ1 and DTLZ4. FMOESA performs slightly worse than NSGAII on DTLZ1 and DTLZ4. Except for the similar performance on DTLZ4 and DTLZ7, FMOESA performs better than MOEA/D-STM on other functions. MOEA/D-ACD and MOEA/D have similar performance on most of the test functions.As shown in Table3, the experimental results of HV value are similar to that of IGD value. FMOESA obtains the best value on four test functions, that is, ZDT2, ZDT3, DTLZ2, and DTLZ7. FMOESA performs slightly worse than dMOPSO on ZDT1 and ZDT6. On DTLZ1 and DTLZ4, the performance of MOEA/D and FMOESA is very competitive. Except for ZDT6, the performance of MOEA/D-ACD is worse than FMOESA.Table 3
HV results on the eight problems.
FunctionFMOESAMOEA/DdMOPSONSGAIISTMACDZDT1Mean9.153E − 019.127E − 019.171E − 019.158E − 019.154E − 019.136E − 01Std1.332E − 031.163E − 031.302E − 037.138E − 041.429E − 031.227E − 03p value1.112E − 022.627E − 072.347E − 101.352E − 011.945E − 02ZDT2Mean8.329E − 018.204E − 018.226E − 018.328E − 018.317E − 018.247E − 01Std1.128E − 035.862E − 022.643E − 031.207E − 031.745E − 032.729E − 03p value4.927E − 033.669E − 113.031E − 071.340E − 034.262E − 03ZDT3Mean9.498E − 019.458E − 019.426E − 019.495E − 019.491E − 019.477E − 01Std7.704E − 041.752E − 021.372E − 037.607E − 041.168E − 031.387E − 03p value3.684E − 083.061E − 117.797E − 016.908E − 047.265E − 10ZDT6Mean5.643E − 017.362E − 019.114E − 019.001E − 018.692E − 017.996E − 01Std4.163E − 019.525E − 023.214E − 022.613E − 038.137E − 025.208E − 02p value5.979E − 051.581E − 066.842E − 031.237E − 024.253E − 07DTLZ1Mean9.798E − 019.801E − 019.756E − 019.728E − 010.00E + 009.767E − 01Std1.974E − 047.796E − 045.778E − 047.884E − 040.00E + 003.662E − 04p value8.596E − 013.032E − 114.968E − 071.261E − 122.311E − 11DTLZ2Mean9.297E − 019.255E − 019.285E − 019.258E − 018.795E − 019.247E − 01Std1.135E − 038.147E − 041.074E − 039.258E − 046.853E − 036.286E − 03p value1.456E − 042.670E − 085.148E − 073.062E − 117.214E − 08DTLZ4Mean9.273E − 019.274E − 019.260E − 019.265E − 018.807E − 019.268E − 01Std8.437E − 041.056E − 039.468E − 041.003E − 039.221E − 033.109E − 03p value1.831E − 012.449E − 068.516E − 043.029E − 116.287E − 06DTLZ7Mean4.867E − 014.757E − 014.744E − 014.790E − 014.821E − 014.779E − 01Std7.964E − 033.742E − 031.980E − 022.376E − 032.536E − 032.817E − 03p value7.142E − 093.645E − 094.928E − 113.082E − 112.011E − 09+/=/−5/2/16/0/25/2/16/1/17/0/1To further compare the difference between FMOESA and the other compared algorithms, the Pareto fronts of some adopted test problems have been shown in Figures1–4 with clearer discrimination. In these figures, the blue dots represent the approximate Pareto front obtained by each algorithm, while the solid red line represents the true PF of the test function. These figures demonstrate the abilities of those algorithms in converging to the true Pareto front.Figure 1
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on ZDT2. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)Figure 2
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on ZDT3. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)Figure 3
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on DTLZ1. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)Figure 4
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on DTLZ7. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)As seen from the performance diagram of ZDT3, DTLZ1, and DTLZ7, our algorithm can well converge to its true PF, especially in DTLZ1, dMOPSO, and MOEA/D-STM may be trapped in local optimization and cannot well converge to the true PF. Besides, it can be observed that FMOESA produces better distribution than other algorithms, especially in ZDT2, ZDT3, and DTLZ7.


## 4.1. Experimental Settings

We adopted eight test problems whose Pareto fronts have different characteristics. In these functions, convexity, concavity, disconnections, and multifrontality are included. The 2-objective test suite of Zitzler-Deb Thiele (ZDT) [35] (ZDI1, ZDT2, ZDT3, and ZDT6) is also adopted. For 3-objective functions, four functions are adopted which is taken from the Deb-Thiele-Laumanns Zitzler (DTLZ) test suite [36] (DTLZ1, DTLZ2, DTLZ4, and DTLZ7). We used 30 decision variables for ZDT1, ZDT2, and ZDT3. ZDT6 was tested using 10 decision variables. For DTLZ2 and DTLZ4, 12 variables were adopted. DTLZ1 and DTLZ7 were tested with 7 and 22 decision variables, respectively. The analysis on ZDT and DTLZ benchmark is presented at last.The general parameter settings are as follows: ZDT:m=2,N=100,FEmax=30000; DTLZ: m=3,N=210,FEmax=210000. All the algorithms run 30 times independently for each test function.


## 4.2. Performance Metric

In our experimental study, the widely used metrics inverted generational distance (IGD) [37] and hypervolume (HV) are chosen to evaluate the performance of each algorithm. They are used as performance metrics because they provide a joint measurement of both the convergence and diversity of the obtained solutions.The IGD metric is defined as follows. IfP∗ is a set of nondominated points uniformly distributed along the true Pareto front in the objective space and P is the obtained approximation set of nondominated solutions in the objective space from a MOEA, the IGD value for the approximation set is calculated by(8)IGDA,P∗=∑z∗∈P∗distz∗,PP∗,where distz∗,P is the minimum Euclidean distance between z∗ and points in P and P∗ is the cardinality of P∗.IfP∗ is large enough to represent the Pareto front, both diversity and convergence of the approximated set P could be measured using IGDP,P∗. If the approximated set P is close enough to the true Pareto front and cannot miss any part of the whole PF, the smaller values of this metric are obtained. The advantages of IGD measure include two aspects: one is its computational efficiency and the other is its generality. For an MOEA, a smaller IGD value is desirable. The low value of IGD indicates that the obtained solution set is close to the true Pareto front.The hypervolume (HV) metric is defined as the volume of the hypercube enclosed in the objective space by the reference point and every vector in the Pareto approximation setP. This is mathematically defined as follows:(9)HV=∪iVOLi|si∈P,where si is a nondominated vector from Pareto approximation set P, VOLi is the volume from the hypercube formed by the reference point and the nondominated vector si, and reference point is zref in the objective space.The HV metric is applied to access both convergence and maximum spread of the solutions for the Pareto approximation set obtained with any MOESs. In addition, lager values of this measure value that the solutions are closer to the true PF and that the solutions cover a wider extension of it. In this paper, the HV metric is calculated with respect to a given reference pointzref=z1ref,…,zmref. zref=2,2 is designed for ZDT test functions, zref=1,1,1 is used for DTLZ1 and zref=2,2,2 is used for DTLZ2 and DTLZ4, while zref=2,2,7 is designed for DTLZ7.


## 4.3. Results and Analysis

Table2 shows the mean and standard deviation (std) results on all the four ZDT and four DTLZ test instances in terms of the IGD metric. The Wilcoxon rank-sum test is recorded as p value in Table 2, and the results with confidence level 0.95 have been conducted based on the IGD values to assess the statistical significance. In Table 2, the symbols “+,” “=,” and “−,” respectively, indicate that FMOESA performances are statistically better than, equivalent to, and slightly worse than the compared algorithms.Table 2
IGD results on the eight problems.
FunctionFMOESAMOEA/DdMOPSONSGAIISTMACDZDT1Mean4.664E − 037.806E − 033.928E − 034.922E − 031.907E − 026.429E − 03Std5.834E − 048.352E − 043.765E − 052.585E − 043.583E − 035.734E − 03p value3.013E − 154.363E − 052.147E − 062.827E − 196.083E − 13ZDT2Mean4.205E − 032.984E − 026.926E − 024.354E − 031.847E − 021.548E − 02Std2.475E − 041.038E − 011.352E − 012.082E − 043.452E − 033.154E − 02p value1.193E − 028.068E − 035.093E − 141.748E − 209.273E − 05ZDT3Mean4.947E − 031.312E − 021.094E − 027.223E − 032.245E − 021.072E − 02Std3.073E − 045.587E − 037.298E − 047.734E − 035.827E − 036.863E − 03p value9.834E − 044.002E − 261.105E − 039.641E − 178.267E − 03ZDT6Mean2.315E − 031.928E − 031.788E − 032.606E − 031.509E − 022.101E − 03Std1.894E − 046.547E − 054.863E − 052.521E − 041.696E − 024.028E − 05p value1.945E − 051.356E − 179.137E − 053.905E − 027.302E − 05DTLZ1Mean4.119E − 021.824E − 023.201E + 001.920E − 028.202E + 002.868E − 02Std1.439E − 024.737E − 041.810E + 016.101E − 042.037E + 005.827E − 04p value2.938E − 108.076E − 084.466E − 103.082E − 186.286E − 10DTLZ2Mean4.380E − 024.579E − 024.751E − 025.424E − 027.442E − 024.661E − 02Std1.326E − 031.218E − 031.498E − 032.337E − 033.001E − 032.319E − 03p value2.270E − 055.386E − 097.156E − 171.090E − 293.917E − 09DTLZ4Mean1.486E − 015.106E − 021.517E − 015.373E − 021.582E − 015.704E − 02Std1.435E − 011.984E − 037.267E − 021.772E − 033.916E − 022.397E − 03p value5.681E − 043.569E − 018.324E − 041.729E − 019.143E − 04DTLZ7Mean4.943E − 021.926E − 011.256E − 016.809E − 025.321E − 021.275E − 01Std2.686E − 035.016E − 036.278E − 035.011E − 021.682E − 036.764E − 03p value3.672E − 362.579E − 306.788E − 035.156E − 013.582E − 3+/=/−5/0/35/1/26/0/26/2/05/0/3As shown, FMOESA is the most effective algorithm in terms of the number of the best results it obtains. MOEA/D performs very competitively to FMOESA.For the two-objective test function, FMOESA obtains the best performance on ZDT2 and ZDT3. The performance of dMOPSO is poor compared to that of its competitors, and it performs best only on ZDT1 and ZDT6. Our proposed FMOESA obtains significantly better performance than NSGAII and MOEA/D-STM. Except for ZDT6, the performance of MOEA/D and MOEA/D-ACD is worse than FMOESA.For the three-objective test function, FMOESA and MOEA/D have comparable performance. FMOESA shows clear improvements over the other four compared algorithms on DTLZ2 and DTLZ7. For MOEA/D, it obtains the best performance on DTLZ1 and DTLZ4. FMOESA performs slightly worse than NSGAII on DTLZ1 and DTLZ4. Except for the similar performance on DTLZ4 and DTLZ7, FMOESA performs better than MOEA/D-STM on other functions. MOEA/D-ACD and MOEA/D have similar performance on most of the test functions.As shown in Table3, the experimental results of HV value are similar to that of IGD value. FMOESA obtains the best value on four test functions, that is, ZDT2, ZDT3, DTLZ2, and DTLZ7. FMOESA performs slightly worse than dMOPSO on ZDT1 and ZDT6. On DTLZ1 and DTLZ4, the performance of MOEA/D and FMOESA is very competitive. Except for ZDT6, the performance of MOEA/D-ACD is worse than FMOESA.Table 3
HV results on the eight problems.
FunctionFMOESAMOEA/DdMOPSONSGAIISTMACDZDT1Mean9.153E − 019.127E − 019.171E − 019.158E − 019.154E − 019.136E − 01Std1.332E − 031.163E − 031.302E − 037.138E − 041.429E − 031.227E − 03p value1.112E − 022.627E − 072.347E − 101.352E − 011.945E − 02ZDT2Mean8.329E − 018.204E − 018.226E − 018.328E − 018.317E − 018.247E − 01Std1.128E − 035.862E − 022.643E − 031.207E − 031.745E − 032.729E − 03p value4.927E − 033.669E − 113.031E − 071.340E − 034.262E − 03ZDT3Mean9.498E − 019.458E − 019.426E − 019.495E − 019.491E − 019.477E − 01Std7.704E − 041.752E − 021.372E − 037.607E − 041.168E − 031.387E − 03p value3.684E − 083.061E − 117.797E − 016.908E − 047.265E − 10ZDT6Mean5.643E − 017.362E − 019.114E − 019.001E − 018.692E − 017.996E − 01Std4.163E − 019.525E − 023.214E − 022.613E − 038.137E − 025.208E − 02p value5.979E − 051.581E − 066.842E − 031.237E − 024.253E − 07DTLZ1Mean9.798E − 019.801E − 019.756E − 019.728E − 010.00E + 009.767E − 01Std1.974E − 047.796E − 045.778E − 047.884E − 040.00E + 003.662E − 04p value8.596E − 013.032E − 114.968E − 071.261E − 122.311E − 11DTLZ2Mean9.297E − 019.255E − 019.285E − 019.258E − 018.795E − 019.247E − 01Std1.135E − 038.147E − 041.074E − 039.258E − 046.853E − 036.286E − 03p value1.456E − 042.670E − 085.148E − 073.062E − 117.214E − 08DTLZ4Mean9.273E − 019.274E − 019.260E − 019.265E − 018.807E − 019.268E − 01Std8.437E − 041.056E − 039.468E − 041.003E − 039.221E − 033.109E − 03p value1.831E − 012.449E − 068.516E − 043.029E − 116.287E − 06DTLZ7Mean4.867E − 014.757E − 014.744E − 014.790E − 014.821E − 014.779E − 01Std7.964E − 033.742E − 031.980E − 022.376E − 032.536E − 032.817E − 03p value7.142E − 093.645E − 094.928E − 113.082E − 112.011E − 09+/=/−5/2/16/0/25/2/16/1/17/0/1To further compare the difference between FMOESA and the other compared algorithms, the Pareto fronts of some adopted test problems have been shown in Figures1–4 with clearer discrimination. In these figures, the blue dots represent the approximate Pareto front obtained by each algorithm, while the solid red line represents the true PF of the test function. These figures demonstrate the abilities of those algorithms in converging to the true Pareto front.Figure 1
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on ZDT2. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)Figure 2
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on ZDT3. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)Figure 3
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on DTLZ1. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)Figure 4
The approximate front of FMOESA, MOEA/D, dMOPSO, NSGAII, MOEA/D-STM, and MOEA/D-ACD on DTLZ7. (a) FMOESA, (b) MOEA/D, (c) dMOPSO, (d) NSGAII, (e) MOEA/D-STM, and (f) MOEA/D-ACD.
(a)(b)(c)(d)(e)(f)As seen from the performance diagram of ZDT3, DTLZ1, and DTLZ7, our algorithm can well converge to its true PF, especially in DTLZ1, dMOPSO, and MOEA/D-STM may be trapped in local optimization and cannot well converge to the true PF. Besides, it can be observed that FMOESA produces better distribution than other algorithms, especially in ZDT2, ZDT3, and DTLZ7.


## 5. Conclusion and Future Work

In this paper, a fusion multiobjective empire split algorithm has been proposed. In the proposed algorithm, the opposition-based learning is adapted in the initialization phase. In this way, the diversity of the initial population is enhanced, and the ability of the algorithm to approach the global optimal solution is enhanced. Then, a fusion reproduction strategy is utilized to produce high-quality offspring population. Inspired by the ICA, individuals with better convergence and diversity are identified as empire individuals in the selection mechanism. This process marked the demise of the old empires and the birth of new empires. Finally, a novel type of power evaluation mechanism was proposed to select candidate solutions with superior performance. For quantifying the performance of the proposed algorithm, a series of well-designed experiments are performed against peer competitors, which include four state-of-the-art MOEAs competitors and four multiobjective evolutionary algorithm competitors, upon a couple of widely used benchmark test suites with 2-, and 3-objective. It is demonstrated by the experimental results that FMOESA is quite competitive on the majority of all the test instances. FMOESA especially shows significant improvement over other peer algorithms in terms of the distribution of the obtained solutions.In future research, we will investigate into more effective mechanisms for the selection process. Also, we will put efforts into the MOPs with irregularly shaped Pareto fronts.



---

*Source: 8882086-2020-12-14.xml*