Evolutionary Multi-Objective Optimization Driven by Generative Adversarial Networks

07/10/2019 ∙ by Cheng He, et al. ∙ 12

Recently, more and more works have proposed to drive evolutionary algorithms using machine learning models.Usually, the performance of such model based evolutionary algorithms is highly dependent on the training qualities of the adopted models.Since it usually requires a certain amount of data (i.e. the candidate solutions generated by the algorithms) for model training, the performance deteriorates rapidly with the increase of the problem scales, due to the curse of dimensionality.To address this issue, we propose a multi-objective evolutionary algorithm driven by the generative adversarial networks (GANs).At each generation of the proposed algorithm, the parent solutions are first classified into real and fake samples to train the GANs; then the offspring solutions are sampled by the trained GANs.Thanks to the powerful generative ability of the GANs, our proposed algorithm is capable of generating promising offspring solutions in high-dimensional decision space with limited training data.The proposed algorithm is tested on 10 benchmark problems with up to 200 decision variables.Experimental results on these test problems demonstrate the effectiveness of the proposed algorithm.



There are no comments yet.


page 2

page 3

page 4

page 5

page 6

page 7

page 8

page 11

This week in AI

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

I Introduction

Multi-objective optimization problems (MOPs) refer to the optimization problems with multiple conflicting objectives [1]

, e.g., structure learning for deep neural networks

[2], energy efficiency in building design [3], and cognitive space communication [4]. The mathematical formulation of the MOPs is presented as follows [5]:

Minimize (1)
subject to

where is the search space of decision variables, is the number of objectives, and

is the decision vector with

denoting the number of decision variables [6].

Different from the single-objective optimization problems with single global optima, there exist multiple optima that trade off between different conflicting objectives in an MOP [7]. In multi-objective optimization, the Pareto dominance relationship is usually adopted to distinguish the qualities of two different solutions [8]. A solution is said to Pareto dominate anther solution () iff


The collection of all the Pareto optimal solutions in the decision space is called the Pareto optimal set (PS), and the projection of the PS in the objective space is called the Pareto optimal front (PF). The goal of multi-objective optimization is to obtain a set of solutions for approximating the PF in terms of both convergence and diversity, where each solution should be close to the PF and the entire set should be evenly spread over the PF.

To solve MOPs, a variety of multi-objective evolutionary algorithms (MOEAs) have been proposed, which can be roughly classified into three categories [9]

: the dominance-based algorithms (e.g. the elitist non-dominated sorting genetic algorithm (NSGA-II)

[10] and the improved strength Pareto EA (SPEA2) [11]); the decomposition-based MOEAs (e.g., the MOEA/D [12] and MOEA/D using differential evolution (MOEA/D-DE) [13]); and the performance indicator-based algorithms (e.g., the -metric selection evolutionary multi-objective optimization algorithm (SMS-EMOA) [14]). There are also some MOEAs not falling into the three categories, such as the third generation differential algorithm (GDE3) [15], the memetic Pareto achieved evolution strategy (M-PAES) [16], and the two-archive based MOEA (Two-Arc)  [17], etc.

In spite of the various technical details adopted in different MOEAs, most of them share a common framework as displayed in Fig. 1. Each generation in the main loop of the MOEAs consists of three operations: offspring reproduction, fitness assignment, and environmental selection [18]. To be specific, the algorithms start from the population initialization; then the offspring reproduction operation will generate offspring solutions; afterwards, the generated offspring solutions are evaluated using the real objective functions; finally, the environmental selection will select some high-quality candidate solutions to survive as the population of the next generation. In conventional MOEAs, since the reproduction operations are usually based on stochastic mechanisms (e.g. crossover or mutation), the algorithms are unable to explicitly learn from the environments (i.e. the fitness landscapes).

Fig. 1: The general framework of MOEAs.

To address the above issue, a number of recent works have been dedicated to designing EAs with learning ability, known as the model based evolutionary algorithms (MBEAs) [19, 20]

. The basic idea of MBEAs is to replace the heuristic operations or the objective functions with computationally efficient machine learning models, where the candidate solutions sampled from the population are used as training data. Generally, the models are used for the following three main purposes when adopted in MOEAs.

First, the models are used to approximate the real objective functions of the MOP during the fitness assignment process. MBEAs of this type are also known as the surrogate-assisted EAs [21], which use computationally cheap machine learning models to approximate the computationally expensive objective functions [22]. They aim to solve computationally expensive MOPs using a few real objective function evaluations as possible [23, 24]. A number of surrogate-assisted MOEAs were proposed in the past decades, e.g., the -metric selection-based EA (SMS-EGO) [25], the Pareto rank learning based MOEA [26], and the MOEA/D with Gaussian process (GP) [27] (MOEA/D-EGO) [28].

Second, the models are used to predict the dominance relationship [29] or the ranking of candidate solutions [30, 31] during the reproduction or environmental selection process. For example, in the classification based pre-selection MOEA (CPS-MOEA) [32]

, a k-nearest neighbor (KNN

[33] model is adopted to classify the candidate solutions into positive and negative classes. Then the positive candidate solutions are selected to survival [34]. Similarly, the classification based surrogate-assisted EA (CSEA) used a feedforward neural network [35] to predict the dominance classes of the candidate solutions in evolutionary multi-objective optimization [36].

Third, the models are used to generate promising candidate solutions during the offspring reproduction process. The MBEAs of this type mainly include the multi-objective estimation of distribution algorithms (MEDAs) 

[37] as well as the inverse modeling based algorithms [38]. The MEDAs estimate the distribution of promising candidate solutions by training and sampling models in the decision space. Instead of generating offspring solutions via crossover or mutation from the parent solutions, the MEDAs explore the decision space of potential solutions by building and sampling explicit probabilistic models of the promising candidate solutions [39]. Typical algorithms include the Bayesian multi-objective optimization algorithm (BMOA) [40], the naive mixture-based multi-objective iterated density estimation EA (MIDEA) [41], the multi-objective Bayesian optimization algorithm (mBOA) [42], and the regularity model based MEDA (RM-MEDA) [43], etc. For example, in the covariance matrix adaptation based MOEA/D (MOEA/D-CMA) [44], the covariance matrix adaptation model [45] is adopted for offspring reproduction. As for the inverse modeling based algorithms, they sample points in the objective space and then build inverse models to map them back to the decision space, e.g., the Pareto front estimation method [38], the Pareto-adaptive -dominance-based algorithm (-MyDE) [46], the reference indicator-based MOEA (RIB-EMOA) [47], and the MOEA using GP based inverse modeling (IM-MOEA) [48].

Despite that existing MBEAs have shown promising performance on a number of MOPs, their performance deteriorates rapidly as the number of decision variables increases. There are mainly two difficulties when applying existing MBEAs to multi-objective optimization. First, the requirement of training data for building and updating the machine learning models increases exponentially as the number of decision variables becomes larger, i.e., the MBEAs severely suffer from the curse of dimensionality  [49, 50]. Second, since there are multiple objectives involved in MOPs, it is computationally expensive to employ multiple models for sampling different objectives.

The generative adversarial networks (GANs) are generative models which have been successfully applied in many areas, e.g., image generation [51], unsupervised representation learning [52]

, and image super-resolution 

[53]. They are capable of learning the regression distribution over the given/target data in an adversarial manner. It is naturally suitable to drive evolutionary multi-objective optimization using GANs due to the following reasons. First, the pairwise generator and discriminator in GANs are capable of distinguishing and sampling promising candidate solutions, which is particularly useful in multi-objective optimization in terms of the Pareto dominance relationship. Second, thanks to the adversarial learning mechanism, the GANs are able to learn high-dimensional distributions efficiently with limited training data. By taking such advantages of GANs, we propose a GAN-based MOEA, termed GMOEA. To the best of our knowledge, it is the first time that the GANs are used for driving evolutionary multi-objective optimization. The main new contributions of this work can be summarized as follows:

  1. In contrast to conventional MBEAs which are merely dependent on given data (i.e. the candidate solutions), the GANs are able to reuse the data generated by themselves. To take such an advantage, in GMOEA, we propose a classification strategy to classify the candidate solutions into real and fake samples which are reused as training data. This is particularly meaningful for data enhancement in high-dimensional decision space.

  2. We sample a multivariate normal Gaussian distribution as the input of the GANs in the proposed GMOEA. Specifically, the distribution is learned from the promising candidate solutions which approximate the non-dominated front obtained at each generation.

The rest of this paper is organized as follows. In Section II, we briefly review the background of the GANs and other related works. The details of the proposed GMOEA are presented in Section III. Experimental settings and comparisons of GMOEA with the state-of-the-art MOEAs on the benchmark problems are presented in Section IV. Finally, conclusions are drawn in Section V.

Ii Background

Ii-a Generative Adversarial Networks

The generative adversarial networks have achieved considerable success as a framework of generative models [51]. In general, the GANs produce a model distribution (i.e. the distribution of the fake/generated data) that mimics a target distribution (i.e. the distribution of the real/given data).

A pair of GANs consist of a generator and a discriminator, where the generator maps Gaussian noise () to a model distribution

and the discriminator outputs probability

with . Generally speaking, the discriminator seeks to maximize probability () and minimize probability , while the generator aims to generate more realistic samples to maximize probability , trying to cheat the discriminator. To be more specific, those two networks are trained in an adversarial manner using the min-max value function :

Algorithm 1 presents the detailed procedures of the training process. First, a number of samples are sampled from a Gaussian distribution and the given data (target distribution), respectively. Second, the discriminator is updated using the gradient descending method according to:


Sequentially, the generator is updated using the gradient descending method according to:


where is a vector randomly sampled from a Gaussian distribution. The above procedures are repeated for a number of iterations [54].

0:     (given data), (Gaussian noise), (batch size).
1:  for total number of training iterations do
2:     /***** Update the discriminator ****/
3:     Randomly sample samples from
4:     Randomly sample samples from
5:     Update the discriminator according to (3)
6:     /****** Update the generator ******/
7:     Sample samples from
8:     Update the generator according to (4)
9:  end
Algorithm 1 Training of the GANs

Ii-B Improved Strength Pareto Based Selection

The improved strength Pareto based EA (SPEA2) [11] is improved from its original version (SPEA) [55] by incorporating a tailored fitness assignment strategy, a density estimation technique, and an enhanced truncation method. In the tailored fitness assignment strategy, the dominance relationship between the pairwise candidate solutions are first detected, and then a strength value is assigned to each candidate solution. This value indicates the number of candidate solutions it dominates:


where is the population and are the candidate solutions in it. Besides, the raw fitness can be obtained as:


Moreover, the additional density information, termed , is used to discriminate the candidate solutions having identical raw fitness values. The density of a candidate solution is defined as:


where is the square root of the population size, and denotes the th nearest Euclidean distance from to the candidate solutions in the population. Finally, the fitness can be calculated as


The environmental selection of SPEA2 first selects all the candidate solutions with . If the number of the selected candidate solutions is smaller than the population size, the rest candidate solutions are selected with the best ; otherwise, a truncation procedure is invoked to iteratively remove candidate solutions from the population, where the candidate solution with the minimum Euclidean distance to the selected candidate solutions is removed each time.

Since the density information is well used, the environmental selection in SPEA2 maintains a set of diverse candidate solutions. In this work, we adopt it for solution classification and environmental selection in our proposed GMOEA, where the details will be presented in Section III.B.

Iii The Proposed Algorithm

The main scheme of the proposed GMOEA is presented in Algorithm 2. First, a population of size and a pair of GANs are randomly initialized, respectively. Then the candidate solutions in are classified into two different datasets with equal size (labeled as fake and real) and used to train the GANs. Next, a set of offspring solutions is generated by the proposed hybrid reproduction strategy. Afterwards, candidate solutions are selected from the combination of and by environmental selection. Finally, the solution classification, model training, offspring reproduction, and environmental selection are repeated until the termination criterion is satisfied. We will not enter the details of the environmental selection as it is similar to the solution classification, except that the environmental selection takes as input (instead of ) and only outputs the real solutions.

0:     (population size), (batch size for training the GAN)
1:   Initialize a population of size
2:   Initialize the GANs
3:  while termination criterion not fulfilled do
8:  end
9:  Return:  
Algorithm 2 General Framework of GMOEA

Iii-a Solution Classification

Solution classification is used to divide the population into two different datasets (real and fake) for training the GANs. The real solutions are those better-converged and evenly distributed candidate solutions; by contrast, the fake ones are those of relatively poor qualities. We use the environmental selection strategy as introduced in Section II-B to select half of the candidate solutions in the current population as real samples and the rest as fake ones.

1:   Calculate the fitness values of candidate solutions in according to (8)
3:  if   then
4:      Select candidate solutions with the minimal
5:  else
6:     while  do
7:        Delete in
8:     end
9:  end
10:   real
11:   fake
12:  Return:   with real and fake samples
Algorithm 3 Solution Classification

The pseudo codes of the solution classification are presented in Algorithm 3. Generally, the purpose of solution classification is to select a set of high-quality candidate solutions in terms of convergence and diversity. The first term is intuitive, which aims to enhance the selection pressure for pushing the population towards the PF. The second term aims to satisfy the identity independent distribution assumption for better generalization of the GANs [56].

Iii-B Model Training

The structures of the generator and discriminator adopted in this work are feedforward neural networks [57] with two hidden layers and one hidden layer, respectively. The general scheme of the GANs is given in Fig. 2, where the distributions of the real and fake datasets are denoted as and

, respectively. The activation functions of the output layers in these two networks are sigmoid functions to ensure that the output values vary in

. Here, we propose a novel training method to take advantage of the labeled samples.

Fig. 2: The general scheme of model training in the proposed GMOEA.

First, the mean vector and covariance matrix of the real samples are calculated by:


where is the th member of the real dataset and is the population size. Then the GANs are trained for several iterations. At each iteration, the discriminator is updated using three different types of training data, i.e., the real samples, the fake

samples, and the samples generated by the generator. The loss function for training the discriminator is given as follows:


where , and denote the outputs of the discriminator with the real sample, the fake sample and the sample generated by the generator being the inputs, respectively. The input of the generator is vector

sampled from a multivariate normal distribution. Finally, the generator is updated according to (

4) using the samples generated by itself.

1:   /*Mean vector of the data*/
2:   /*Covariance matrix of the data*/
3:  for total number of training iterations do
4:     Randomly sample samples from
6:     Update the discriminator according to (10)
8:     Update the generator according to (4)
9:  end
Algorithm 4 Model Training()

The detailed procedure of the model training in GMOEA is given in Algorithm 4. Here, we use the multivariate normal Gaussian distribution [58], which is specified by its mean vector and covariance matrix, to generate training data. The mean vector represents the location where samples are most likely to be generated, and the covariance indicates the level to which two variables are correlated. This modification is inspired by the generative method in variational auto-encoder (VAE) [59], which aims to generate data that approximates the given distribution. More importantly, this modification will potentially reduce the amount of data required for training the generator, since the distributions of and are similar.

Iii-C Offspring Reproduction

In this work, we adopt a hybrid reproduction strategy for offspring generation in GMOEA, which aims at balancing the exploitation and exploration of the proposed algorithm. The general idea of the proposed reproduction strategy is simple and efficient. At each generation, offspring solutions will be generated either by the GAN model or the genetic operators (i.e. crossover and mutation) with equal probability.

To generate a candidate solution using the GANs, we first calculate the mean vector and covariance matrix of the real samples according to (9). Then, a -dimensional vector

is sampled with each element being independently sampled from a continuous uniform distribution

. Afterwards, a -dimensional vector

satisfying the multivariate normal distribution is generated according to the following probability density function:


where denotes the dimensionality of the decision space. Finally, the output of the generator, , is restricted according to the lower and upper boundaries (i.e., and ) of the decision space as follows:

where is the candidate solution generated by the GANs.

Iv Experimental Study

To empirically examine the performance of the proposed GMOEA, we mainly conduct two different experiments to examine the properties of our proposed GMOEA. Among these experiments, six representative MOEAs are compared, namely, NSGA-II [10], MOEA/D-DE [13], MOEA/D-CMA [44], IM-MOEA[48], GDE3 [15], and SPEA2 [11]. NSGA-II and SPEA2 are selected as they both adopt crossover and mutation operators for offspring generation. MOEA/D-DE and GDE3 are selected as they both adopt the differential evolution operator. MOEA/D-CMA is chosen as it is a representative MBEA, which uses the covariance matrix adaptation evolution strategy for multi-objective optimization. Besides, IM-MOEA is selected as it is an MBEA using the inverse models to generate offspring solutions for multi-objective optimization. The two experiments are summarized as follows:

  • The effectiveness of our proposed training method is examined according to the qualities of the offspring solutions generated by the GANs which are trained by different methods.

  • The general performance of our proposed GMOEA is compared with the six algorithms on ten IMF problems with up to 200 decision variables.

In the remainder of this section, we first present a brief introduction to the experimental settings of all the compared algorithms. Then the test problems and performance indicators are described. Afterwards, each algorithm is run for 20 times on each test problem independently. Then the Wilcoxon rank sum test  [60] is used to compare the results obtained by the proposed GMOEA and the compared algorithms at a significance level of 0.05. Symbols ‘’, ‘’, and ‘’ indicate the compared algorithm is significantly better than, significantly worse than, and statistically tied by GMOEA, respectively.

Iv-a Experimental settings

For fair comparisons, we adopt the recommended parameter settings for the compared algorithms that have achieved the best performance as reported in the literature. The six compared algorithms are implemented in PlatEMO using Matlab [61]

, and our proposed GMOEA is implemented in Pytorch using Python 3.6. All the algorithms are run on a PC with Intel Core i9 3.3 GHz processor, 32 GB of RAM, and 1070Ti GPU.

1) Reproduction Operators. In this work, the simulated binary crossover (SBX) [62] and the polynomial mutation (PM) [63] are adopted for offspring generation in NSGA-II and SPEA2. The distribution index of crossover is set to 20 and the distribution index of mutation is set to 20, as recommended in [62]. The crossover probability is set to 1.0 and the mutation probability is set to , where is the number of decision variables. In MOEA/D-DE, MOEA/D-CMA, and GDE3, the differential evolution (DE) operator [64] and PM are used for offspring generation. Meanwhile, the control parameters are set to 1, 0.5, , and 20 as recommended in [13].

2) Population Size. The population size is set to 100 for test instances with two objectives and 105 for test instances with three objectives.

(3) Specific Parameter Settings in Each Algorithm. In MOEA/D-DE, the neighborhood size is set to 20, the probability of choosing parents locally is set to 0.9, and the maximum number of candidate solutions replaced by each offspring solution is set to 2. In MOEA/D-CMA, the number of groups is set to 5. As for IM-MOEA, the number of reference vectors is set to 10 and the size of random groups is set to 3.

In our proposed GMOEA, the training parameter settings of the GANs are fixed, where the batch size is set to 32, the learning rate is set to 1e-4, and the total number of iterations is set to 625 (i.e. ).

(4) Termination Condition. The total number of FEs is adopted as the termination condition for all the test instances. The number of FEs is set to 5000 for test problems with 30 decision variables, 10000 for problems with 50 decision variables, 15000 for problems with 100 decision variables, and 30000 for problems with 200 decision variables.

Iv-B Test Problems and Performance Indicators

In this work, we adapt ten problems selected from [48], termed IMF1 to IMF10. Among these test problems, the number of objectives is three in IMF4, IMF8 and two in the rest ones.

We adopt two different performance indicators to assess the qualities of the obtained results. The first one is the Inverted Generational Distance (IGD) indicator [65], which can assess both the convergence and distribution of the obtained solution set. Suppose that is a set of relatively evenly distributed reference points [66] in the PF and is the set of the obtained non-dominated solutions. The IGD can be mathematically defined as follows.


where is the minimum Euclidean distance between and points in , and denotes the number of elements in . The set of reference points required for calculating IGD values are relatively evenly selected from the PF of each test problem, and a set size closest to 10000 is used in this paper.

The second performance indicator is the hypervolume (HV) indicator [67]. Generally, hypervolume is favored because it captures in a single scalar both the closeness of the solutions to the optimal set and the spread of the solutions across objective space. Given a solution set , the HV value of is defined as the area covered by with respect to a set of predefined reference points in the objective space:



and is the Lebesgue measure with


is the characteristic function of


Note that, a smaller value of IGD will indicate better performance of the algorithm; in contrast, a greater value of HV will indicate better performance of the algorithm.

Iv-C Effectiveness of the Model Training Method

To verify the effectiveness of our proposed model training method in GMOEA, we compare the offspring solutions generated by our modified GANs and the original GANs during the optimization of IMF4 and IMF7. We select IMF4 since its PS is complicated, and this problem is difficult for existing MOEAs to maintain the diversity. IMF7 with 200 decision variables is tested to examine the effectiveness of our proposed training method in solving MOPs with high-dimensional decision variables. The numbers of FEs for these two problems are set to 5000 and 30000, respectively. Besides, each test instance is tested for 10 independent runs to obtain the statistic results. In each independent run, we sample the offspring solutions every 10 iterations for IMF4 and every 50 iterations for IMF7.

Fig. 3: The offsprings generated by the original GANs and our proposed GANs at different iterations of the evolution on IMF4 with 30 decision variables.

Fig. 3 presents the offspring solutions obtained on tri-objective IMF4. It can be observed that the original GANs tend to generate offspring solutions in a smaller region of the objective space (e.g., near the top center in Fig. 3). By contrast, our modified GANs have generated a set of widely spread offspring solutions with better convergence in most iterations. Fig. 4 presents the offspring solutions obtained on IMF7 with 200 decision variables. It can be observed that our modified GANs have generated a set of better-converged and spreading offspring solutions; by contrast, the original GANs have generated offspring solutions mostly in the left corner.

Fig. 4: The offsprings generated by the original GANs and our proposed GANs at different iterations of the evolution on IMF7 with 200 decision variables.

It can be concluded from the three comparisons that our proposed training method is effective in diversity maintenance and convergence enhancement, even on MOPs with complicated PSs and up to 200 decision variables.

Iv-D General Performance

The statistical results of the IGD and HV values achieved by the seven compared MOEAs on IMF1 to IMF10 are summarized in Table I and Table II, respectively. Our proposed GMOEA has performed the best on these ten problems, followed by IM-MOEA, NSGA-II, and MOEA/D-CMA. It can be concluded from these two tables that GMOEA shows an overall better performance in compared with the model-free MOEAs, i.e., NSGA-II, MOEA/D-DE, GDE3, and SPEA2, on IMF problems. Meanwhile, GMOEA has shown a competitive performance in compared with MOEA/D-CMA and IM-MOEA on these IMF problems.

IMF1 30 2.75e-1(3.56e-2) 5.12e-1(8.51e-2) 2.92e-1(4.07e-2) 1.17e-1(2.86e-2) 9.92e-1(2.87e-1) 2.89e-1(4.73e-2) 4.46e-1(3.86e-2)
50 3.13e-1(3.67e-2) 5.43e-1(8.84e-2) 2.26e-1(2.74e-2) 1.24e-1(3.46e-2) 1.10e+0(2.43e-1) 3.25e-1(3.52e-2) 4.67e-1(4.44e-2)
100 3.53e-1(3.20e-2) 1.06e+0(1.62e-1) 3.76e-1(4.08e-2) 2.29e-1(3.52e-2) 2.08e+0(3.01e-1) 3.85e-1(3.25e-2) 4.87e-1(5.10e-2)
200 3.85e-1(2.40e-2) 1.29e+0(1.42e-1) 4.06e-1(3.43e-2) 2.61e-1(3.82e-2) 2.57e+0(2.23e-1) 4.31e-1(2.63e-2) 5.44e-1(5.43e-2)
IMF2 30 4.69e-1(5.60e-2) 7.50e-1(1.67e-1) 4.52e-1(7.56e-2) 2.15e-1(7.97e-2) 2.01e+0(6.60e-1) 4.72e-1(4.76e-2) 6.10e-1(1.14e-6)
50 4.78e-1(2.95e-2) 7.17e-1(1.66e-1) 3.28e-1(3.44e-2) 2.84e-1(9.53e-2) 1.92e+0(4.60e-1) 4.78e-1(2.97e-2) 6.10e-1(1.14e-6)
100 5.29e-1(3.08e-2) 1.66e+0(3.47e-1) 5.29e-1(5.96e-2) 3.96e-1(5.81e-2) 3.42e+0(4.70e-1) 5.67e-1(3.80e-2) 6.10e-1(1.14e-6)
200 5.75e-1(3.95e-2) 2.28e+0(2.47e-1) 5.93e-1(6.10e-2) 4.11e-1(3.16e-2) 4.28e+0(3.25e-1) 6.48e-1(5.17e-2) 6.81e-1(2.29e-1)
IMF3 30 3.02e-1(9.01e-2) 6.73e-1(2.58e-1) 4.61e-1(5.61e-2) 1.58e-1(2.97e-2) 2.26e+0(5.06e-1) 3.25e-1(9.57e-2) 1.00e-2(1.78e-8)
50 1.74e-1(4.43e-2) 7.59e-1(2.02e-1) 3.89e-1(2.07e-2) 1.29e-1(3.33e-2) 2.96e+0(5.62e-1) 2.12e-1(5.22e-2) 1.00e-2(1.78e-8)
100 3.26e-1(6.12e-2) 2.03e+0(2.83e-1) 5.41e-1(4.80e-2) 2.42e-1(4.59e-2) 5.78e+0(8.25e-1) 3.57e-1(8.06e-2) 1.00e-2(1.78e-8)
200 3.76e-1(6.04e-2) 2.74e+0(2.63e-1) 5.72e-1(5.99e-2) 2.37e-1(2.83e-2) 7.25e+0(6.55e-1) 4.11e-1(5.90e-2) 7.60e-2(1.60e-1)
IMF4 30 1.17e+0(3.48e-1) 2.75e+0(8.05e-1) 1.43e+0(2.53e-1) 2.18e+0(4.68e-1) 7.19e+0(2.53e+0) 1.21e+0(3.11e-1) 5.21e-1(1.23e-2)
50 1.54e+0(4.63e-1) 3.78e+0(1.08e+0) 1.44e+0(2.36e-1) 2.96e+0(4.95e-1) 1.85e+1(5.25e+0) 1.47e+0(4.31e-1) 5.37e-1(5.71e-3)
100 6.62e+0(1.56e+0) 1.91e+1(3.76e+0) 4.71e+0(8.46e-1) 1.33e+1(2.19e+0) 8.23e+1(1.59e+1) 5.84e+0(9.71e-1) 6.57e-1(5.23e-1)
200 1.95e+1(2.25e+0) 4.65e+1(5.99e+0) 9.62e+0(1.79e+0) 3.21e+1(5.33e+0) 2.14e+2(1.82e+1) 1.52e+1(1.88e+0) 1.01e+0(2.08e+0)
IMF5 30 9.90e-2(1.02e-2) 1.39e-1(8.13e-3) 1.40e-1(1.32e-2) 7.55e-2(8.87e-3) 1.10e-1(2.21e-2) 9.70e-2(1.08e-2) 7.55e-2(1.10e-2)
50 1.08e-1(1.28e-2) 1.35e-1(1.15e-2) 1.33e-1(1.42e-2) 6.80e-2(6.16e-3) 1.29e-1(1.17e-2) 1.09e-1(1.04e-2) 8.15e-2(1.35e-2)
100 1.37e-1(8.75e-3) 1.68e-1(7.68e-3) 1.62e-1(8.13e-3) 1.02e-1(6.16e-3) 1.68e-1(8.94e-3) 1.43e-1(7.33e-3) 1.20e-1(3.20e-2)
200 1.60e-1(9.45e-3) 1.85e-1(5.13e-3) 1.66e-1(9.99e-3) 1.13e-1(7.33e-3) 1.88e-1(6.96e-3) 1.75e-1(1.73e-2) 1.11e-1(1.80e-2)
IMF6 30 1.77e-1(2.32e-2) 1.93e-1(1.87e-2) 1.92e-1(1.39e-2) 1.01e-1(1.17e-2) 1.61e-1(4.18e-2) 1.80e-1(1.84e-2) 1.17e-1(1.53e-2)
50 1.92e-1(2.19e-2) 1.94e-1(2.50e-2) 1.80e-1(2.78e-2) 9.70e-2(8.01e-3) 1.96e-1(2.21e-2) 2.02e-1(1.93e-2) 1.25e-1(1.15e-2)
100 2.70e-1(2.83e-2) 2.37e-1(8.01e-3) 2.23e-1(1.49e-2) 1.41e-1(6.86e-3) 2.59e-1(1.36e-2) 2.79e-1(2.52e-2) 1.77e-1(7.11e-2)
200 3.19e-1(2.48e-2) 2.59e-1(5.53e-3) 2.45e-1(1.23e-2) 1.54e-1(6.81e-3) 2.80e-1(7.95e-3) 3.32e-1(3.62e-2) 1.90e-1(3.50e-2)
IMF7 30 1.79e-1(1.79e-2) 2.83e-1(1.16e-2) 2.87e-1(5.87e-3) 2.45e-1(7.61e-3) 3.00e-1(1.03e-2) 1.98e-1(2.59e-2) 6.40e-2(3.03e-2)
50 1.58e-1(1.94e-2) 2.83e-1(6.57e-3) 2.84e-1(5.03e-3) 2.32e-1(1.28e-2) 2.94e-1(8.26e-3) 1.64e-1(2.09e-2) 5.10e-2(5.48e-2)
100 2.03e-1(2.20e-2) 2.91e-1(2.24e-3) 2.93e-1(4.89e-3) 2.50e-1(6.49e-3) 3.05e-1(6.07e-3) 2.09e-1(1.59e-2) 1.65e-2(1.46e-2)
200 2.39e-1(2.02e-2) 2.94e-1(5.10e-3) 2.95e-1(5.13e-3) 2.53e-1(8.65e-3) 3.08e-1(5.23e-3) 2.42e-1(1.98e-2) 7.25e-2(8.58e-2)
IMF8 30 7.37e-1(1.18e-1) 6.44e-1(3.60e-2) 6.12e-1(1.05e-1) 5.59e-1(4.83e-2) 6.92e-1(1.81e-1) 7.44e-1(1.24e-1) 3.41e-1(1.90e-2)
50 9.80e-1(1.20e-1) 6.71e-1(2.85e-2) 6.81e-1(4.24e-2) 6.55e-1(4.56e-2) 9.33e-1(7.64e-2) 1.00e+0(1.48e-1) 3.58e-1(1.15e-2)
100 1.74e+0(1.62e-1) 7.35e-1(5.38e-2) 7.74e-1(3.13e-2) 1.28e+0(7.10e-2) 1.72e+0(2.64e-1) 2.43e+0(2.16e-1) 4.85e-1(8.46e-2)
200 4.00e+0(6.32e-1) 8.55e-1(1.10e-1) 8.88e-1(3.26e-2) 2.28e+0(2.16e-1) 3.40e+0(4.49e-1) 5.96e+0(4.13e-1) 1.31e+0(1.55e+0)
IMF9 30 1.10e-1(1.49e-2) 2.91e-1(5.01e-2) 3.28e-1(5.37e-2) 2.09e-1(2.20e-2) 2.50e-1(3.63e-2) 1.17e-1(1.38e-2) 7.30e-2(2.64e-2)
50 1.07e-1(1.92e-2) 2.91e-1(4.21e-2) 3.70e-1(4.42e-2) 1.78e-1(2.61e-2) 2.87e-1(4.50e-2) 1.10e-1(1.08e-2) 8.75e-2(2.69e-2)
100 1.46e-1(9.40e-3) 4.44e-1(4.83e-2) 4.80e-1(3.34e-2) 2.89e-1(2.61e-2) 3.80e-1(4.26e-2) 1.48e-1(8.75e-3) 1.16e-1(3.27e-2)
200 1.73e-1(8.01e-3) 5.50e-1(2.03e-2) 5.26e-1(3.35e-2) 2.95e-1(2.91e-2) 4.96e-1(2.54e-2) 1.71e-1(1.04e-2) 1.41e-1(5.95e-2)
IMF10 30 6.13e+1(1.76e+1) 6.99e+1(1.20e+1) 7.06e+1(8.84e+0) 3.05e+1(9.21e+0) 1.09e+2(1.89e+1) 5.07e+1(1.04e+1) 3.94e+1(4.22e+0)
50 1.06e+2(2.03e+1) 1.18e+2(2.36e+1) 1.46e+2(2.62e+1) 5.26e+1(1.18e+1) 2.19e+2(2.22e+1) 9.44e+1(1.51e+1) 6.25e+1(4.97e+0)
100 3.03e+2(3.21e+1) 3.23e+2(3.90e+1) 4.12e+2(4.89e+1) 1.33e+2(3.49e+1) 5.11e+2(5.13e+1) 2.89e+2(5.16e+1) 1.23e+2(2.48e+1)
200 6.54e+2(8.88e+1) 7.19e+2(5.55e+1) 9.48e+2(5.80e+1) 3.29e+2(8.25e+1) 1.18e+3(9.33e+1) 7.29e+2(9.98e+1) 4.00e+2(2.29e+2)
8/31/1 0/39/1 7/31/2 14/20/6 0/40/0 8/32/0
  • ’, ’’ and ’’ indicate that the result is significantly better, significantly worse and statistically similar to that obtained by GMOEA, respectively.

TABLE I: The IGD Results Obtained by NSGA-II, MOEA/D-DE, MOEA/D-CMA, IM-MOEA, GDE3, SPEA2, and GMOEA on 40 IMF Test Instances. The Best Result in Each Row is Highlighted.
IMF1 30 5.43e-1(3.16e-2) 1.85e-1(6.65e-2) 4.00e-1(4.98e-2) 7.18e-1(1.99e-2) 2.45e-2(2.87e-2) 5.19e-1(4.64e-2) 5.08e-1(2.55e-2)
50 5.50e-1(3.43e-2) 1.69e-1(6.34e-2) 4.99e-1(4.09e-2) 7.29e-1(1.90e-2) 1.50e-2(4.01e-2) 5.45e-1(1.93e-2) 4.87e-1(3.26e-2)
100 4.80e-1(3.68e-2) 6.00e-3(1.76e-2) 3.11e-1(3.75e-2) 6.29e-1(2.16e-2) 0.00e+0(0.00e+0) 4.46e-1(4.22e-2) 4.65e-1(3.50e-2)
200 4.33e-1(2.75e-2) 0.00e+0(0.00e+0) 2.77e-1(2.98e-2) 6.06e-1(2.39e-2) 0.00e+0(0.00e+0) 3.80e-1(3.59e-2) 4.07e-1(8.18e-2)
IMF2 30 4.65e-2(3.13e-2) 1.70e-2(3.69e-2) 1.00e-1(4.24e-2) 2.71e-1(5.94e-2) 0.00e+0(0.00e+0) 4.05e-2(3.50e-2) 1.10e-1(2.85e-7)
50 5.90e-2(2.45e-2) 2.15e-2(2.85e-2) 1.92e-1(2.88e-2) 2.32e-1(5.86e-2) 0.00e+0(0.00e+0) 5.35e-2(2.64e-2) 1.10e-1(2.85e-7)
100 6.50e-3(7.45e-3) 0.00e+0(0.00e+0) 6.70e-2(2.75e-2) 1.41e-1(2.92e-2) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 1.10e-1(2.85e-7)
200 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 4.35e-2(2.30e-2) 1.36e-1(1.39e-2) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 9.35e-2(4.03e-2)
IMF3 30 1.32e-1(5.32e-2) 2.85e-2(6.27e-2) 4.75e-2(1.92e-2) 2.39e-1(2.88e-2) 0.00e+0(0.00e+0) 1.14e-1(5.15e-2) 4.24e-1(5.03e-3)
50 2.34e-1(4.20e-2) 7.50e-3(1.12e-2) 7.60e-2(1.14e-2) 2.69e-1(3.20e-2) 0.00e+0(0.00e+0) 1.99e-1(4.23e-2) 4.28e-1(4.10e-3)
100 1.19e-1(3.75e-2) 0.00e+0(0.00e+0) 2.50e-2(1.10e-2) 1.71e-1(3.43e-2) 0.00e+0(0.00e+0) 1.01e-1(4.12e-2) 4.24e-1(5.03e-3)
200 9.05e-2(3.03e-2) 0.00e+0(0.00e+0) 1.95e-2(1.23e-2) 1.73e-1(2.15e-2) 0.00e+0(0.00e+0) 7.45e-2(2.72e-2) 3.64e-1(1.26e-1)
IMF4 30 5.00e-4(2.24e-3) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 3.50e-3(1.18e-2) 4.35e-1(2.26e-2)
50 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 4.54e-1(9.95e-3)
100 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 4.35e-1(1.02e-1)
200 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 4.35e-1(1.02e-1)
IMF5 30 7.03e-1(1.39e-2) 6.13e-1(1.14e-2) 6.09e-1(1.85e-2) 7.23e-1(1.42e-2) 6.66e-1(4.81e-2) 7.04e-1(1.23e-2) 7.58e-1(1.69e-2)
50 7.07e-1(1.21e-2) 6.23e-1(2.08e-2) 6.23e-1(2.30e-2) 7.40e-1(9.99e-3) 6.28e-1(1.84e-2) 7.06e-1(1.15e-2) 7.53e-1(1.89e-2)
100 6.60e-1(1.05e-2) 5.70e-1(1.03e-2) 5.83e-1(9.10e-3) 6.83e-1(1.17e-2) 5.74e-1(1.23e-2) 6.54e-1(9.88e-3) 7.10e-1(3.50e-2)
200 6.32e-1(1.01e-2) 5.46e-1(5.98e-3) 5.78e-1(1.21e-2) 6.68e-1(8.13e-3) 5.46e-1(9.40e-3) 6.14e-1(1.43e-2) 7.13e-1(3.28e-2)
IMF6 30 2.98e-1(2.31e-2) 3.39e-1(2.07e-2) 3.39e-1(1.70e-2) 4.04e-1(1.35e-2) 3.72e-1(4.76e-2) 2.95e-1(1.76e-2) 4.08e-1(1.48e-2)
50 2.80e-1(2.24e-2) 3.35e-1(2.52e-2) 3.50e-1(2.64e-2) 4.03e-1(9.67e-3) 3.34e-1(2.66e-2) 2.70e-1(2.08e-2) 4.08e-1(1.37e-2)
100 1.97e-1(2.80e-2) 2.95e-1(1.10e-2) 3.08e-1(1.61e-2) 3.60e-1(9.45e-3) 2.67e-1(1.53e-2) 1.86e-1(2.35e-2) 3.16e-1(7.80e-2)
200 1.57e-1(1.89e-2) 2.73e-1(6.57e-3) 2.83e-1(1.49e-2) 3.47e-1(8.01e-3) 2.46e-1(8.21e-3) 1.42e-1(3.27e-2) 2.97e-1(3.92e-2)
IMF7 30 2.35e-1(1.54e-2) 1.62e-1(8.34e-3) 1.58e-1(5.23e-3) 1.91e-1(6.41e-3) 1.38e-1(8.51e-3) 2.19e-1(2.16e-2) 3.46e-1(4.31e-2)
50 2.54e-1(2.06e-2) 1.61e-1(2.24e-3) 1.61e-1(5.10e-3) 2.03e-1(1.02e-2) 1.45e-1(6.07e-3) 2.49e-1(2.34e-2) 3.69e-1(6.40e-2)
100 2.10e-1(2.22e-2) 1.51e-1(3.08e-3) 1.50e-1(6.49e-3) 1.84e-1(6.81e-3) 1.37e-1(4.70e-3) 2.06e-1(1.57e-2) 4.11e-1(2.24e-2)
200 1.78e-1(1.74e-2) 1.49e-1(3.08e-3) 1.48e-1(5.23e-3) 1.80e-1(9.45e-3) 1.40e-1(5.70e-17) 1.77e-1(1.49e-2) 3.46e-1(9.47e-2)
IMF8 30 3.50e-3(8.13e-3) 1.43e-1(2.07e-2) 1.71e-1(1.10e-1) 8.50e-2(3.07e-2) 1.53e-1(1.66e-1) 3.50e-3(8.13e-3) 3.55e-1(6.92e-2)
50 0.00e+0(0.00e+0) 1.28e-1(1.92e-2) 1.20e-1(1.38e-2) 2.00e-2(2.10e-2) 2.50e-3(1.12e-2) 0.00e+0(0.00e+0) 4.66e-1(4.80e-2)
100 0.00e+0(0.00e+0) 5.15e-2(4.37e-2) 1.40e-2(1.23e-2) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 3.40e-1(1.21e-1)
200 0.00e+0(0.00e+0) 1.05e-2(1.85e-2) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 2.24e-1(2.20e-1)
IMF9 30 6.77e-1(2.08e-2) 4.43e-1(5.79e-2) 3.92e-1(6.29e-2) 5.32e-1(3.54e-2) 4.86e-1(4.84e-2) 6.63e-1(2.03e-2) 7.78e-1(3.24e-2)
50 6.87e-1(3.10e-2) 4.41e-1(4.96e-2) 3.46e-1(4.49e-2) 5.82e-1(3.93e-2) 4.38e-1(5.59e-2) 6.81e-1(1.81e-2) 7.60e-1(2.75e-2)
100 6.28e-1(1.28e-2) 2.78e-1(4.39e-2) 2.41e-1(2.70e-2) 4.25e-1(3.17e-2) 3.32e-1(4.29e-2) 6.23e-1(1.26e-2) 7.37e-1(2.23e-2)
200 5.89e-1(1.12e-2) 1.88e-1(1.54e-2) 2.07e-1(2.64e-2) 4.20e-1(3.51e-2) 2.26e-1(1.79e-2) 5.90e-1(1.61e-2) 7.01e-1(5.72e-2)
IMF10 30 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0)
50 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0)
100 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0)
200 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0) 0.00e+0(0.00e+0)
2/32/6 0/36/4 1/31/8 10/24/6 0/36/4 1/33/6
  • ’, ’’ and ’’ indicate that the result is significantly better, significantly worse and statistically similar to that obtained by GMOEA, respectively.

TABLE II: The HV Results Obtained by NSGA-II, MOEA/D-DE, MOEA/D-CMA, IM-MOEA, GDE3, SPEA2, and GMOEA on 40 IMF Test Instances. The Best Result in Each Row is Highlighted.

The final non-dominated solutions achieved by the compared algorithms on bi-objective IMF3 and tri-objective IMF8 with 200 decision variables in the runs associated with the median IGD value are plotted in Fig. 5 and Fig. 6, respectively. It can be observed that GMOEA has achieved the best results on these problems, where the obtained non-dominated solutions are best converged.

Fig. 5: The final non-dominated solutions obtained by the compared algorithms on bi-objective IMF3 with 200 decision variables in the run associated with the median IGD value.
Fig. 6: The final non-dominated solutions obtained by the compared algorithms on bi-objective IMF8 with 200 decision variables in the run associated with the median IGD value.

The convergence profiles of the seven compared algorithms on nine IMF problems with 200 decision variables are given in Fig 7. It can be observed that GMOEA converges faster than the other six compared algorithms on most problems. The results have demonstrated the superiority of our proposed GMOEA over the six compared algorithms on MOPs with up to 200 decision variables in terms of convergence speed.

Fig. 7: The convergence profiles of the seven compared algorithms on IMF1 to IMF9 with 200 decision variables, respectively.

V Conclusion

In this work, we have proposed an MOEA driven by the GANs, termed GMOEA, for solving MOPs with up to 200 decision variables. Due to the learning and generative abilities of the GANs, GMOEA is effective in solving these problems.

The GANs in GMOEA are adopted for generating promising offspring solutions under the framework of MBEAs. In GMOEA, we first classify candidate solutions in the current population into two different datasets, where some high-quality candidate solutions are labeled as real samples and the rest ones are labeled as fake samples. Since the GANs mimic the distribution of target data, the distribution of real samples should consider two issues. The first issue is the diversity of training data, which ensures that the data could represent the general distribution of the expected solutions. The second issue is the convergence of training data, which ensures that the generated samples could satisfy the target of minimizing all the objectives.

A novel training method is proposed in GMOEA to take full advantage of the two datasets. During the training, both the real and fake datasets, as well as the data generated by the generator, are used to train the discriminator. It is highlighted that the proposed training method is demonstrated to be powerful and effective. Only a relatively small amount of training data is used for training the GANs (a total number of 100 samples for an MOP with 2 objectives and 105 samples for MOPs with 3 objectives). Besides, we also introduce an offspring reproduction strategy to further improve the performance of our proposed GMOEA. By hybridizing the classic stochastic reproduction and generating sampling based reproduction, the exploitation and exploration can be balanced.

To assess the performance of our proposed GMOEA, a number of empirical comparisons have been conducted on a set of MOPs with up to 200 decision variables. The general performance of our proposed GMOEA is compared with six representative MOEAs, namely, NSGA-II, MOEA/D-DE, MOEA/D-CMA, IM-MOEA, GDE3, and SPEA2. The statistical results demonstrate the superiority of GMOEA in solving MOPs with relatively high-dimensional decision variables.

This work demonstrates that the MOEA driven by the GAN is promising in solving MOPs. Therefore, it deserves further efforts to introduce more efficient generative models. Besides, the extension of our proposed GMOEA to MOPs with more than three objectives (many-objective optimization problems) is highly desirable. Moreover, its applications to real-world optimization problems are also meaningful.


  • [1] N. Siddique and H. Adeli, “Computational intelligence: synergies of fuzzy logic,” in

    Neural Networks and Evolutionary Computing

    .   John Wiley & Sons, 2013.
  • [2] J. Liu, M. Gong, Q. Miao, X. Wang, and H. Li, “Structure learning for deep neural networks based on multiobjective optimization,” IEEE Transactions on Neural Networks and Learning Systems, vol. 29, no. 6, pp. 2450–2463, 2018.
  • [3] W. Yu, B. Li, H. Jia, M. Zhang, and D. Wang, “Application of multi-objective genetic algorithm to optimize energy efficiency and thermal comfort in building design,” Energy and Buildings, vol. 88, pp. 135–143, 2015.
  • [4]

    P. V. R. Ferreira, R. Paffenroth, A. M. Wyglinski, T. M. Hackett, S. G. Bilén, R. C. Reinhart, and D. J. Mortensen, “Multi-objective reinforcement learning-based deep neural networks for cognitive space communications,” in

    Cognitive Communications for Aerospace Applications Workshop.   IEEE, 2017, pp. 1–8.
  • [5] K. Deb, “Multi-objective optimization,” in Search Methodologies.   Springer, 2014, pp. 403–449.
  • [6] Y. Tian, H. Wang, X. Zhang, and Y. Jin, “Effectiveness and efficiency of non-dominated sorting for evolutionary multi-and many-objective optimization,” Complex Intelligent Systems, vol. 3, pp. 247–263, 2017.
  • [7] H. Wang, Y. Jin, and X. Yao, “Diversity assessment in many-objective optimization,” IEEE Transactions on Cybernetics, vol. 47, no. 6, pp. 1510–1522, 2017.
  • [8] X. Zhang, Y. Tian, R. Cheng, and Y. Jin, “An efficient approach to non-dominated sorting for evolutionary multi-objective optimization,” IEEE Transactions on Evolutionary Computation, vol. 19, pp. 201–213, 2015.
  • [9] R. Cheng, Y. Jin, M. Olhofer, and B. Sendhoff, “A reference vector guided evolutionary algorithm for many-objective optimization,” IEEE Transactions on Evolutionary Computation, vol. 20, pp. 773–791, 2016.
  • [10] K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multi-objective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 182–197, 2002.
  • [11] E. Zitzler, M. Laumanns, L. Thiele et al., “SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization,” in Eurogen, vol. 3242, no. 103, 2001, pp. 95–100.
  • [12] Q. Zhang and H. Li, “MOEA/D: A multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on Evolutionary Computation, vol. 11, pp. 712–731, 2007.
  • [13] H. Li and Q. Zhang, “Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 13, pp. 284–302, 2009.
  • [14] N. Beume, B. Naujoks, and M. Emmerich, “SMS-EMOA: Multiobjective selection based on dominated hypervolume,” European Journal of Operational Research, vol. 181, no. 3, pp. 1653–1669, 2007.
  • [15] L. M. Antonio and C. A. C. Coello, “Use of cooperative coevolution for solving large scale multiobjective optimization problems,” in IEEE Congress on Evolutionary Computation.   IEEE, 2013, pp. 2758–2765.
  • [16] J. D. Knowles and D. W. Corne, “M-PAES: A memetic algorithm for multiobjective optimization,” in IEEE Congress on Evolutionary Computation.   IEEE, 2000, pp. 325–332.
  • [17] K. Praditwong and X. Yao, “A new multi-objective evolutionary optimisation algorithm: The two-archive algorithm,” in International Conference on Computational Intelligence and Security.   IEEE, 2006, pp. 286–291.
  • [18] A. E. Eiben and J. Smith, “From evolutionary computation to the evolution of things,” Nature, vol. 521, no. 7553, p. 476, 2015.
  • [19] R. Cheng, C. He, Y. Jin, and X. Yao, “Model-based evolutionary algorithms: a short survey,” Complex & Intelligent Systems, pp. 1–10, 2018.
  • [20] J. Zhang, Z.-h. Zhan, Y. Lin, N. Chen, Y.-j. Gong, J.-h. Zhong, H. S. Chung, Y. Li, and Y.-h. Shi, “Evolutionary computation meets machine learning: A survey,” IEEE Computational Intelligence Magazine, vol. 6, no. 4, pp. 68–75, 2011.
  • [21] Y. Jin, M. Olhofer, and B. Sendhoff, “On evolutionary optimization with approximate fitness functions,” in Genetic and Evolutionary Computation Conference, 2000, pp. 786–793.
  • [22] Y. Jin and B. Sendhoff, “A systems approach to evolutionary multiobjective structural optimization and beyond,” IEEE Computational Intelligence Magazine, vol. 4, no. 3, pp. 62–76, 2009.
  • [23] Y. Jin, “Surrogate-assisted evolutionary computation: Recent advances and future challenges,” Swarm and Evolutionary Computation, vol. 1, no. 2, pp. 61–70, 2011.
  • [24] R. Allmendinger, M. T. M. Emmerich, J. Hakanen, Y. J. Jin, and E. Rigoni, “Surrogate-assisted multicriteria optimization: Complexities, prospective solutions, and business case,” Journal of Multi-Criteria Decision Analysis, vol. 24, no. 1-2, pp. 5–24, 2017.
  • [25] W. Ponweiser, T. Wagner, D. Biermann, and M. Vincze, “Multiobjective optimization on a limited budget of evaluations using model-assisted -Metric selection,” in International Conference on Parallel Problem Solving from Nature.   Springer, 2008, pp. 784–794.
  • [26] C.-W. Seah, Y.-S. Ong, I. W. Tsang, and S. Jiang, “Pareto rank learning in multi-objective evolutionary algorithms,” in IEEE Congress on Evolutionary Computation.   IEEE, 2012.
  • [27]

    J. R. Koza, “Genetic programming as a means for programming computers by natural selection,”

    Statistics and Computing, vol. 4, no. 2, pp. 87–112, 1994.
  • [28] Q. Zhang, W. Liu, E. Tsang, and B. Virginas, “Expensive multiobjective optimization by MOEA/D with Gaussian process model,” IEEE Transactions on Evolutionary Computation, vol. 14, pp. 456–474, 2010.
  • [29] I. Loshchilov, M. Schoenauer, and M. Sebag, “A mono surrogate for multiobjective optimization,” in Annual Conference on Genetic and Evolutionary Computation.   ACM, 2010, pp. 471–478.
  • [30] X. Lu and K. Tang, “Classification-and regression-assisted differential evolution for computationally expensive problems,” Journal of Computer Science and Technology, vol. 27, no. 5, pp. 1024–1034, 2012.
  • [31] K. S. Bhattacharjee and T. Ray, “A novel constraint handling strategy for expensive optimization problems,” in World Congress on Structural and Multidisciplinary Optimization, 2015.
  • [32] J. Zhang, A. Zhou, and G. Zhang, “A classification and Pareto domination based multiobjective evolutionary algorithm,” in IEEE Congress on Evolutionary Computation.   IEEE, 2015, pp. 2883–2890.
  • [33] A. K. Jain and R. C. Dubes, “Algorithms for clustering data,” Technometrics, vol. 32, no. 2, pp. 227–229, 1988.
  • [34] J. Zhang, A. Zhou, K. Tang, and G. Zhang, “Preselection via classification: A case study on evolutionary multiobjective optimization,” Information Sciences, vol. 465, pp. 388–403, 2018.
  • [35]

    D. Svozil, V. Kvasnicka, and J. Pospichal, “Introduction to multi-layer feed-forward neural networks,”

    Chemometrics and Intelligent Laboratory Systems, vol. 39, no. 1, pp. 43–62, 1997.
  • [36] L. Pan, C. He, Y. Tian, H. Wang, X. Zhang, and Y. Jin, “A classification based surrogate-assisted evolutionary algorithm for expensive many-objective optimization,” IEEE Transactions on Evolutionary Computation, 2018.
  • [37] P. Larrañaga and J. A. Lozano, Estimation of distribution algorithms: A new tool for evolutionary computation.   Springer Science & Business Media, 2001, vol. 2.
  • [38] I. Giagkiozis and P. J. Fleming, “Pareto front estimation for decision making,” Evolutionary Computation, vol. 22, no. 4, pp. 651–678, 2014.
  • [39] P. Larranaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation.   Springer Science & Business Media, 2002.
  • [40] M. Laumanns and J. Ocenasek, “Bayesian optimization algorithms for multi-objective optimization,” in International Conference on Parallel Problem Solving from Nature.   Springer, 2002, pp. 298–307.
  • [41] P. A. Bosman and D. Thierens, “Multi-objective optimization with the naive IDA,” in Towards a New Evolutionary Computation.   Springer, 2006, pp. 123–157.
  • [42]

    J. Ocenasek, S. Kern, N. Hansen, and P. Koumoutsakos, “A mixed Bayesian optimization algorithm with variance adaptation,” in

    International Conference on Parallel Problem Solving from Nature.   Springer, 2004, pp. 352–361.
  • [43] Q. Zhang, A. Zhou, and Y. Jin, “RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm,” IEEE Transactions on Evolutionary Computation, vol. 12, pp. 41–63, 2008.
  • [44] H. Li, Q. Zhang, and J. Deng, “Biased multiobjective optimization and decomposition algorithm,” IEEE Transactions on Cybernetics, vol. 47, no. 1, pp. 52–66, 2017.
  • [45] I. Loshchilov, “CMA-ES with restarts for solving CEC 2013 benchmark problems,” in IEEE Congress on Evolutionary Computation.   Ieee, 2013, pp. 369–376.
  • [46] A. G. Hernández-Díaz, L. V. Santana-Quintero, C. A. Coello Coello, and J. Molina, “Pareto-adaptive -dominance,” Evolutionary Computation, vol. 15, no. 4, pp. 493–517, 2007.
  • [47] S. Z. Martínez, V. A. S. Hernández, H. Aguirre, K. Tanaka, and C. A. C. Coello, “Using a family of curves to approximate the Pareto front of a multi-objective optimization problem,” in International Conference on Parallel Problem Solving from Nature.   Springer, 2014, pp. 682–691.
  • [48] R. Cheng, Y. Jin, K. Narukawa, and B. Sendhoff, “A multiobjective evolutionary algorithm using Gaussian process-based inverse modeling,” IEEE Transactions on Evolutionary Computation, vol. 19, pp. 838–856, 2015.
  • [49]

    L. Parsons, E. Haque, and H. Liu, “Subspace clustering for high dimensional data: a review,”

    ACM SIGKDD Explorations Newsletter, vol. 6, no. 1, pp. 90–105, 2004.
  • [50] H. Wang, L. Jiao, R. Shang, S. He, and F. Liu, “A memetic optimization strategy based on dimension reduction in decision space,” Evolutionary Computation, vol. 23, no. 1, pp. 69–100, 2015.
  • [51] I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in Advances in Neural Information Processing Systems, 2014, pp. 2672–2680.
  • [52] A. Radford, L. Metz, and S. Chintala, “Unsupervised representation learning with deep convolutional generative adversarial networks,” arXiv preprint arXiv:1511.06434, 2015.
  • [53] C. Ledig, L. Theis, F. Huszár et al., “Photo-realistic single image super-resolution using a generative adversarial network,” in CVPR, vol. 2, no. 3, 2017, p. 4.
  • [54] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014.
  • [55] E. Zitzler and L. Thiele, “Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach,” IEEE Transactions on Evolutionary Computation, vol. 3, pp. 257–271, 1999.
  • [56] I. Goodfellow, Y. Bengio, A. Courville, and Y. Bengio, Deep Learning.   MIT press Cambridge, 2016, vol. 1.
  • [57] M. Leshno, V. Y. Lin, A. Pinkus, and S. Schocken, “Multilayer feedforward networks with a nonpolynomial activation function can approximate any function,” Neural Networks, vol. 6, no. 6, pp. 861–867, 1993.
  • [58] N. Balakrishnan, “Continuous multivariate distributions,” Wiley StatsRef: Statistics Reference Online, 2014.
  • [59] D. P. Kingma and M. Welling, “Auto-encoding variational bayes,” arXiv preprint arXiv:1312.6114, 2013.
  • [60] W. Haynes, “Wilcoxon rank sum test,” in Encyclopedia of Systems Biology.   Springer, 2013, pp. 2354–2355.
  • [61] Y. Tian, R. Cheng, X. Zhang, and Y. Jin, “PlatEMO: A MATLAB platform for evolutionary multi-objective optimization,” IEEE Computational Intelligence Magazine, vol. 12, pp. 73–87, 2017.
  • [62] K. Deb, Multi-objective optimization using evolutionary algorithms.   John Wiley & Sons, 2001, vol. 16.
  • [63] K. Deb and M. Goyal, “A combined genetic adaptive search (geneas) for engineering design,” Computer Science and Informatics, vol. 26, pp. 30–45, 1996.
  • [64] R. Storn and K. Price, “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
  • [65] A. Zhou, Y. Jin, Q. Zhang, B. Sendhoff, and E. Tsang, “Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion,” in IEEE Congress on Evolutionary Computation, 2006, pp. 892–899.
  • [66] C. He, L. Pan, H. Xu, Y. Tian, and X. Zhang, “An improved reference point sampling method on Pareto optimal front,” in IEEE Congress on Evolutionary Computation.   IEEE, 2016, pp. 5230–5237.
  • [67] L. While, P. Hingston, L. Barone, and S. Huband, “A faster algorithm for calculating hypervolume,” IEEE Transactions on Evolutionary Computation, vol. 10, pp. 29–38, 2006.