 # MOEA/D with Angle-based Constrained Dominance Principle for Constrained Multi-objective Optimization Problems

This paper proposes a novel constraint-handling mechanism named angle-based constrained dominance principle (ACDP) embedded in a decomposition-based multi-objective evolutionary algorithm (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). To maintain the diversity of the working population, ACDP utilizes the information of the angle of solutions to adjust the dominance relation of solutions during the evolutionary process. This paper uses 14 benchmark instances to evaluate the performance of the MOEA/D with ACDP (MOEA/D-ACDP). Additionally, an engineering optimization problem (which is I-beam optimization problem) is optimized. The proposed MOEA/D-ACDP, and four other decomposition-based CMOEAs, including C-MOEA/D, MOEA/D-CDP, MOEA/D-Epsilon and MOEA/D-SR are tested by the above benchmarks and the engineering application. The experimental results manifest that MOEA/D-ACDP is significantly better than the other four CMOEAs on these test instances and the real-world case, which indicates that ACDP is more effective for solving CMOPs.

## Authors

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

Multi-objective optimization problems (MOPs) involve the optimization of more than one objective function. In the real world, many optimization problems invariably involve a number of constraints and a multiple conflicting objectives. In general, a CMOP can mathematically be described as follows:

 ⎧⎪ ⎪ ⎪⎨⎪ ⎪ ⎪⎩minimizeF(x)=(f1(x),…,fm(x))Tsubject togi(x)≥0,i=1,…,qhj(x)=0,j=1,…,px∈Rn (1)

where is an

-dimensional objective vector,

is the inequality constraint, and is the equality constraint. is an -dimensional decision vector. The feasible region is defined as the set and .

In CMOPs, there are usually more than one constraint. To demonstrate the degree of constraint violation, these constraints are commonly summarized into a scalar value as follows:

 ϕ(x)=q∑i=1|min(gi(x),0)|+p∑j=1|hj(x)| (2)

when , the solution is feasible, otherwise it is infeasible.

For any two feasible solutions and of a CMOP, it can be said that dominates if the following condition is met:

 ∀i fi(xa)≤fi(xb)  and  ∃j fj(xa)

where . If there exists a solution , which dominates any other solutions in , can be said as a Pareto optimal solution. The set of all Pareto optimal solution belonging to is called as Pareto set (PS). The set of the mapping vectors of PS in the objective space is named as Pareto front (PF), which can be defined in the form of .

CMOPs are consist of a few objectives and constraints. To solve CMOPs, the constraint-handling technique should be applied to the framework of multi-objective evolutionary algorithm (MOEA).

According to different selection strategies, MOEAs mainly can be classified into three types: (1) Pareto-domination-based; (2) decomposition-based; (3) indicator-based. The typical examples of domination-based MOEAs include NSGA-II

996017 , MOGA Murata1995MOGA , PAES-II corne2001pesa , SPEA-II zitzler2001spea2 and NPGA Horn2002A . In recent years, decomposition-based MOEAs attract a lot of attention. The most representative algorithm of this type is MOEA/D Zhang:2007va . Some variants of MOEA/D include MOEA/D-DE Li:2009vo , MOEA/D-M2M Liu:2014jb , EAG-MOEA/D Cai:2015gi and MOEA/D-SAS Cai:2016ii . For indicator-based MOEAs, they use a scalar metric to assist the selection, typical examples of this type are IBEA Zitzler:2004tm , SMS-EMOA Beume2007SMS , HypE Bader2011Hype and FV-MOEA Jiang:2015hj .

To solve CMOPs, constraint-handling mechanisms are important. In recent years, many different constraint-handling mechanisms have been proposed Cai:2013iz ; Hu:2013kc . According to CoelloCoello20021245 , constraint-handling techniques can be generally classified into (1) penalty functions; (2) special representations and operators; (3) repair algorithms; (4) separate objectives and constraints; and (5) hybrid methods.

As a representative objective-constraint separating method, constrained-domination principle (CDP) proposed in 996017 is widely used. It solves CMOPs by treating constraints as the top priority. Stochastic ranking runarsson2000stochastic , -constrained method Takahama2006cons and non-greedy constraint-handling technique singh2010c are also in this category.

Currently, CTPs deb2001multi and CFs zhang2008multiobjective are the most widely used CMOP test instances. The common characteristic of these benchmarks is that they all have large feasible regions in the objective space. However, constraint-handling mechanisms do not work when the working population falls in feasible regions, so these two series of instances are not actually suitable for testing the effectiveness of constraint-handling mechanisms.

The rest of this paper is organized as follows: Section 2 briefly introduces MOEA/D and four other decomposition-based CMOEAs. Section 3 introduces the details of the angle-based constrained dominance principle embedded in MOEA/D. Section 4 gives comprehensive experimental results of the proposed algorithm MOEA/D-ACDP and four other CMOEAs on LIR-CMOPs and the I-beam optimization problem. Finally, conclusions are made in section 5.

## 2 Relative Work

### 2.1 Moea/d

In the original framework of MOEA/D Zhang:2007va

, given a series of uniform distributed weight vectors, a MOP is decomposed into

scalar subproblems (SOPs), and each SOP relates to one solution. In MOEA/D, a set of uniformly spread weight vectors is initially generated for subproblems. A weight vector satisfies the following conditions:

 m∑k=1λik=1andλik≥0for each k∈{1,…,m}. (4)

There are several approaches to decompose a MOP into a number of scalar optimization subproblems Zhang:2007va ; miettinen1999nonlinear . Three decomposition approaches, including weighted sum miettinen1999nonlinear , Tchebycheff miettinen1999nonlinear and boundary intersection approaches Zhang:2007va are commonly used. In this paper, Tchebycheff decomposition method is used in the MOEA/D framework. The -th subproblem is defined as follows:

 minimize gte(x|λ,z∗)=max1≤i≤m{1λji|fi(x)−z∗i|} (5) subject to x∈S

where is the ideal point, and .

### 2.2 Decomposition-based CMOEAs

Decomposition-based CMOEAs combine the MOEA/D with different constraint-handling mechanisms. In this paper, we introduce four representative decomposition-based CMOEAs including C-MOEA/D Asafuddoula2012An , MOEA/D-CDP jan2013study , MOEA/D-Epsilon Yang2014Epsilon , and MOEA/D-SR jan2013study .

• C-MOEA/D Asafuddoula2012An uses a variant of the epsilon constraint-handling technique. In this technique, the epsilon level is set to handle constraints according to the constraint violation and the proportion of feasible solutions in the current population. When comparing any two solutions, if overall constraint violations of the solutions are both less than the epsilon level, the one with a better aggregation value dominates the other. Otherwise, the one with a smaller overall constraint violation dominates the other.

• MOEA/D-CDP jan2013study uses CDP 996017 to judge the domination relationship between two arbitrary solutions. CDP can be simply summarized as following three rules:
1) When two feasible solutions are compared, the one with a better aggregation value dominates the other.
2) When a feasible solution is compared with an infeasible solution, the feasible solution dominates the infeasible solution.
3) When two infeasible solutions are compared, the one with a smaller degree of constraint violation dominates the other.
The second and the third rules can be combined as a single rule: When at least one of two compared solutions is infeasible, the one with a smaller degree of constraint violation dominates the other.

• MOEA/D-Epsilon Yang2014Epsilon uses the original epsilon constraint-handling technique. The epsilon level setting can be referred to Takahama2006cons . With the generation counter increasing, the epsilon level will dynamically decrease.

• MOEA/D-SR jan2013study embeds the stochastic ranking method (SR) runarsson2000stochastic in MOEA/D to deal with constraints. A threshold parameter is set to balance the selection between the objectives and the constraints in MOEA/D-SR. When comparing two solutions, if a random number in is less than , the one with a better aggregation value is retained into the next generation. If the random number in is greater than , the whole framework of MOEA/D-SR is similar to that of MOEA/D-CDP. In the case of , MOEA/D-SR is equivalent to MOEA/D-CDP.

## 3 MOEA/D with Angle-based Constrained Dominance Principle

In this section, the definition of the proposed ACDP and the effectiveness of this mechanism in MOEA/D are detailed.

### 3.1 Angle-based Constrained Dominance Principle

In the CDP approach 996017 , with its three basic rules, the overall constraint violation is the most important factor during the evolutionary process, and some useful information in the infeasible regions tends to be ignored.

The angle between any two solutions in the objective space is useful information, which is related to the similarity between these two solutions. The definition of angle between any two solutions and is given as follows:

 angle(x1,x2,z∗)=arccos((F(x1)−z∗)T⋅(F(x2)−z∗)||F(x1)−z∗||⋅||F(x2)−z∗||) (6)

where is the ideal point, and . is the two-norm of a vector.

As shown in Fig. 1, given any two solutions and , the angle between them in the objective space is . Obviously, the angle between any two solutions is less than or equal to , which means that the range of angle between any two solutions belongs in

Given any two solutions and , an threshold of angle , a random number and a parameter () which denotes the proportion of feasible solutions in the current population, the ACDP is defined as follows:

1. If and are both feasible, the one dominating the other is better.

2. If there is at lease one infeasible solution and , the one with a smaller constraint violation dominates the other.

3. When there is at least one infeasible solution and , if , the one dominating the other is better, otherwise, they are incomparable.

### 3.2 ACDP in the framework of MOEA/D

As we know, MOEA/D uses the value of decomposition function of a solution to update its neighbors. In order to use ACDP to handle constraints in the framework of MOEA/D, here we provide a version of ACDP which is suitable to the algorithm.

Given a subproblem with the weight vector , for two solutions and , their overall constraint violations are and , and their decomposition values on the subproblem are and . The ACDP dominance in the framework of MOEA/D is defined as follows:

 x1⪯θx2⇔ ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩Rule 1 if  ϕ1=0, ϕ2=0:      gte(x1|λ,z∗)θ,r

where is a threshold parameter, which is defined by users. In Eq. (7), the constraint-handling method ACDP is equivalent to CDP 996017 when .

In Rule 1 of ACDP, when these two solutions are both feasible, the solution with a lower aggregation value dominates the other, which is similar to the first rule of CDP.

When at least one of and is infeasible, CDP only utilizes the constraint violations of these two solutions to compare, which is difficult to keep the diversity of the working population when most of solutions in the population are infeasible. Nevertheless, ACDP utilizes additional information to compare the two solutions, which includes the angle between the two compared solutions in the objective space and the proportion of feasible solutions in the current population (). More details of ACDP in this situation are listed as follows:

• In Rule 2 of ACDP, if the angle between and in the objective space is smaller than the parameter , ACDP considers that these two solutions are similar and compares them according to their constraint violations. Because these two solutions are similar, based on the framework of MOEA/D, they will be considered to relate to the same subproblem. In this situation, using the constraint violations to compare the two solutions will not cause the loss of the diversity.

• In Rule 3 of ACDP, if the angle between and in the objective space is larger than the parameter

, ACDP considers that these two solutions are dissimilar, and the solution with a lower decomposition value will dominate the other with a probability of

. Some solutions with low aggregation values but large constraint violations will have a chance to be selected in the next generation, which can enhance the convergence of the working population effectively.

• The probability in Rule 3 of ACDP is set to be the proportion of feasible solutions in the current population. It keeps the balance of the exploration of the working population between infeasible regions and feasible regions. When is large, ACDP tends to explore infeasible regions. When is small, ACDP tends to explore feasible regions.

### 3.3 Effectiveness of ACDP in MOEA/D

The evolutionary process of a CMOEA can be generally divided in three stages according to the status of the working population.

In the first stage, a population is generated randomly, and most of the individuals are far away from the real PF as shown in Fig. 2 (a) and Fig. 2 (b).

In the second stage, the working population begins to explore the search space. As shown in Fig. 2 (c), when using CDP in MOEA/D, the working population will be attracted to feasible regions and actually difficult to get across infeasible regions. As shown in Fig. 2 (d), when ACDP is applied to MOEA/D, the working population can maintain the diversity by using angle information. Some individuals can enter infeasible regions, which can help the working population to go across infeasible regions effectively. Additionally, ACDP uses the information of the proportion of feasible solutions in the current population as the probability to select solutions, which can help to balance the search between feasible and infeasible regions.

In the third stage, the working population will converge to its near feasible regions. when using CDP, the population is trapped into local optimum, because of the difficulty to get across infeasible regions in the second stage, as shown in Fig. 2 (e). Conversely, when using ACDP, the working population can converge to the real PF more completely as shown in Fig. 2 (f), because the population can keep the diversity and explore infeasible regions in the second stage. Figure 2: Illustrations of the evolutionary process of MOEA/D with CDP and ACDP.

### 3.4 The Parameter Setting of Theta

In the early stage of evolutionary process, the population is commonly far away from real PF. To prevent the population from being trapped into local optimum, the value of should be set small to maintain the diversity. In the later stage of evolutionary process, the convergence to the feasible regions should be emphasized, then the value of should become larger. Based on the above discussions, the threshold should be dynamically increased with the generation counter increasing. A method of setting is proposed as follows:

 θ(k)= ⎧⎨⎩θ0(1+kTmax)cp,1≤k≤Tcπ2,Tc

where is an initial threshold value which is set as , is the size of population and is the maximum generation. is a parameter, which is set as 0.8. is the termination generation to control . Parameter is initialized to .

As we know, the uniform weight vectors defined in Eq. (4) decide that the maximum angle between two vectors is , and the average angle between two adjacent vectors is , where is the size of population. Then, is initially set as . According to Eq. (8), when the generation counter reaches , the value of is , and keeps constant afterwards. As shown in Fig. 3, we assume that the population size and the maximum generation are set as 300 and 500, respectively. Meanwhile is set as 0.8. We can find that . In the early stage of evolutionary process, increases continuously but slowly. It benefits the population to maintain diversity. When gets more and more closed to , rises faster, which helps to accelerate the convergence speed to the feasible regions. When reaches , is equal to , ACDP is transformed into CDP.

### 3.5 ACDP embedded in MOEA/D

The proposed MOEA/D-ACDP integrates the general framework of MOEA/D and the angle-based constrained dominance principle.

The psuecode of MOEA/D-ACDP is listed in Algorithm 1. Lines 1-5 initialize some parameters in MOEA/D-ACDP. First, a CMOP is decomposed into subproblems which are associated with weight vectors . Then the population , the initial increasing factor , the ideal point and the neighbor indexes are initialized. Lines 7-11 update the angle threshold value . Line 12 updates the proportion of feasible solutions in the current population . Lines 13-23 generate a set of new solutions and update the ideal point . To be more specific, lines 14-21 determine the set of neighboring solutions that may be updated by a newly generated solution . In line 22, the differential evolution (DE) crossover operator is adopted to generate a new solution . Meanwhile, is further mutated by the polynomial mutation operator. The ideal point is updated in line 23. Lines 24-39 update subproblems. In line 27, the subproblems are updated based on the ACDP approach whose detailed psuecode is listed in Algorithm 2. At the end of each generation, non-dominated solutions () in the population are selected to update the external archive based on non-dominated sorting in line 31.

In Algorithm 2, the algorithm updates a subproblem in terms of Eq. (7). Lines 3-7 denote that when two feasible solutions and are compared, the one with a better aggregation value is selected. Lines 9-12 denote that when at least one of two solutions and is infeasible, if the angle between them in the objective space is lower than , the solution with a lower constraint violation is selected. Lines 13-17 denote that when at least one of two solutions and is infeasible, if the angle between them in the objective space is larger than , the solution with a lower aggregation value will be selected with a probability of .

## 4 Experimental Study

### 4.1 Test Instances LIR-CMOPs

To evaluate the performance of the proposed MOEA/D-ACDP, 14 constrained multi-objective test problems with large infeasible regions in the objective space are used fan2016difficulty ; Fan2017A .

The general characteristic of LIR-CMOPs is that their real PFs are blocked by a number of large infeasible regions, and thus hard to be found during an evolutionary process. Their constraint functions are comprised of controllable shape functions and distance functions Huband:2006hi . More specifically, the shape functions are used to turn the PF shapes as convex or concave, while the distance functions are adopted to adjust the convergence difficulty for CMOEAs. Fig. 4 and Fig. 5 plot the feasible regions of LIR-CMOPs with two or three objectives, respectively.

### 4.2 Real-world Engineering Optimization: I-beam

To evaluate the performance of MOEA/D-ACDP for solving real world optimization problems, an engineering optimization problem with two conflicting objectives is studied.

As defined in Osyczka1985Multicriteri , an optimization problem of I-beam is a bi-objective constrained optimization problem which needs to minimize the following objectives simultaneously:
1. Cross section area of the beam;
2. Static deflection of the beam for the displacement under the force .

To study the landscape in the objective space of the I-beam optimization problem, 1,000,000 sampling solutions are generated, where 850,000 solutions are generated randomly, and the other 150,000 solutions are generated by MOEA/D-ACDP. In Fig. 6, it is observed that there exist a few infeasible regions (the proportion of feasible solutions in all sampling solutions , which means that nearly a half of selected points are infeasible.) in the objective space for the I-beam optimization problem.

### 4.3 Experimental Settings

To evaluate the performance of the proposed MOEA/D-ACDP, four popular CMOEAs (C-MOEA/D, MOEA/D-CDP, MOEA/D-Epsilon and MOEA/D-SR), with differential evolution (DE) crossover operator, are adopted and tested on LIR-CMOP1-14 and I-beam optimization problem. The detailed parameters are listed as follows:

1. Mutation probability ( is the number of decision variables) and its distribution index is set to 20. For DE operator, , .

2. Population size: . Neighborhood size: .

3. Stopping condition: each algorithm runs for 30 times independently, and stops when 150,000 function evaluations are reached.

4. Probability of selecting individuals in the neighborhood: .

5. The maximal number of solutions replaced by a child: .

6. Parameter setting in MOEA/D-ACDP: and .

7. Parameter setting in MOEA/D-Epsilon: , and .

8. Parameter setting in MOEA/D-SR: .

### 4.4 Performance Metric

To measure the performance of MOEA/D-ACDP, C-MOEA/D, MOEA/D-CDP, MOEA/D-Epsilon and MOEA/D-SR, two widely used metrics inverted generation distance () Bosman2003The and hypervolume () Zitzler1999Multiobjective

are adopted as evaluation metrics. Their definitions are listed as follows.

• Inverted Generational Distance ():

is a metric which evaluates the performance related to convergence and diversity simultaneously. Let be a set of uniformly distributed points in the ideal PF. Let denote an approximate PF achieved by a certain CMOEA. The metric that represents average distance from to is defined as:

 ⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩IGD(P∗,A)=∑y∗∈P∗d(y∗,A)|P∗|d(y∗,A)=miny∈A{√∑mi=1(y∗i−yi)2} (9)

In our experiment, for CMOPs with two objectives, 1000 points are sampled uniformly from the PF to constitute . For CMOPs with three objectives, 10000 points are sampled uniformly from the PF to constitute . A smaller represents a better performance regarding to both diversity and convergence.

• Hypervolume ():

reflects the closeness between the non-dominated set achieved by a CMOEA and the representative PF. The larger means that the corresponding non-dominated set is closer to the true PF.

 HV(S)=VOL(⋃x∈S[f1(x),zr1]×...[fm(x),zrm]) (10)

where is the Lebesgue measure, is a reference point in the objective space. For the test instances LIR-CMOPs, the reference point is set as 1.4 times the nadir point of the real PF. The with a larger value represents the better performance regarding to both diversity and convergence.

As the real PF of the I-beam optimization problem is not known, metric can not be calculated. The experiment uses the metric Zitzler1999Multiobjective to measure the performance of these CMOEAs. In the I-beam optimization case, the reference point is set as .

### 4.5 Discussion of Experimental Results

#### 4.5.1 Performance Evaluation on LIR-CMOP Test Instances

The results of the values on LIR-CMOP1-14 achieved by five CMOEAs in 30 independent runs are shown in Table 1.

As discussed in Section 4, LIR-CMOP1-14 all have large infeasible regions in their objective space. For LIR-CMOP3-14, MOEA/D-ACDP significantly outperforms the other four compared algorithms in terms of the metric. For LIR-CMOP1-2, MOEA/D-ACDP significantly outperforms C-MOEA/D, MOEA/D-CDP and MOEA/D-Epsilon.

The results of the values on LIR-CMOP1-14 achieved by five CMOEAs in 30 independent runs are shown in Table 2. For LIR-CMOP2-14, MOEA/D-ACDP significantly outperforms the compared algorithms in terms of the metric. For the LIR-CMOP1, MOEA/D-ACDP significantly outperforms C-MOEA/D, MOEA/D-CDP and MOEA/D-Epsilon.

Fig. 7 (a) shows the final external archives achieved by MOEA/D-ACDP and other four CMOEAs with the median values on LIR-CMOP3 during 30 independent runs. It is obvious that MOEA/D-ACDP can almost converge to the whole real PF and has the best diversity among the five CMOEAs.

In Fig. 7 (b), the results of each CMOEA with the median values on LIR-CMOP5 during 30 independent runs are shown. The external archive achieved by MOEA/D-ACDP covers the real PF. However, the other four CMOEAs are trapped into local optimum. As shown in Fig. 7 (c), for LIR-CMOP10, MOEA/D-ACDP performs the best in terms of convergency. In Fig. 7 (d), for LIR-CMOP11, it shows that MOEA/D-ACDP can get the most of the PF, but the other four algorithms can only achieve a few parts of the PF.

It is worthwhile to point out that for three-objective test instances (LIR-CMOP13 and LIR-CMOP14), MOEA/D-ACDP also performs significantly better than the other four CMOEAs.

Based on the above performance comparison on the fourteen test instances LIR-CMOP1-14, it is clear that MOEA/D-ACDP outperforms the other four decomposition-based CMOEAs on most of cases.

A common feature of the above test instances LIR-CMOPs is that they all have large infeasible regions in their objective space. The experimental results demonstrate that the proposed ACDP method can deal with CMOPs well by taking advantage of angle information of the working population. Figure 7: The non-dominated solutions achieved by each algorithm with the median IGD in the 30 independent runs for LIR-CMOP3, LIR-CMOP5, LIR-CMOP10 and LIR-CMOP11.

#### 4.5.2 Performance Evaluation on I-beam Optimization Problem

The experimental results of values of MOEA/D-ACDP and the four other CMOEAs on the I-beam optimization problem are shown in Table 3. It can be observed that MOEA/D-ACDP significantly outperforms the compared CMOEAs on this engineering problem.

To further study the superiority of the proposed method MOEA/D-ACDP, the non-dominated solutions achieved by each CMOEA during the 30 independent runs are plotted in Fig. 8 (a)-(e).The non-dominated set of all the above solutions generates a set of ideal reference points. It is clear that the external archive obtained by MOEA/D-ACDP has a better performance of convergence. The box plot of values of the five CMOEAs is shown in Fig. 8 (f), which further verifies that MOEA/D-ACDP outperforms the other four CMOEAs on the I-beam optimization problem. Figure 8: The non-dominated solutions achieved by each algorithm during the 30 independent runs are plotted in (a)-(e). In (f), the box plots of each CMOEA are plotted.

## 5 Conclusions

This paper proposes a new constraint-handling mechanism named ACDP. It utilizes the angle information of any two solutions to dynamically maintain the diversity of the population during the evolutionary process. A set of CMOP instances named LIR-CMOP1-14 are tested. All the test instances have large infeasible regions in their objective space, which make general CMOEAs difficult to achieve the real PFs. Compared with the other four popular CMOEAs, the proposed algorithm can help the population to go across large infeasible regions more effectively. Additionally, the experimental results demonstrate that the proposed algorithm can work well in the real-world engineering problem. Thus, we can conclude that MOEA/D-ACDP outperforms the other four CMOEAs when CMOPs. In summary, MOEA/D-ACDP has following advantages:

• The proposed MOEA/D-ACDP utilizes the angle information of solutions to maintain the diversity of the population for CMOPs.

• MOEA/D-ACDP enhances the convergence to PF by exploring feasible and infeasible regions simultaneously during the evolutionary process, instead of wasting the useful information of the infeasible solutions.

Future work will focus on novel constraint-handling mechanisms to solve CMOPs. A study on developing new mechanisms of mining more useful information during the evolutionary process to further improve the performance of the proposed algorithm will be conducted.

## Acknowledgment

This work was supported in part by the National Natural Science Foundation of China under Grant (61175073, 61300159, 61332002, 51375287) , the Guangdong Key Laboratory of Digital signal and Image Processing, the Science and Technology Planning Project of Guangdong Province (2013B011304002) and the Project of Educational Commission of Guangdong Province, China 2015KGJHZ014).

## References

• (1)

K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: Nsga-ii, IEEE Transactions on Evolutionary Computation 6 (2) (2002) 182–197.

• (2) T. Murata, H. Ishibuchi, Moga: Multi-objective genetic algorithms, in: Evolutionary Computation, 1995., IEEE International Conference on, Vol. 1, IEEE, 1995, p. 289.
• (3) D. W. Corne, N. R. Jerram, J. D. Knowles, M. J. Oates, Pesa-ii: region-based selection in evolutionary multiobjective optimization, in: Conference on Genetic and Evolutionary Computation, 2001, pp. 283–290.
• (4) E. Zitzler, M. Laumanns, L. Thiele, et al., Spea2: Improving the strength pareto evolutionary algorithm (2001).
• (5) J. Horn, N. Nafpliotis, D. E. Goldberg, A niched pareto genetic algorithm for multiobjective optimization, in: Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, 2002, pp. 82–87 vol.1.
• (6) Q. Zhang, H. Li, Moea/d: A multiobjective evolutionary algorithm based on decomposition, IEEE Transactions on Evolutionary Computation 11 (6) (2007) 712–731.
• (7) H. Li, Q. Zhang, Multiobjective optimization problems with complicated pareto sets, moea/d and nsga-ii, IEEE Transactions on Evolutionary Computation 13 (2) (2009) 284–302.
• (8) H.-L. Liu, F. Gu, Q. Zhang, Decomposition of a Multiobjective Optimization Problem Into a Number of Simple Multiobjective Subproblems, IEEE Transactions on Evolutionary Computation 18 (3) (2014) 450–455.
• (9)

X. Cai, Y. Li, Z. Fan, Q. Zhang, An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization, IEEE Transactions on Evolutionary Computation 19 (4) (2015) 508–523.

• (10) X. Cai, Z. Yang, Z. Fan, Q. Zhang, Decomposition-Based-Sorting and Angle-Based-Selection for Evolutionary Multiobjective and Many-Objective Optimization, IEEE Transactions on Cybernetics PP (99) (2016) 1–14.
• (11) E. Zitzler, S. Künzli, Indicator-based selection in multiobjective search, Lecture Notes in Computer Science 3242 (2004) 832–842.
• (12) N. Beume, B. Naujoks, M. Emmerich, Sms-emoa: Multiobjective selection based on dominated hypervolume, European Journal of Operational Research 181 (3) (2007) 1653–1669.
• (13) J. Bader, E. Zitzler, Hype: an algorithm for fast hypervolume-based many-objective optimization., Evolutionary Computation 19 (1) (2011) 45.
• (14) S. Jiang, J. Zhang, Y.-S. Ong, A. N. Zhang, P. S. Tan, A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm, IEEE Transactions on Cybernetics 45 (10) (2015) 2202–2213.
• (15) X. Cai, Z. Hu, Z. Fan, A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization, Soft Computing 17 (10) (2013) 1893–1910.
• (16) Z. Hu, X. Cai, Z. Fan, An improved memetic algorithm using ring neighborhood topology for constrained optimization, Soft Computing 18 (10) (2013) 2023–2041.
• (17) C. A. C. Coello, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art, Computer Methods in Applied Mechanics and Engineering 191 (11–12) (2002) 1245–1287.
• (18) T. P. Runarsson, X. Yao, Stochastic ranking for constrained evolutionary optimization, IEEE Transactions on evolutionary computation 4 (3) (2000) 284–294.
• (19) T. Takahama, S. Sakai, Constrained optimization by the constrained differential evolution with gradient-based mutation and feasible elites, in: Evolutionary Computation, 2006. CEC 2006. IEEE Congress on, 2006, pp. 1–8.
• (20) H. K. Singh, T. Ray, W. Smith, C-psa: Constrained pareto simulated annealing for constrained multi-objective optimization, Information Sciences 180 (13) (2010) 2499–2513.
• (21) K. Deb, D. Kalyanmoy, Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, Inc, 2001.
• (22) Q. Zhang, A. Zhou, S. Zhao, P. N. Suganthan, W. Liu, S. Tiwari, Multiobjective optimization test instances for the cec 2009 special session and competition, University of Essex, Colchester, UK and Nanyang technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, technical report 264.
• (23) K. Miettinen, Nonlinear multiobjective optimization, volume 12 of international series in operations research and management science (1999).
• (24) M. Asafuddoula, T. Ray, R. Sarker, K. Alam, An adaptive constraint handling approach embedded moea/d, in: Evolutionary Computation, 2012, pp. 1–8.
• (25) M. A. Jan, R. A. Khanum, A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D, Applied Soft Computing 13 (1) (2013) 128–148.
• (26) Z. Yang, X. Cai, Z. Fan, Epsilon constrained method for constrained multiobjective optimization problems: some preliminary results, in: Companion Publication of the 2014 Conference on Genetic and Evolutionary Computation, 2014, pp. 1181–1186.
• (27) Z. Fan, W. Li, X. Cai, H. Li, K. Hu, Q. Zhang, K. Deb, E. D. Goodman, Difficulty adjustable and scalable constrained multi-objective test problem toolkit, arXiv preprint arXiv:1612.07603.
• (28) Z. Fan, W. Li, X. Cai, H. Huang, Y. Fang, Y. You, J. Mo, C. Wei, E. Goodman, An improved epsilon constraint-handling method in moea/d for cmops with large infeasible regions, arXiv preprint arXiv:1707.08767.
• (29) S. Huband, P. Hingston, L. Barone, L. While, A review of multiobjective test problems and a scalable test problem toolkit, IEEE Transactions on Evolutionary Computation 10 (5) (2006) 477–506.
• (30) A. Osyczka, Multicriteria optimization for engineering design, in: Design Optimization, 1985, pp. 193–227.
• (31) P. A. N. Bosman, D. Thierens, The balance between proximity and diversity in multiobjective evolutionary algorithms, IEEE Transactions on Evolutionary Computation 7 (2) (2003) 174–188.
• (32) E. Zitzler, L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach, IEEE Transactions on Evolutionary Computation 3 (4) (1999) 257–271.