This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

An Analysis of Control Parameters of MOEA/D Under Two Different Optimization Scenarios

Ryoji Tanabe [email protected] Hisao Ishibuchi [email protected] Shenzhen Key Laboratory of Computational Intelligence, Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, China
Abstract

An unbounded external archive (UEA), which stores all nondominated solutions found during the search process, is frequently used to evaluate the performance of multi-objective evolutionary algorithms (MOEAs) in recent studies. A recent benchmarking study also shows that decomposition-based MOEA (MOEA/D) is competitive with state-of-the-art MOEAs when the UEA is incorporated into MOEA/D. However, a parameter study of MOEA/D using the UEA has not yet been performed. Thus, it is unclear how control parameter settings influence the performance of MOEA/D with the UEA. In this paper, we present an analysis of control parameters of MOEA/D under two performance evaluation scenarios. One is a final population scenario where the performance assessment of MOEAs is performed based on all nondominated solutions in the final population, and the other is a reduced UEA scenario where it is based on a pre-specified number of selected nondominated solutions from the UEA. Control parameters of MOEA/D investigated in this paper include the population size, scalarizing functions, and the penalty parameter of the penalty-based boundary intersection (PBI) function. Experimental results indicate that suitable settings of the three control parameters significantly depend on the choice of an optimization scenario. We also analyze the reason why the best parameter setting is totally different for each scenario.

keywords:
multi-objective optimization, decomposition based evolutionary algorithms, parameter study, external archive
journal: Applied Soft Computing

1 Introduction

An unconstrained (bound-constrained) multi-objective optimization problem (MOP) can be formulated as follows:

minimize 𝒇(𝒙)=(f1(𝒙),,fM(𝒙))T\displaystyle\mbox{\boldmath$f$}(\mbox{\boldmath$x$})=\bigl{(}f_{1}(\mbox{\boldmath$x$}),...,f_{M}(\mbox{\boldmath$x$})\bigr{)}^{\rm T} (1)
subject to 𝒙𝕊D,\displaystyle\mbox{\boldmath$x$}\in\mathbb{S}\subseteq\mathbb{R}^{D},

where 𝒇:𝕊M\mbox{\boldmath$f$}:\mathbb{S}\rightarrow\mathbb{R}^{M} is an objective function vector that consists of MM potentially conflicting objective functions, and M\mathbb{R}^{M} is the objective function space. Here, 𝒙=(x1,,xD)T\mbox{\boldmath$x$}=(x_{1},...,x_{D})^{\rm T} is a DD-dimensional solution vector, and 𝕊=Πj=1D[xjmin,xjmax]\mathbb{S}=\Pi^{D}_{j=1}[x^{\rm min}_{j},x^{\rm max}_{j}] is the bound-constrained search space where xjminxjxjmaxx^{\rm min}_{j}\leq x_{j}\leq x^{\rm max}_{j} for each index j{1,,D}j\in\{1,...,D\}.

We say that 𝒙1\mbox{\boldmath$x$}^{1} dominates 𝒙2\mbox{\boldmath$x$}^{2} if and only if fi(𝒙1)fi(𝒙2)f_{i}(\mbox{\boldmath$x$}^{1})\leq f_{i}(\mbox{\boldmath$x$}^{2}) for all i{1,,M}i\in\{1,...,M\} and fi(𝒙1)<fi(𝒙2)f_{i}(\mbox{\boldmath$x$}^{1})<f_{i}(\mbox{\boldmath$x$}^{2}) for at least one index ii. Here, 𝒙\mbox{\boldmath$x$}^{*} is a Pareto-optimal solution if there exists no 𝒙𝕊\mbox{\boldmath$x$}\in\mathbb{S} such that 𝒙x dominates 𝒙\mbox{\boldmath$x$}^{*}. In this case, 𝒇(𝒙)\mbox{\boldmath$f$}(\mbox{\boldmath$x$}^{*}) is a Pareto-optimal objective function vector. The set of all 𝒙\mbox{\boldmath$x$}^{*} in 𝕊\mathbb{S} is the Pareto-optimal solution set (PS), and the set of all 𝒇(𝒙)\mbox{\boldmath$f$}(\mbox{\boldmath$x$}^{*}) is the Pareto front (PF). Usually, no solution can simultaneously minimize all objective functions f1,,fMf_{1},...,f_{M} in MOPs. Thus, the goal of MOPs is to find a set of nondominated solutions that are well-distributed and close to the PF in the objective function space. MOPs frequently appear in engineering problems such as aerodynamic wing design problems [1], financial and economic problems [2], oil well problems [3], and unit commitment problems [4]. In general, it is difficult to find a set of good nondominated solutions on MOPs with large values of MM and/or DD. This is because the objective function and solution spaces exponentially grow with MM and DD, respectively.

A multi-objective evolutionary algorithm (MOEA) is an efficient approach for solving MOPs [5]. Since MOEAs use a set of individuals (solutions of a given MOP) for the search, it is expected that well-distributed nondominated solutions can be found in a single run. A number of MOEAs have been proposed in the evolutionary computation community [6, 7]. MOEAs can be roughly classified into the following three categories: dominance-based MOEAs, indicator-based MOEAs, and decomposition-based MOEAs. Dominance-based MOEAs (e.g., NSGA-II [8], SPEA2 [9], and ϵ\epsilon-MOEA [10]) mainly use the Pareto dominance or relaxed dominance relations for the mating and environmental selections. An indicator-based MOEA assigns a so-called fitness value to each individual in the population using a quality indicator [11]. Representative indicator-based MOEAs include IBEA [11], SMS-EMOA [12], and HypE [13]. A decomposition-based MOEA decomposes a given MOP with MM objectives into multiple single-objective sub-problems111Some decomposition based MOEAs (e.g., MOEA/D-M2M [14]) decompose a given MOP into a set of simple MOPs. using a scalarizing function g:Mg:\mathbb{R}^{M}\rightarrow\mathbb{R} and tries to find good solutions for all the subproblems. Well-known decomposition based MOEAs are MOGLS [15], C-MOGA [16], MSOPS [17], and MOEA based on decomposition (MOEA/D) [18]. In particular, recent studies report the promising performance of MOEA/D-type algorithms [19].

MOEA/D [18] decomposes an MM-objective MOP defined in equation (1) into μ\mu single-objective sub-problems g1(𝒙|𝒘1),,gμ(𝒙|𝒘μ)g_{1}(\mbox{\boldmath$x$}|\mbox{\boldmath$w$}^{1}),...,g_{\mu}(\mbox{\boldmath$x$}|\mbox{\boldmath$w$}^{\mu}) using a set of weight vectors 𝑾={𝒘1,,𝒘μ}\mbox{\boldmath$W$}=\{\mbox{\boldmath$w$}^{1},...,\mbox{\boldmath$w$}^{\mu}\} and a scalarizing function gg, where 𝒘i=(w1i,,wMi)T\mbox{\boldmath$w$}^{i}=(w^{i}_{1},...,w^{i}_{M})^{\rm T} (i{1,,μ}i\in\{1,...,\mu\}) and j=1Mwji=1\sum^{M}_{j=1}w^{i}_{j}=1. MOEA/D assigns each individual 𝒙i\mbox{\boldmath$x$}^{i} (i{1,,μ}i\in\{1,...,\mu\}) to each sub-problem and tries to find the optimal solution of all subproblems simultaneously. Unlike other MOEAs, in MOEA/D, the mating and environmental selections are performed only in a set of neighborhood individuals of each weight vector 𝒘i\mbox{\boldmath$w$}^{i}. Recent studies show that improved MOEA/D-type algorithms are capable of finding good nondominated solutions on MOPs with complex PFs [20, 21, 22, 23]. Although MOEA/D was originally designed for MOPs with up to four objectives, its variants can efficiently handle a large number of objectives [24, 25]. Also, MOEA/D-type algorithms are successfully applied to real-world problems [19].

In general, the performance of evolutionary algorithms significantly depends on control parameter settings [26, 27]. MOEAs including MOEA/D are not an exception. Therefore, it is important to understand how each control parameter influences the performance of MOEA/D. General rules of thumb are helpful to users for tuning control parameters of MOEA/D (e.g., the population size μ\mu should be set to approximately 2828 on three-objective multimodal MOPs). For these reasons, some parameter studies have been performed for MOEA/D as briefly reviewed below:

Population size μ\mu:

The population size μ\mu is an important parameter for all MOEAs. However, there exist only a few studies that investigate the impact of μ\mu on the performance of MOEA/D. Experimental results in the original MOEA/D paper [18] show that MOEA/D with a small μ\mu value (μ=20\mu=20) can successfully find well-approximated nondominated solutions close to the PF. The performance of NSGA-II and MOEA/D with various μ\mu values is investigated in [28]. Results on multi-objective knapsack problems show that MOEA/D with a very large μ\mu value works well on most of the problems, while such μ\mu values make the convergence speed of NSGA-II slow. In [29], the performance of two reference-vector based MOEAs (NSGA-III [30] and θ\theta-DEA [31]) and two MOEA/D variants (MOEA/D and MOEA/DD [24]) with three μ\mu values are evaluated on three- and five-objective MOPs. Experimental results in [29] show that the best μ\mu value is different for each MOEA.

Scalarizing function gg:

In MOEA/D, a fitness value of an individual on each sub-problem j{1,,μ}j\in\{1,...,\mu\} is given by a pre-defined scalarizing function gg. Therefore, the performance of MOEA/D is affected by the scalarizing function gg used for the search [18, 32, 33]. Typical scalarizing functions for MOEA/D include the weighted sum, Chebyshev, and Penalty-based Boundary Intersection (PBI) functions [18]. It is pointed out that MOEA/D with the weighted sum function does not have an ability to handle MOPs with non-convex PFs [18]. In [33], the behavior of MOEA/D with the three representative scalarizing functions is investigated on multi-objective knapsack problems with up to 10 objectives. Some studies (e.g., [18, 30]) report that MOEA/D with the PBI function can find evenly distributed nondominated solutions compared to the Chebyshev function. Since an appropriate scalarizing function is different problem dependent, adaptive selection strategies have also been proposed for these [32, 34].

Penalty parameter θ\theta:

The efficiency of the PBI function is significantly influenced by the setting of the penalty parameter θ\theta. The impact of θ\theta values on the performance of MOEA/D is examined in [35, 36]. A deterministic control method for θ\theta is also proposed in [22].

It should be noted that the above-described parameter studies (except for [29]) are based on only the final population scenario [37], where all nondominated solutions in the final population are used for the performance assessment. The final population scenario is the most widely used optimization scenario and adopted in almost all previous studies of MOEA/D (e.g., [21, 22, 23, 24, 30, 31]). While the final population scenario is commonly used in the evolutionary computation community, it is not always a practically desirable optimization scenario [38]. In the final population scenario, if the number of nondominated solutions found in the search exceeds the predefined population size μ\mu, they are removed from the population to keep the population size constant. This operation is undesirable if a user wants to know the entire PF using a large number of nondominated solutions. A good potential solution found in the search is also possibly to be discarded from the population [38]. Such problems are easily addressed by using an unbounded external archive (UEA) [39, 40] that stores all nondominated solutions found during the search process. For such reasons, the UEA is frequently used in recent work (e.g., [37, 38, 41, 42, 43, 44]). The recent COCO platform222http://coco.gforge.inria.fr/doku.php?id=algorithms-biobj with the BBOB-biobj functions [45] also adopts the UEA for the performance assessment of multi-objective optimization methods.

One may think that decision makers usually want to know only a small number of representative, well-distributed nondominated solutions, and thus the use of a large number of nondominated solutions in the UEA for performance assessment does not make sense. Fortunately, such an issue can be easily addressed by applying a selection method of a small number of nondominated solutions (e.g., [37, 38, 46, 47, 48, 49, 50]) to the UEA. Therefore, there is no particular reason not to incorporate the UEA into MOEAs especially if the computational cost for archive maintenance is sufficiently small in comparison with the objective function evaluation of each solution as in many real-world application problems333A simulation run that takes a long time is required for some real-world problems to evaluate a single solution [51, 52].. According to [37], an optimization scenario that uses a pre-specified number of selected nondominated solutions from the UEA for the performance assessment is called the reduced UEA scenario in this paper. A benchmarking study in [37] shows that MOEA/D and its variants (MOEA/D-DE [20] and MOEA/D-DRA [49]) are competitive with state-of-the-art methods under the reduced UEA scenario.

This paper presents an analysis of control parameters of MOEA/D on MOPs with up to five objectives under the final population and reduced UEA scenarios. Since MOEA/D performs well under the reduced UEA scenario as reported in [37], such an analysis is worth performing and helpful to both its users and algorithm designers who try to develop more efficient MOEA/D. We investigate the following three control parameters of MOEA/D: the population size μ\mu, scalarizing functions gg, and the penalty parameter θ\theta of the PBI function. As far as we know, parameter studies of MOEA/D for the reduced UEA scenario have not been well performed. As mentioned above, most of the previous analytical studies are based only on results for the traditional final population scenario. Although the reduced UEA scenario is frequently used in recent studies, it is unclear whether MOEA/D with a suitable parameter setting for the final population scenario works similarly under the reduced UEA scenario. Some MOEA/D algorithms with an external archive have also been proposed (e.g., [18, 53, 54]), but parameter studies are not performed in the literature. Whereas parameter tuning studies (not analytical studies) of MOEAs for the final population scenario (e.g., [55, 56]) and the UEA scenario444The UEA scenario was named in [37]. All nondominated solutions in the UEA are used for the performance assessment under the UEA scenario. (e.g., [43, 57]) have been presented individually, they do not investigate how different the tuned parameter values are between the two different optimization scenarios. The main contributions of this paper can be summarized as follows:

  • 1.

    We carefully examine proper settings of the three control parameters (μ\mu, gg, and θ\theta) which realize the best performance of MOEA/D on the four DTLZ [58] and nine WFG [59] test problems in a component-wise manner.

  • 2.

    In addition to the one-by-one analysis, we investigate dependencies between two control parameters of MOEA/D.

  • 3.

    By comparing experimental results between the final population and reduced UEA scenarios, we also reveal how different appropriate settings of the three control parameters of MOEA/D are for each scenario.

  • 4.

    Furthermore, the reason why the best parameter setting on some MOPs is totally different for each scenario is analyzed in this paper.

This paper is organized as follows: Section 2 describes the basic procedure of MOEA/D. Experimental settings are introduced in Section 3. Section 4 shows the analysis of the three control parameters (μ\mu, gg, and θ\theta) of MOEA/D, separately. Section 5 presents further analysis of the three control parameters. Finally, Section 6 concludes this paper and discusses the future work.

2 MOEA/D

Here, MOEA/D [18] is briefly explained. Algorithm 1 shows the overall procedure of MOEA/D. MOEA/D decomposes an MOP with MM objectives into μ\mu single-objective sub-problems using a set of uniformly distributed weight vectors 𝑾={𝒘1,,𝒘μ}\mbox{\boldmath$W$}=\{\mbox{\boldmath$w$}^{1},...,\mbox{\boldmath$w$}^{\mu}\}. In our study, Das and Dennis’s systematic approach [60] was used to generate the weight vectors 𝑾W.

At the beginning of the search, all individuals in the population are randomly generated in the search space 𝕊\mathbb{S} (line 1). For each subproblem index i{1,,μ}i\in\{1,...,\mu\}, an index list 𝑩i={i1,,iT}\mbox{\boldmath$B$}^{i}=\{i_{1},...,i_{T}\}, which is used for the mating and replacement selections, is initialized: 𝑩i\mbox{\boldmath$B$}^{i} consists of indices of the TT closest weight vectors to 𝒘i\mbox{\boldmath$w$}^{i} in the weight vector space (lines 2-3) where TT is the neighborhood size.

After the initialization, the following steps are repeatedly applied for each subproblem i{1,..,μ}i\in\{1,..,\mu\} until the search termination criteria are met. For each ii, the parent indices kk and ll are randomly selected from 𝑩i\mbox{\boldmath$B$}^{i} (line 6). Then, a child 𝒖i\mbox{\boldmath$u$}^{i} is generated by crossing 𝒙k\mbox{\boldmath$x$}^{k} and 𝒙l\mbox{\boldmath$x$}^{l} (line 7). A mutation operator is applied to the child 𝒖i\mbox{\boldmath$u$}^{i} if necessary (line 8). After 𝒖i\mbox{\boldmath$u$}^{i} has been generated, the replacement selection is performed using a predefined scalarizing function gg (lines 9–11). For each j𝑩ij\in\mbox{\boldmath$B$}^{i}, the individual 𝒙j\mbox{\boldmath$x$}^{j} is compared with the child 𝒖i\mbox{\boldmath$u$}^{i} based on gg. If 𝒖i\mbox{\boldmath$u$}^{i} is better than 𝒙j\mbox{\boldmath$x$}^{j} according to their scalarizing function values based on the weight vector 𝒘j\mbox{\boldmath$w$}^{j}, 𝒙j\mbox{\boldmath$x$}^{j} is replaced by 𝒖i\mbox{\boldmath$u$}^{i} (lines 10–11).

1 t1t\leftarrow 1, initialize the population 𝑷={𝒙1,,𝒙μ}\mbox{\boldmath$P$}=\{\mbox{\boldmath$x$}^{1},...,\mbox{\boldmath$x$}^{\mu}\};
2 for i{1,,μ}i\in\{1,...,\mu\} do
3       Set the neighborhood index list 𝑩i={i1,,iT}\mbox{\boldmath$B$}^{i}=\{i_{1},...,i_{T}\};
4      
5while The termination criteria are not met do
6       for i{1,,μ}i\in\{1,...,\mu\} do
7             Randomly select two indices kk and ll from 𝑩i\mbox{\boldmath$B$}^{i};
8             Generate a child 𝒖i\mbox{\boldmath$u$}^{i} by crossing 𝒙k\mbox{\boldmath$x$}^{k} and 𝒙l\mbox{\boldmath$x$}^{l};
9             Apply a mutation operator to 𝒖i\mbox{\boldmath$u$}^{i};
10             for j𝐁ij\in\mbox{\boldmath$B$}^{i} do
11                   if g(𝐮i|𝐰j,𝐳)g(𝐱j|𝐰j,𝐳)g(\mbox{\boldmath$u$}^{i}|\mbox{\boldmath$w$}^{j},\mbox{\boldmath$z$}^{*})\leq g(\mbox{\boldmath$x$}^{j}|\mbox{\boldmath$w$}^{j},\mbox{\boldmath$z$}^{*}) then
12                         𝒙j𝒖i\mbox{\boldmath$x$}^{j}\leftarrow\mbox{\boldmath$u$}^{i};
13                        
14                  
15            
16      tt+1t\leftarrow t+1;
17      
Algorithm 1 The procedure of MOEA/D

Since the replacement of individuals is based on their scalarizing function values, gg plays a crucial role in MOEA/D. Although there are a number of scalarizing functions as reviewed in [61], in this paper we investigated the following three scalarizing functions: the two Chebyshev functions (a multiplication version gchmg^{\rm chm} [18] and a division version gchdg^{\rm chd} [62, 63, 25]) and the PBI function gpbig^{\rm pbi} [18]. Since the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi}) are most widely used ones in the literature, they are worth investigating. The three scalarizing functions are defined as follows:

gchm(𝒙|𝒘,𝒛)\displaystyle g^{\rm chm}(\mbox{\boldmath$x$}|\mbox{\boldmath$w$},\mbox{\boldmath$z$}^{*}) =maxi{1,,M}{wi|fi(𝒙)zi|},\displaystyle=\max_{i\in\{1,...,M\}}\{w_{i}|f_{i}(\mbox{\boldmath$x$})-z^{*}_{i}|\}, (2)
gchd(𝒙|𝒘,𝒛)\displaystyle g^{\rm chd}(\mbox{\boldmath$x$}|\mbox{\boldmath$w$},\mbox{\boldmath$z$}^{*}) =maxi{1,,M}{|fi(𝒙)zi|wi},\displaystyle=\max_{i\in\{1,...,M\}}\left\{\frac{|f_{i}(\mbox{\boldmath$x$})-z^{*}_{i}|}{w_{i}}\right\}, (3)
gpbi(𝒙|𝒘,𝒛)\displaystyle g^{\rm pbi}(\mbox{\boldmath$x$}|\mbox{\boldmath$w$},\mbox{\boldmath$z$}^{*}) =d1+θd2,\displaystyle=d_{1}+\theta\,d_{2}, (4)
d1\displaystyle d_{1} =(𝒇(𝒙)𝒛)T𝒘𝒘,\displaystyle=\frac{\|\left(\mbox{\boldmath$f$}(\mbox{\boldmath$x$})-\mbox{\boldmath$z$}^{*}\right)^{\rm T}\,\mbox{\boldmath$w$}\|}{\|\mbox{\boldmath$w$}\|}, (5)
d2\displaystyle d_{2} =𝒇(𝒙)(𝒛+d1𝒘𝒘),\displaystyle=\left\|\mbox{\boldmath$f$}(\mbox{\boldmath$x$})-\left(\mbox{\boldmath$z$}^{*}+d_{1}\,\frac{\mbox{\boldmath$w$}}{\|\mbox{\boldmath$w$}\|}\right)\right\|, (6)

where all the three scalarizing functions in equations (2), (3), and (4) should be minimized. The 𝒛=(z1,,zM)T\mbox{\boldmath$z$}^{*}=(z^{*}_{1},...,z^{*}_{M})^{\rm T} is the ideal point. Since it is difficult to obtain the actual ideal point 𝒛\mbox{\boldmath$z$}^{*} of a given MOP, its approximated point that consists of the minimum function value for each objective fif_{i} (i{1,,M}i\in\{1,...,M\}) found during the search process is usually used for the calculation of equations (2) – (6). For gchdg^{\rm chd} in equation (3), if wi=0w_{i}=0, it was set to 10610^{-6} for its implementation to avoid division by zero. While the Chebyshev function gchmg^{\rm chm} defined in equation (2) is one of the most frequently used scalarizing functions, some studies (e.g., [62, 25]) use its alternative version gchdg^{\rm chd}. This is because the search directions of MOEA/D can be more evenly distributed by using gchdg^{\rm chd} [63].

In equations (5) and (6), d1d_{1} denotes how close the objective function vector 𝒇(𝒙)\mbox{\boldmath$f$}(\mbox{\boldmath$x$}) is to the PF, and d2d_{2} is the perpendicular distance between 𝒇(𝒙)\mbox{\boldmath$f$}(\mbox{\boldmath$x$}) and 𝒘w. The two distance measures d1d_{1} and d2d_{2} evaluate the convergence and diversity of the solution 𝒙x in the objective function space, respectively. The PBI function value calculated by equation (4) is the sum of d1d_{1} and θd2\theta\,d_{2}. The penalty parameter θ>0\theta>0 controls the balance between the convergence (d1d_{1}) and diversity (d2d_{2}) in the population. While a small θ\theta encourages convergence toward the PF, a large θ\theta value emphasizes the importance of diversity in the population [33].

Table 1: Properties of the DTLZ and WFG test problems.
Problem Shape of PF Multimodality Nonseparability Others
DTLZ1 Linear \checkmark
DTLZ2 Nonconvex
DTLZ3 Nonconvex \checkmark
DTLZ4 Nonconvex Biased
WFG1 Mixed Biased
WFG2 Discontinuous \checkmark \checkmark
WFG3 Partially Degenerate \checkmark
WFG4 Nonconvex \checkmark
WFG5 Nonconvex Deceptive
WFG6 Nonconvex \checkmark
WFG7 Nonconvex Biased
WFG8 Nonconvex \checkmark Biased
WFG9 Nonconvex \checkmark \checkmark Deceptive, Biased

3 Experimental settings

This section introduces our experimental settings. Experimental results are reported in Section 4 and 5. Subsection 3.1 describes test problems and a performance indicator used in our study. In our study, we used the average performance score (APS) [13] to aggregate the performance of MOEA/D with various configurations on 13 MOPs. The calculation method of the APS value is described in Subsection 3.2. Subsection 3.3 introduces the parameter settings of MOEA/D.

3.1 Test problems and performance indicator

The four DTLZ [58] and nine WFG [59] test problems with M{2,3,4,5}M\in\{2,3,4,5\} were used in our analysis study. Table 1 summarizes their properties. The shapes of the PFs of the WFG1, WFG2, and WFG3 test problems are complicated, discontinuous, and partially degenerate [64], respectively. The DTLZ1 problem has a linear PF. The shapes of the PFs of the other problems are nonconvex PFs. According to [58], for the DTLZ problems, the number of the position variables kk was set to k=5k=5 for the DTLZ1 problem and k=10k=10 for the other DTLZ problems, where the number of variables is D=M+k1D=M+k-1. Also, as suggested in [59], for the WFG test problems, the number of the position variables kk was set to k=2(M1)k=2\,(M-1), and the number of the distance variables ll was set to l=20l=20, where D=k+lD=k+l.

The hypervolume (HV) indicator [65] was used for evaluating the quality of a set of obtained nondominated solutions 𝑨A. Before calculating the HV value, the objective function vector 𝒇(𝒙)\mbox{\boldmath$f$}(\mbox{\boldmath$x$}) of each 𝒙𝑨\mbox{\boldmath$x$}\in\mbox{\boldmath$A$} was normalized using the ideal point and the nadir point of the target MOP. As suggested in [66], the reference point for the HV calculation was set to (1.1,,1.1)T(1.1,...,1.1)^{\rm T}. In this setting, the HV range for all of the WFG test problems is [0,1.1M][0,1.1^{M}]. We further normalized HV values [0,1.1M]\in[0,1.1^{M}] to the range [0,1][0,1] by dividing by 1.1M1.1^{M}. The HV value of 𝑨A was calculated for every 2 0002\,000 function evaluations.

As mentioned in Section 1, all nondominated solutions in the population 𝑷P are used for the HV calculation under the final population scenario. For the reduced UEA scenario, a selection method of a small number of nondominated solutions from the UEA is necessary. Although there are some computationally cheap selection methods (e.g., [38, 49, 50]), we used a distance-based selection method described in [37]. In this selection method, a pre-defined number of solutions bb is selected from the UEA. First, MM extreme solutions having the minimum objective function values for fif_{i} (i{1,,M}i\in\{1,...,M\}) are selected for 𝑩B. After that, a nondominated solution which is farthest from a set of already selected ones in the objective function space is repeatedly added to 𝑩B until the size of 𝑩B is equal to bb. It is expected that a set of uniformly distributed nondominated solutions in the objective function space are obtained by the distance-based selection method. In our study, the number of selected nondominated solutions bb was set to 200200, 210210, 220220, and 210210 for M=2M=2, 33, 44, and 55, respectively.

Refer to caption
Figure 1: Distribution of nondominated solutions found by MOEA/D with μ=210\mu=210 and gchmg^{\rm chm} on the three-objective WFG4 problem under (i) the final population scenario, (ii) the UEA scenario, and (iii) the reduced UEA scenario. Results at 2×1032\times 10^{3} (left), 1×1041\times 10^{4} (center), and 5×1045\times 10^{4} (right) function evaluations (FEvals) are shown. In the UEA scenario, all nondominated solutions in the UEA are used for the performance assessment [37]. The number of selected nondominated solutions bb for the reduced UEA scenario was set to 210210 for M=3M=3. Results of a single run are shown.

For the sake of explanation, we show the distribution of nondominated solutions found by MOEA/D with μ=210\mu=210 and gchmg^{\rm chm} on the three-objective WFG4 problem under (i) the final population scenario, (ii) the UEA scenario, and (iii) the reduced UEA scenario in Figure 1. Results at 2×1032\times 10^{3}, 1×1041\times 10^{4}, and 5×1045\times 10^{4} function evaluations are shown. As shown in Figure 1, the distribution of nondominated solutions in the population and the UEA is significantly different after 1×1041\times 10^{4} function evaluations. In the final population scenario, nondominated solutions to be preserved in the population in the next iteration are determined according to the environmental selection of MOEA/D (lines 9–11 in Algorithm 1). In contrast, in the UEA scenario, if a newly generated solution is nondominated with respect to existing solutions in the UEA, it enters the UEA. Then, solutions dominated by the newly inserted solution are discarded from the UEA. As seen from Figure 1(ii), the number of nondominated solutions in the UEA gradually increases as the search progresses. At 5×1045\times 10^{4} function evaluations, nondominated solutions in the UEA cover the entire PF. In the reduced UEA scenario, a limited number of nondominated solutions are selected from the UEA using the above-mentioned distance-based selection method. Sparsely distributed nondominated solutions can be found in Figure 1(iii). In summary, the selection of nondominated solutions in the (reduced) UEA scenario is performed independently from the environmental selection of MOEA/D.

3.2 Average Performance Score (APS)

Here, the APS calculation method [13] is introduced. Suppose that nn algorithms A1,,AnA_{1},...,A_{n} are compared for a given problem instance based on the HV values obtained in multiple runs. For each i{1,,n}i\in\{1,...,n\} and j{1,,n}\{i}j\in\{1,...,n\}\backslash\{i\}, let δi,j=1\delta_{i,j}=1, if AjA_{j} significantly outperforms AiA_{i} using the Wilcoxon rank-sum test with p<0.05p<0.05, otherwise δi,j=0\delta_{i,j}=0. Then, the performance score P(Ai)P(A_{i}) is defined as follows: P(Ai)=j{1,,n}\{i}nδi,jP(A_{i})=\sum^{n}_{j\in\{1,...,n\}\backslash\{i\}}\delta_{i,j}. The score P(Ai)P(A_{i}) represents the number of algorithms outperforming AiA_{i}. The APS value of AiA_{i} is the average of the P(Ai)P(A_{i}) values for all the considered problem instances. In other words, the APS value of AiA_{i} represents how good (relatively) the performance of AiA_{i} is among the nn algorithms on average over all problem instances. A small APS value indicates that the performance of the target algorithm is better than other compared algorithms.

Table 2: Settings for the three control parameters of MOEA/D (the population size μ\mu, the scalarizing function gg, and the penalty value θ\theta of the PBI function gpbig^{\rm pbi}). Unless explicitly noted, the default settings were used in our experimental study. Examined settings in the table denote parameter values which are investigated in our analytical study, and each result can be found in its corresponding section.
Control parameters Default settings Examined settings Corresponding sections
μ\mu for M=2M=2{\{ μ\mu for M=3M=3{\{ μ\mu for M=4M=4{\{ μ\mu for M=5M=5{\{ 200200{\{ 210210{\{ 220220{\{ 210210{\{ {25,50,100,200,300,400}\{25,50,100,200,300,400\} {28,55,105,210,300,406}\{28,55,105,210,300,406\} {35,56,120,220,286,455}\{35,56,120,220,286,455\} {126,210,330,495}\{126,210,330,495\} Section 4.1
gg gchmg^{\rm chm} {gchm,gchd,gpbi}\{g^{\rm chm},g^{\rm chd},g^{\rm pbi}\} Section 4.2
θ\theta 55 {0.1,0.5,1,2,3,5,8,10}\{0.1,0.5,1,2,3,5,8,10\} Section 4.3

3.3 Parameter settings for MOEA/D

Table 2 shows the settings of the three control parameters (μ\mu, gg, and θ\theta) of MOEA/D. Unless explicitly noted, the default settings in Table 2 were used in our experimental study. Then, the influence from each control parameter on the performance of MOEA/D is investigated in a component-wise manner. That is, we analyzed the effect of μ\mu, gg, and θ\theta on MOEA/D individually.

We implemented MOEA/D by modifying the source code of MOEA/D-DE [20] which was downloaded from the jMetal website555http://jmetal.sourceforge.net/. According to [18], the neighborhood size TT of MOEA/D was set to 2020. The SBX crossover and the polynomial mutation were used in MOEA/D. The control parameters of the variation operators were set as follows: pc=1p_{c}=1, ηc=20\eta_{c}=20, pm=1/Dp_{m}=1/D, and ηm=20\eta_{m}=20. A simple normalization strategy described in [18] was introduced into MOEA/D to handle differently scaled objective function values.

4 Experimental results and discussion

Here, we report and discuss the experimental results of MOEA/D with various control parameter settings. See Table 2 for the organization of this section. Subsections 4.1, 4.2, and 4.3 are also organized as follows: First, we summarize the overall performance of MOEA/D with various configurations on the 13 MOPs based on the APS (Subsections 4.1.1, 4.2.1, and 4.3.1). Then, experimental results on each problem are described (Subsections 4.1.2, 4.2.2, and 4.3.2). Finally, we discuss and analyze our results of MOEA/D with each control parameter setting (Subsections 4.1.3, 4.2.3, and 4.3.3).

Since some real-world problems require the execution of a simulation that takes a long time to evaluate the solution, the maximum number of functions evaluations is dependent on the user’s available time [51, 52]. For this reason, a well-performing MOEA should be able to return a set of good nondominated solutions to a user at any time [43]. Also, as pointed out in [44], the comparison based on the end-of-the-run results does not provide sufficient information about the performance of MOEAs. Therefore, we mainly discuss our experimental results based on the anytime performance of MOEA/D, rather than the end-of-the-run results.

On the one hand, when the number of nondominated solutions obtained by MOEA/D exceeds a predefined μ\mu value, some of them are discarded from the population in order to keep μ\mu constant. Therefore, the quality of solutions, regarding the HV metric, directly depends on μ\mu and the environmental selection under the final population scenario. On the other hand, when using the UEA, all nondominated solutions generated by MOEA/D are stored into the UEA independently from the environmental selection. Thus, the performance of MOEA/D is indirectly influenced by μ\mu and the environmental selection under the reduced UEA scenario. Also, a large number of nondominated solutions can be examined and selected for the HV calculation for the reduced UEA scenario. Due to this reason, in most cases, the HV value under the reduced UEA scenario is better than that under the final population scenario in our experimental results. For example, see Figure 3.

Refer to caption
Figure 2: Overall performance of MOEA/D with various μ\mu settings on the 13 problems (the four DTLZ and nine WFG problems) with M{2,3,4,5}M\in\{2,3,4,5\} (lower is better). The horizontal and vertical axes represent the number of function evaluations and the APS values, respectively. A small APS value indicates that a corresponding setting performs relatively better than the other settings. For the APS value [13], see Subsection 3.2.

4.1 Influence of the population size μ\mu on the performance of MOEA/D under two scenarios

4.1.1 Overall performance

Figure 2 shows the overall performance of MOEA/D with various μ\mu settings on the 13 problems with M{2,3,4,5}M\in\{2,3,4,5\} under (a) the final population scenario and (b) the reduced UEA scenario. It should be noted that results for (a) the final population scenario and (b) the reduced UEA scenario shown in this paper are obtained from the identical MOEA/D runs.

First, we describe results of MOEA/D for the final population scenario shown in Figure 2(a). For M=2M=2, while MOEA/D with small μ\mu values (μ{25,50}\mu\in\{25,50\}) perform better than that with larger μ\mu values (μ{100,200,300,400}\mu\in\{100,200,300,400\}) just after the beginning of the search, their APS values gradually deteriorate as the search progresses. When MM is increasing, such a tendency is more noticeable. For M3M\geq 3, after several function evaluations, the larger μ\mu value is used for MOEA/D, the better APS value is achieved. The best performance of MOEA/D is obtained with the largest μ\mu value (μ=406,455,\mu=406,455, and 495495 for M=3,4,M=3,4, and 55) for M3M\geq 3, and MOEA/D with the smallest μ\mu value (μ=25,28,35,\mu=25,28,35, and 126126 for M=2,3,4,M=2,3,4, and 55) performs worst among all the configurations for all MM.

Next, the results of MOEA/D for the reduced UEA scenario in Figure 2(b) are described below. In contrast to the results for the final population scenario, MOEA/D with the largest μ\mu value always shows the worst APS value. For M{2,3}M\in\{2,3\}, small μ\mu values (μ{50,100}\mu\in\{50,100\} and μ{55,105}\mu\in\{55,105\}, respectively) are suitable for MOEA/D at any time. For M{4,5}M\in\{4,5\}, MOEA/D with a small μ\mu value also shows a good performance within a short period. After several function evaluations, MOEA/D with μ=120\mu=120 and μ{210,330}\mu\in\{210,330\} outperform other configurations on the four- and five-objective MOPs, respectively.

Refer to caption
Figure 3: Performance of MOEA/D with various μ\mu settings on the WFG4 problem with M{2,3,4,5}M\in\{2,3,4,5\}. The horizontal and vertical axes represent the number of function evaluations and the HV values, respectively. The shaded area indicates 25-75 percentiles.

4.1.2 Results on each problem

Figure 3 shows the anytime performance of MOEA/D with various μ\mu settings on the WFG4 problem with M{2,3,4,5}M\in\{2,3,4,5\} under two scenarios. Although we do not show results on all the 13 problems here due to the space constraints, they can be found in Figures S.1 – S.13 in the supplementary file666The supplementary file is also available online (https://sites.google.com/site/moeadanalysis/home/ti-moead-asoc17-supp.pdf) of this paper.

As shown in Figure 3(a), under the final population scenario, while MOEA/D with μ{100,200}\mu\in\{100,200\} show good performance for M=2M=2, MOEA/D with the largest μ\mu value outperforms other configurations after several function evaluations for M3M\geq 3. A larger μ\mu value is beneficial to MOEA/D for the final population scenario. Similar results can be found on other problems shown in Figures S.1(a) – S.13(a). Of course, there are some exceptions. For example, results on the WFG1 problem (Figure S.5) show that MOEA/D with a small μ\mu value exhibits a good performance under the final population scenario.

While good HV values are obtained with a large μ\mu value in most cases for the final population scenario, MOEA/D with a small μ\mu value performs the best under the reduced UEA scenario as seen from Figure 3(b). It is interesting to notice that the performance rank of MOEA/D with the smallest and largest μ\mu values is totally different between the two scenarios on the three- and four-objective WFG4 problems. For example, for M=3M=3, while MOEA/D with μ=406\mu=406 performs significantly better than MOEA/D with μ=28\mu=28 under the final population scenario, their performance rank is inverted even on the same problem instance in the case of the reduced UEA scenario. Similar conclusions can be found on most of other problems shown in Figures S.1(b) – S.13(b), except for the results on the DTLZ4, WFG2, WFG3, and WFG8 problems. A large μ\mu value is suitable for MOEA/D on the DTLZ4, WFG2, WFG3, and WFG8 test problems even when we use the reduced UEA scenario.

According to the percentiles in Figure 3(a) and (b), there is no large variation in the HV values obtained by using all the μ\mu values for M=2M=2. However, the variation of the HV values becomes large with increasing MM. In particular, a larger variation is observed in results of MOEA/D with small μ\mu values for M=5M=5. Thus, it is likely that the performance of MOEA/D with small μ\mu values on MOPs with a large MM is significantly different for each run.

4.1.3 Discussion

We here discuss why the best population size μ\mu is dependent on the choice of an optimization scenario, the number of objectives MM, and the characteristics of a given problem. As described in Subsections 4.1.1 and 4.1.2, while MOEA/D with the largest μ\mu value outperforms other configurations in most cases under the final population scenario, a small μ\mu value is suitable for MOEA/D on some problems for the reduced UEA scenario. In particular, the performance rank of MOEA/D with various μ\mu values on the WFG4 problem with M{3,4}M\in\{3,4\} is totally different depending on the considered optimization scenario.

This seems to be simply because MOEA/D with a large μ\mu value is capable of keeping a large number of nondominated solutions in the population. As discussed in [67], such a large number of nondominated solutions are always beneficial for the HV calculation. For this reason, the results in Subsections 4.1.1 and 4.1.2 show that MOEA/D with a large μ\mu value performs well on most problems. However, nondominated solutions in the population do not directly influence the performance of MOEA/D under the reduced UEA scenario, because solutions selected from the UEA are used for the HV calculation. Also, MOEA/D can store nondominated solutions whose size is over μ\mu in the UEA. Due to this reason, MOEA/D with a small μ\mu value works well under the reduced UEA scenario.

Figure 4 shows the distribution of nondominated solutions in the objective function space for each scenario found by MOEA/D with μ=28\mu=28 and μ=406\mu=406 on the three-objective WFG4 problem. For the final population scenario, while MOEA/D with μ=406\mu=406 achieves a set of diverse nondominated solutions, MOEA/D with μ=28\mu=28 can provide only a small number of nondominated solutions. Unlike the results for the final population scenario, MOEA/D with both μ\mu settings successfully maintain the densely distributed solutions covering the entire PF in the UEA for the reduced UEA scenario. It is likely that MOEA/D with a small μ\mu value cannot keep good nondominated solutions in the population but has an ability to generate well-distributed solutions.

Refer to caption
Figure 4: Distribution of nondominated solutions in the objective function space on the three-objective WFG4 problem for the final and reduced UEA scenarios. Nondominated solutions shown here are found by MOEA/D with μ=28\mu=28 and μ=406\mu=406 at 5×1045\times 10^{4} function evaluations. The number of selected nondominated solutions bb for the reduced UEA scenario was set to 210210 for M=3M=3. Results of a single run with the median HV value are shown.

We do not intend to argue that a small μ\mu value is always beneficial for MOEA/D under the reduced UEA scenario. Our results in Subsection 4.1.2 show that a (relatively) large μ\mu value is necessary for MOEA/D to find good nondominated solutions on some problems, especially MOPs with a large MM or an irregular shape of the PF. As seen from the results on the five-objective WFG4 problem (Figure 3), while MOEA/D with the smallest μ\mu value (μ=126\mu=126) achieves the highest HV value until 14 00014\,000 function evaluations, it clearly performs worst after that. Since the objective function space is exponentially increasing with MM, a large population size is necessary for the search if MM is large.

Results on the DTLZ4, WFG2, WFG3, and WFG8 problems (Figure S.4, S.6, S.7, and S.12, respectively) show that a large μ\mu value is beneficial for MOEA/D for all MM independently of the choice of an optimization scenario. The shape of the PF of the WFG2 and WFG3 problems are discontinuous and partially degenerate [64], respectively. Since the Pareto optimal solutions do not exist in most of the decomposed subproblems of MOPs having discontinuous and degenerate PFs [68], a large μ\mu value, which makes a large number of subproblems, is necessary for MOEA/D to find well-approximated solutions. For this reason, MOEA/D with a small μ\mu value performs poorly on the WFG2 and WFG3 problems. Also, the mapping from the solution space to the objective function space 𝒇:𝕊M\mbox{\boldmath$f$}:\mathbb{S}\rightarrow\mathbb{R}^{M} is biased in the DTLZ4 and WFG8 problems. The existence of the bias makes the problem more difficult, and thus MOEA/D with a small μ\mu value cannot find good solutions on the DTLZ4 and WFG8 problems.

Refer to caption
Figure 5: Overall performance of MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi} with θ=5\theta=5) on the 13 problems (the four DTLZ and nine WFG problems) with M{2,3,4,5}M\in\{2,3,4,5\} (lower is better). The horizontal and vertical axes represent the number of function evaluations and the APS values, respectively. For the APS value [13], see Subsection 3.2.
Refer to caption
Figure 6: Performance of MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi} with θ=5\theta=5) on the WFG4 problem with M{2,3,4,5}M\in\{2,3,4,5\}. The horizontal and vertical axes represent the number of function evaluations and the HV values, respectively. The shaded area indicates 25-75 percentiles.

4.2 Impact of the scalarizing function gg on the performance of MOEA/D under two scenarios

4.2.1 Overall performance

Figure 5 shows the overall performance of MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi} with θ=5\theta=5) over all the 13 test problems. For details of the three functions, see Section 2. The influence of θ\theta on the performance of MOEA/D using gpbig^{\rm pbi} is investigated in Subsection 4.3.

The results on the two- and three-objective 13 problems for the final population scenario show that the performance of MOEA/D with the two Chebyshev functions (gchmg^{\rm chm} and gchdg^{\rm chd}) is better than that with gpbig^{\rm pbi} at anytime (Figure 5(a)). For M=4M=4, MOEA/D with gpbig^{\rm pbi} outperforms the other configurations after 38 00038\,000 function evaluations. For M=5M=5, MOEA/D with gpbig^{\rm pbi} always exhibits the best performance.

The results for the reduced UEA scenario (Figure 5(b)) are significantly different from the results for the final population scenario described above. As seen from Figure 5(b), MOEA/D with the two Chebyshev functions are competitive with each other. The gchmg^{\rm chm} and gchdg^{\rm chd} are the best scalarizing functions for M{2,4,5}M\in\{2,4,5\} and M=3M=3, respectively. Interestingly, while MOEA/D with gpbig^{\rm pbi} exhibits a good performance on MOPs with more than four objectives after several function evaluations under the final population (Figure 5(a)), its performance is worst among the three configurations for all MM under the reduced UEA scenario (Figure 5(b)).

4.2.2 Results on each problem

Figure 6 shows the anytime performance of MOEA/D with the three scalarizing functions on the WFG4 problem with M{2,3,4,5}M\in\{2,3,4,5\}. Results on all the 13 problems can be found in Figures S.14 – S.26 in the supplementary file.

As shown in Figure 6, the results on the WFG4 problem are similar to the aggregated results on all of the 13 problems shown in Figure 5. For both scenarios, MOEA/D with the two Chebyshev functions perform significantly better than that with gpbig^{\rm pbi} on the two- and three-objective WFG4 problems. For the final population scenario, with increasing MM, MOEA/D with gpbig^{\rm pbi} achieves the highest HV values among the three configurations in the later search stage. However, for the reduced UEA scenario, the worst HV values are obtained by using gpbig^{\rm pbi}, and MOEA/D with the two Chebyshev functions show better performance at any time. As seen from the percentiles in Figure 6(a) and (b), the variation of the HV values achieved by using the two Chebyshev functions is large for M=5M=5. In contrast, the performance of MOEA/D with gpbig^{\rm pbi} is not much different for each run. The quality of nondominated solutions found by using gpbig^{\rm pbi} is likely to be stable even on MOPs with a large MM.

Results on the DTLZ2, WFG5, WFG6, WFG7, WFG8, and WFG9 problems are similar to results on the WFG4 problem. On the DTLZ1 problem, MOEA/D with gchdg^{\rm chd} and gpbig^{\rm pbi} show good performance (Figure S.14). On the DTLZ3 problem, gchdg^{\rm chd} is the best scalarizing function for all MM (Figure S.16). On the DTLZ4 problem with M3M\geq 3, MOEA/D with gpbig^{\rm pbi} performs the best (Figure S.17). On the WFG2 and WFG3 problems with all MM, the performance of MOEA/D with the two Chebyshev functions is better than that with gpbig^{\rm pbi} even for the final population scenario (Figure S.19 and S.20).

4.2.3 Discussion

A number of previous work report that MOEA/D with gchmg^{\rm chm} is not capable of obtaining well-distributed nondominated solutions in the objective function space (e.g., [18, 30, 54, 69]). Recent studies also report the promising performance of MOEA/D with gpbig^{\rm pbi} on MOPs with more than four objectives [24, 30]. Our results for the final population described in Subsections 4.2.1 and 4.2.2 are consistent with these previous studies. However, the performance of MOEA/D with the two Chebyshev functions (gchmg^{\rm chm} and gchdg^{\rm chd}) is significantly better than that with gpbig^{\rm pbi} on most problem instances under the reduced UEA scenario. In summary, the best scalarizing function for MOEA/D is significantly dependent on the choice of an optimization scenario. Below, we discuss this result (mainly with respect to the comparison between the PBI function and the two Chebyshev functions).

Refer to caption
Figure 7: Parallel coordinates of the objective function values of nondominated solutions on the three-objective WFG4 problem for the final and reduced UEA scenarios. Nondominated solutions shown here are found by MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi} with θ=5\theta=5) at 5×1045\times 10^{4} function evaluations. The number of selected nondominated solutions bb for the reduced UEA scenario was set to 210210 for M=5M=5. The horizontal and vertical axes represent the objective number and the normalized objective function values, respectively. Results of a single run with the median HV value are shown.
Refer to caption
Figure 8: Distribution of nondominated solutions in the objective function space on the three-objective WFG4 problem for the final and reduced UEA scenarios. Nondominated solutions shown here are found by MOEA/D with gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi} at 5×1045\times 10^{4} function evaluations. The number of selected nondominated solutions bb for the reduced UEA scenario was set to 210210 for M=3M=3. Results of a single run with the median HV value are shown.

Figure 7 shows the parallel coordinates of the objective function values of nondominated solutions found by MOEA/D with the three scalarizing functions on the five-objective WFG4 problem under (a) the final population scenario and (b) the reduced UEA scenario. It should be recalled that gpbig^{\rm pbi} and gchmg^{\rm chm} are the best scalarizing functions on the five-objective WFG4 problem for the final population and reduced UEA scenarios, respectively (see Figure 6).

The number of nondominated solutions in Figure 7(a) is 146146 for gchmg^{\rm chm}, 150150 for gchdg^{\rm chd}, and 210210 for gpbig^{\rm pbi}. That is, MOEA/D with gpbig^{\rm pbi} obtains the largest number of nondominated solutions among the three configurations for the final population scenario. The nondominated solutions found by MOEA/D with gpbig^{\rm pbi} are also uniformly distributed in the objective function space. For these two reasons, it seems that MOEA/D with gpbig^{\rm pbi} achieves the highest HV value at the end of the search. In contrast to the results for the final population scenario, as shown in Figure 7(b), MOEA/D with gchmg^{\rm chm} obtains well-distributed nondominated solutions in the objective function space under the reduced UEA scenario. The uniformity of the distribution of nondominated solutions found by MOEA/D with gchmg^{\rm chm} is slightly better than those obtained by the other methods.

For further discussion, we show the distribution of nondominated solutions in the objective function space for both the final and reduced UEA scenarios on the three-objective WFG4 problem in Figure 8. The distribution on the three-objective WFG4 problem in Figure 8 is similar to the distribution on the five-objective WFG4 problem in Figure 7. In the final population scenario (Figure 8(a)), while the uniformly distributed nondominated solutions are obtained by using gpbig^{\rm pbi} and gchdg^{\rm chd}, the distribution of solutions found by MOEA/D with gchmg^{\rm chm} is biased. However, it seems that MOEA/D with all the three scalarizing functions find evenly distributed nondominated solution under the reduced UEA scenario (Figure 8(b)).

As pointed out in [37, 54], it seems that MOEA/D with gchmg^{\rm chm} is capable of generating well-approximated solutions but cannot maintain them in its population. Such a problem of gchmg^{\rm chm} is addressed by incorporating the UEA, which automatically stores good nondominated solutions independently from the population, into MOEA/D. Due to this reason, MOEA/D with gchmg^{\rm chm} performs the best on the five-objective WFG4 problem under the reduced UEA scenario, regarding the HV metric. This observation can be found in some of the other test problems.

4.3 Effect of the penalty value θ\theta for the PBI function on the performance of MOEA/D

4.3.1 Overall performance

Figure 9 shows the overall performance of MOEA/D using the PBI function gpbig^{\rm pbi} with θ{0.1,0.5,1,2,3,5,8,10}\theta\in\{0.1,0.5,1,2,3,5,8,10\} on the 13 problems with M{2,3,4,5}M\in\{2,3,4,5\} under (a) the final population scenario and (b) the reduced UEA scenario. Unlike the results of μ\mu and gg presented in Subsections 4.1 and 4.2, the performance rank of each configuration is not drastically changed during the search process for both scenarios. That is, a configuration that performs well at the beginning of the search exhibits good performance also at the end of the search.

As shown in Figure 9(a), good APS values are obtained by θ{2,3}\theta\in\{2,3\} for M{2,3}M\in\{2,3\} for the final population scenario. The best penalty value is θ{3,5}\theta\in\{3,5\} and θ{5,8}\theta\in\{5,8\} for M=4M=4 and M=5M=5, respectively. It seems that MOEA/D using gpbig^{\rm pbi} with θ=5\theta=5 works well for all MM. In contrast, θ{0.1,0.5,1}\theta\in\{0.1,0.5,1\} are clearly inappropriate penalty values for all MM.

Figure 9(b) shows results for the reduced UEA scenario. It seems that the performance rank under the reduced UEA scenario is not significantly different from that under the final population scenario. Although the smallest APS value is obtained by θ=0.1\theta=0.1 until 6 0006\,000 function evaluations for M3M\geq 3, MOEA/D using gpbig^{\rm pbi} with θ{3,5}\theta\in\{3,5\} perform well among all the configurations for all MM. While the performance rank of θ=0.1\theta=0.1 is improved M3M\geq 3, MOEA/D using gpbig^{\rm pbi} with θ{0.5,1}\theta\in\{0.5,1\} performs poorly even for the reduced UEA scenario.

Refer to caption
Figure 9: Overall performance of MOEA/D using the PBI function gpbig^{\rm pbi} with various θ\theta values on the 13 problems with M{2,3,4,5}M\in\{2,3,4,5\}. The horizontal and vertical axes represent the number of function evaluations and the APS values, respectively. For the APS value [13], see Subsection 3.2.
Refer to caption
Figure 10: Performance of MOEA/D using the PBI function gpbig^{\rm pbi} with various θ\theta values on the WFG4 problem with M{2,3,4,5}M\in\{2,3,4,5\}. The horizontal and vertical axes represent the number of function evaluations and the HV values, respectively. The shaded area indicates 25-75 percentiles.

4.3.2 Results on each problem

Figure 10 shows the anytime performance of MOEA/D using gpbig^{\rm pbi} with various θ\theta values on the WFG4 problem with M{2,3,4,5}M\in\{2,3,4,5\}. Figures S.27 – S.39 in the supplementary file show results on all the 13 problems.

As seen from Figure 10(a), for the final population scenario, θ=1,2,2\theta=1,2,2, and 33 are suitable values on the WFG4 problem with M=2,3,4,M=2,3,4, and 55, respectively. That is, the best penalty value θ\theta increases with respect to the number objectives MM on the WFG4 problem. Interestingly, as shown in Figure 10(b), in contrast to the results for the final population scenario, MOEA/D using gpbig^{\rm pbi} with θ=0.1\theta=0.1 achieves the good HV value under the reduced UEA scenario for M{2,3}M\in\{2,3\}. According to the percentiles in Figure 10(a) and (b), for M=3M=3, the variation of the HV values obtained by using θ{0.1,0.5}\theta\in\{0.1,0.5\} is larger than that by using other θ\theta values. Interestingly, in Figure 10, the 25th and 75th percentile values are not evenly distributed. For example, on the results for M=3M=3 in Figure 10(a), while the median and the 25th percentile values are almost the same, the difference between the median and 75th percentile values is large. Only for M=5M=5, a large variation is observed in results of MOEA/D with θ=3\theta=3. While MOEA/D with θ=3\theta=3 obtains the best HV value under both scenarios regarding the median HV value, it performs similarly to MOEA/D with θ{0.1,0.5,1,2}\theta\in\{0.1,0.5,1,2\} for a particular run as seen from its 75th percentile values.

Due to space constraints, results on other test problems are not described here. Similar to the results on the WFG4 problem, the best θ\theta value significantly depends on the considered scenario on most test problems.

Refer to caption
Figure 11: Distribution of nondominated solutions in the objective function space on the three-objective WFG4 problem for the final and reduced UEA scenarios. Nondominated solutions shown here are found by MOEA/D using the PBI function gpbig^{\rm pbi} with θ=0.1\theta=0.1 (left) and with θ=2\theta=2 (right) at 5×1045\times 10^{4} function evaluations. Results of a single run with the median HV value are shown.

4.3.3 Discussion

Our results described in Subsections 4.3.1 and 4.3.2 show that the best setting of θ\theta is significantly dependent on the characteristics of a given problem. For example, while MOEA/D using gpbig^{\rm pbi} with θ=2\theta=2 performs well on the WFG4 problem with M=3M=3 (Figure 10(a)), θ=10\theta=10 is the best setting for solving the three-objective DTLZ1 problem (Figure S.27). Such conclusions are consistent with previous studies [33, 35, 36, 70]. For example, experimental results in [33] show that MOEA/D using gpbig^{\rm pbi} with θ=0.1\theta=0.1 performs better than that with other θ\theta values on multi- and many-objective knapsack problems with the convex PFs. However, a small penalty value like θ=0.1\theta=0.1 is not appropriate for MOEA/D to solve MOPs with nonconvex PFs [36].

In addition to the characteristics of a given problem, our results in Subsections 4.3.1 and 4.3.2 newly reveal that a suitable θ\theta value also depends on a target optimization scenario. For example, as shown in Figure 10, the best θ\theta value is totally different on the WFG4 problem (nonconvex) for each scenario. Below, we discuss the reason why the θ=0.1\theta=0.1 is the best penalty value on the three-objective WFG4 problem for the reduced UEA scenario.

Figure 11 shows the distribution of nondominated solutions found by MOEA/D using gpbig^{\rm pbi} with θ=0.1\theta=0.1 and θ=2\theta=2 on the three-objective WFG4 problem for the final and reduced UEA scenarios. It should be noted that θ=2\theta=2 is the best parameter setting on the WFG4 problem with M=3M=3 for the final population scenario (see Figure 10). As seen from Figure 11(a), while MOEA/D with θ=0.1\theta=0.1 can find only the three extreme solutions under the final population scenario, well-distributed nondominated solutions are obtained by θ=2\theta=2. However, Figure 11(b) shows that in addition to the extreme solutions, MOEA/D with θ=0.1\theta=0.1 achieves some nondominated solutions distributed on the rim and inside regions of the PF. Note that the HV value of nondominated solutions obtained by using θ=0.1\theta=0.1 is higher than that by θ=2\theta=2 in Figure 11(b).

It is pointed out that the HV indicator does not always assess the uniformity and diversity of the distribution of nondominated solutions [71]. For further investigation, we used the inverted generational distance (IGD) [65], which evaluates both convergence and diversity performance of MOEAs. The generational distance (GD) and maximum spread (MS) [65] indicator values of nondominated solutions are also reported to discuss convergence and diversity performance of MOEA/D, individually.

Below, let 𝑨A be a set of nondominated solutions selected from the population or the UEA. A set of reference vectors are denoted as 𝑨\mbox{\boldmath$A$}^{*}, where each element of 𝑨\mbox{\boldmath$A$}^{*} is a Pareto-optimal solution. The GD value is the average distance from each solution in 𝑨A to its nearest reference vector in 𝑨\mbox{\boldmath$A$}^{*} in the objective function space:

GD(𝑨)\displaystyle{\rm GD}(\mbox{\boldmath$A$}) =1|𝑨|(𝒙𝑨min𝒛𝑨{ED(𝒇(𝒙),𝒇(𝒛))}),\displaystyle=\frac{1}{|\mbox{\boldmath$A$}|}\left(\sum_{\mbox{\boldmath$x$}\in\mbox{\boldmath$A$}}\min_{\mbox{\boldmath$z$}\in\mbox{\boldmath$A$}^{*}}\Bigl{\{}{\rm ED}\bigl{(}\mbox{\boldmath$f$}(\mbox{\boldmath$x$}),\mbox{\boldmath$f$}(\mbox{\boldmath$z$})\bigr{)}\Bigr{\}}\right), (7)

where ED(𝒙,𝒚){\rm ED}(\mbox{\boldmath$x$},\mbox{\boldmath$y$}) is the Euclidean distance between 𝒙x and 𝒚y. In contrast to the GD metric in equation (7), the IGD value is the average distance from each reference vector in 𝑨\mbox{\boldmath$A$}^{*} to its nearest solution in 𝑨A in the objective function space as follows:

IGD(𝑨)\displaystyle{\rm IGD}(\mbox{\boldmath$A$}) =1|𝑨|(𝒛𝑨min𝒙𝑨{ED(𝒇(𝒙),𝒇(𝒛))}).\displaystyle=\frac{1}{|\mbox{\boldmath$A$}^{*}|}\left(\sum_{\mbox{\boldmath$z$}\in\mbox{\boldmath$A$}^{*}}\min_{\mbox{\boldmath$x$}\in\mbox{\boldmath$A$}}\Bigl{\{}{\rm ED}\bigl{(}\mbox{\boldmath$f$}(\mbox{\boldmath$x$}),\mbox{\boldmath$f$}(\mbox{\boldmath$z$})\bigr{)}\Bigr{\}}\right). (8)

The MS value of 𝑨A is the average of the maximum and minimum objective function values of solutions in 𝑨A for each objective as follows:

MS(𝑨)\displaystyle{\rm MS}(\mbox{\boldmath$A$}) =i=1M(max𝒙𝑨{fi(𝒙)}min𝒙𝑨{fi(𝒙)})2.\displaystyle=\sqrt{\sum^{M}_{i=1}\Bigl{(}\max_{\mbox{\boldmath$x$}\in\mbox{\boldmath$A$}}\{f_{i}(\mbox{\boldmath$x$})\}-\min_{\mbox{\boldmath$x$}\in\mbox{\boldmath$A$}}\{f_{i}(\mbox{\boldmath$x$})\}\Bigr{)}^{2}}. (9)

Figure 12 shows the MS, GD, and IGD indicator values of nondominated solutions found by MOEA/D using gpbig^{\rm pbi} with various θ\theta values on the three-objective WFG4 problem under (a) the final population scenario and (b) the reduced UEA scenario. Before calculating each indicator value, all objective function values were normalized as described in Subsection 3.1. One may wonder that GD values for the final population scenario are significantly better than those for the reduced UEA scenario. This is because the number of nondominated solutions in the population is usually smaller than that in the UEA (e.g., see Figure 11), and a small number of solutions is possibly beneficial for GD as discussed in [67].

Refer to caption
Figure 12: The MS, GD, and IGD indicator values of nondominated solutions found by MOEA/D using gpbig^{\rm pbi} with various θ\theta values on the three-objective WFG4 problem under (a) the final population scenario and (b) the reduced UEA scenario. A low GD value and a high MS value indicate that the corresponding method has good convergence and diversity performance, respectively. A method showing a low IGD value performs well in terms of both convergence and diversity. The shaded area indicates 25-75 percentiles.

As seen from Figure 12, MOEA/D with θ{0.1,2,3,5,8,10}\theta\in\{0.1,2,3,5,8,10\} achieve high MS values for both scenarios. The best GD values are also obtained by using θ=0.1\theta=0.1 for the reduced UEA scenario. Thus, nondominated solutions in the UEA obtained by using θ=0.1\theta=0.1 are close to the PF. This is because the contour lines of gpbig^{\rm pbi} with θ=0.1\theta=0.1 and the weighted sum function are similar [33]. Therefore, MOEA/D using gpbig^{\rm pbi} with θ=0.1\theta=0.1 shows good HV values on the WFG4 problem with M=3M=3.

It is interesting to notice that the performance rank based on the IGD metric is slightly different from that based on the HV indicator. Although the best HV values are obtained by using θ=0.1\theta=0.1 under the reduced UEA scenario (Figure 10), MOEA/D with θ=2\theta=2 achieves the lowest IGD values (Figure 12). Since the IGD metric assesses the uniformity of the distribution, the IGD value of nondominated solutions found by MOEA/D with θ=0.1\theta=0.1, whose distribution is biased to specific regions as shown in Figure 11, is worse than that by MOEA/D with θ=2\theta=2.

5 Further analysis

On the one hand, in Section 4, we examined the influence of each control parameter on MOEA/D by keeping other parameters default (see Table 2). This is because we wanted to examine the effect of changing each parameter in a component-wise manner. If two or more parameters are perturbed simultaneously, which parameter improves or degrades the performance of MOEA/D may be unclear.

On the other hand, analysis of dependencies between multiple control parameters is important and interesting. It is expected that some control parameters (e.g., μ\mu and gg) are correlated with each other. Also, we used the default parameters (see Table 2), which are commonly used in the literature, for our analysis. However, the effect of the three control parameters (μ\mu, gg, and θ\theta) on MOEA/D may be different when well-tuned parameters are used instead of the default parameters. Thus, whether our analysis results in Section 4 are representative or not is not guaranteed.

This section presents further analysis of MOEA/D in order to address the above-mentioned issues. Dependencies between two control parameters are examined in Subsection 5.1. Analysis of each control parameter with the best configuration is presented in Subsection 5.2.

Refer to caption
Refer to caption
Figure 13: Influence of μ\mu on the performance of MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi}) on the WFG4 problem with M{2,3,5}M\in\{2,3,5\}. The median HV value at 50 00050\,000 evaluations among 31 runs is shown.
Refer to caption
Refer to caption
Figure 14: Influence of μ\mu on the performance of MOEA/D using gpbig^{\rm pbi} with various θ\theta values on the WFG4 problem with M{2,3,5}M\in\{2,3,5\}. The median HV value at 50 00050\,000 evaluations among 31 runs is shown.
Refer to caption
Refer to caption
Figure 15: Comparison of the two Chebyshev functions (gchmg^{\rm chm} and gchdg^{\rm chd}) and gpbig^{\rm pbi} with various θ\theta values on the WFG4 problem with M{2,3,5}M\in\{2,3,5\}. The median HV value at 50 00050\,000 evaluations among 31 runs is shown.

5.1 Analysis of dependencies between two control parameters

While we discussed the results based on the anytime performance of MOEA/D in Section 4, we report only the end-of-the-run results in this subsection. Although the end-of-the-run results do not provide sufficient information as described in Section 4, analyzing dependencies between two parameters based on the anytime performance is not a trivial task. Such an analysis is our future research.

5.1.1 Dependencies between μ\mu and gg

Figure 13 shows the influence of μ\mu on the performance of MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi}) on the WFG4 problem with M{2,3,5}M\in\{2,3,5\}. Results on other test problems can be found in Figures S.40 – S.52 in the supplementary file.

As seen from Figure 13, the best μ\mu value is different depending on scalarizing functions. For example, as shown in Figure 13(a), for the final population scenario, MOEA/D with the two Chebyshev functions need a relatively large μ\mu value for all MM. In contrast, small μ\mu values are suitable for gpbig^{\rm pbi}. In addition, as discussed in Subsection 4.1, suitable μ\mu values also depend on the choice of an optimization scenario. Figure 13(b) indicates that small μ\mu values are appropriate for all the three scalarizing functions on the WFG4 problem under the reduced UEA scenario. For M{2,3}M\in\{2,3\}, in most cases, the increase of μ\mu deteriorates the performance of MOEA/D under the reduced UEA scenario. In summary, μ\mu and gg are correlated with each other, and the relation between them is dependent on the choice of a scenario.

5.1.2 Dependencies between μ\mu and θ\theta

Figure 14 shows the impact of μ\mu on the performance of MOEA/D using gpbig^{\rm pbi} with various θ\theta values on the WFG4 problem with M{2,3,5}M\in\{2,3,5\}. Results on other test problems are shown in Figures S.53 – S.65 in the supplementary file. Unlike the analysis results of μ\mu and gg, the effect of μ\mu values on the performance of MOEA/D with various θ\theta values is relatively moderate, except for some results (e.g., results for θ=1\theta=1 on the three-objective WFG4 problem). Thus, the performance rank of MOEA/D with different θ\theta values is not significantly influenced by μ\mu.

5.1.3 Comparison of the two Chebyshev functions and the PBI function with various θ\theta values

Figure 15 provides a comparison of the two Chebyshev functions (gchmg^{\rm chm} and gchdg^{\rm chd}) and gpbig^{\rm pbi} with θ{0.1,,10}\theta\in\{0.1,...,10\} on the WFG4 problem with M{2,3,5}M\in\{2,3,5\}. For gchmg^{\rm chm} and gchdg^{\rm chd}, the same HV values are shown for each θ\theta value in Figure 15. Results on other test problems can be found Figures S.79 – S.91 in the supplementary file.

As seen from Figure 15, the performance of MOEA/D with gpbig^{\rm pbi} significantly depends on the θ\theta value for both optimization scenarios. Although such results under the final population scenario have already been reported in previous work (e.g., [35, 70]), similar results are observed under the reduced UEA scenario. MOEA/D with a particular θ\theta value performs better than that with the two Chebyshev functions. Whereas the poor results are obtained by the gpbig^{\rm pbi} with θ=5\theta=5 under the reduced UEA scenario in Subsection 4.2, it is likely that MOEA/D using gpbig^{\rm pbi} with a suitable θ\theta value performs well. Interestingly, the performance of MOEA/D regarding the HV metric is drastically improved or degraded at around θ{1,2,3}\theta\in\{1,2,3\}. The reason is unclear, and thus its further analysis is our future research topic.

5.2 Analysis using well-tuned parameters

In Section 4, except for a single parameter to be examined, other parameters were set to the default values as shown in Table 2. In contrast, here, we examine the effect of each parameter on MOEA/D by using the best parameters.

We conducted a grid search to find the best configuration for each control parameter. For the three control parameters (μ\mu, gg, and θ\theta), all the values in Table 2 were examined. In addition to the three control parameters (μ\mu, gg, and θ\theta), the performance of MOEA/D with four neighborhood sizes T{10,20,40,80}T\in\{10,20,40,80\} was investigated. We evaluated the performance of MOEA/D with all possible combinations of the four parameters (240240 and 160160 configurations for M{2,3,4}M\in\{2,3,4\} and M=5M=5 respectively) on each problem instance according to the same experimental procedure described in Section 3. The best configuration for each parameter was determined according to the best median HV value at the 50 00050\,000 evaluations on each test problem. Due to space constraints, the best parameters are not shown, but they are different depending on each control parameter and each problem instance.

Figures 16, 17, and 18 show the influence of μ\mu, gg, and θ\theta on the overall performance of MOEA/D with the best configurations on the 13 test problems, respectively. For each problem instance, for each optimization scenario, the best configuration for each control parameter to be analyzed was used. The performance rank of MOEA/D with the best parameters (Figures 16, 17, and 18) is slightly different from that with the default parameters (Figures 2, 5, and 9). For example, unlike the results of MOEA/D with the default parameters (Figure 2), MOEA/D with μ=400\mu=400 performs the best on the two-objective problems under the final population scenario (Figure 16). The interval which MOEA/D with gpbig^{\rm pbi} performs the best for M=5M=5 under the final population scenario becomes shorter (see Figures 5(a) and 17(a)). Although θ=3\theta=3 is the second best θ\theta value for M=3M=3 under the reduced UEA scenario (Figure 9), θ=3\theta=3 is the most suitable for MOEA/D (Figure 18).

However, a qualitative difference between the results of MOEA/D with the default and best parameters is not significant. Thus, the effect of the three control parameters on MOEA/D is almost the same even if the best parameters are used instead of the default parameters. This result guarantees that our analysis results in Section 4 can be generalized to a certain degree.

Refer to caption
Figure 16: Overall performance of MOEA/D with various μ\mu settings on the 13 problems with M{2,3,4,5}M\in\{2,3,4,5\} (lower is better). The horizontal and vertical axes represent the number of function evaluations and the APS values, respectively. The best configurations (gg, θ\theta, and TT) on each problem instance are used for each μ\mu value (i.e., the control parameters used are different for different problems).
Refer to caption
Figure 17: Overall performance of MOEA/D with the three scalarizing functions (gchmg^{\rm chm}, gchdg^{\rm chd}, and gpbig^{\rm pbi}) on the 13 problems with M{2,3,4,5}M\in\{2,3,4,5\} (lower is better). The horizontal and vertical axes represent the number of function evaluations and the APS values, respectively. The best configurations (μ\mu, θ\theta, and TT) on each problem instance are used for each scalarizing function.
Refer to caption
Figure 18: Overall performance of MOEA/D using the PBI function gpbig^{\rm pbi} with various θ\theta values on the 13 problems with M{2,3,4,5}M\in\{2,3,4,5\}. The horizontal and vertical axes represent the number of function evaluations and the APS values, respectively. The best configurations (μ\mu and TT) on each problem instance are used for each θ\theta value.

6 Conclusion

In this paper, we analyzed the influence of the three control parameters (the population size μ\mu, the scalarizing function gg, and the penalty value θ\theta of the PBI function gpbig^{\rm pbi}) on the performance of MOEA/D under the two different optimization scenarios (the final population and reduced UEA scenarios). Our results on the four DTLZ and nine WFG problems up to five objectives show that a suitable setting of the three control parameters (μ\mu, gg, and θ\theta) of MOEA/D is totally different depending on the problem and the optimization scenario. Our observations are summarized as follows:

  • 1.

    While MOEA/D with a small μ\mu value exhibits poor performance measured by the HV indicator on most of the 13 MOPs under the final population scenario, it performs significantly better than MOEA/D with a large μ\mu value under the reduced UEA scenario.

  • 2.

    For the final population scenario, the PBI function gpbig^{\rm pbi} with θ=5\theta=5 is an appropriate scalarizing function for some MOPs, and such a conclusion is consistent with previous studies. However, for the reduced UEA scenario, MOEA/D with the two Chebyshev functions (gchmg^{\rm chm} and gchdg^{\rm chd}) perform significantly better than that with gpbig^{\rm pbi} with θ=5\theta=5.

  • 3.

    While well-distributed nondominated solutions are obtained by only using a large θ\theta value under the final population scenario, MOEA/D with a small θ\theta value (e.g., θ=0.1\theta=0.1) performs well on some MOPs under the reduced UEA scenario.

We also analyzed the reason why an appropriate control parameter setting is different for each scenario. Our analytical results can be briefly summarized as follows:

  • 1.

    MOEA/D with a particular parameter setting (e.g., a small μ\mu value, gchmg^{\rm chm}, and gpbig^{\rm pbi} with a small θ\theta value) is capable of generating good nondominated solutions but cannot keep them in the population.

  • 2.

    Such an issue can be addressed by incorporating the UEA into MOEA/D, which maintains well-distributed nondominated solutions independently from the population.

  • 3.

    Therefore, an MOEA/D configuration that performs poorly for the final population scenario is probable to show a good performance for the reduced UEA scenario.

Although in this paper we presented the analysis of the three control parameters (μ\mu, gg, and θ\theta), latest MOEA/D-type algorithms (e.g., MOEA/D-DE [20]) have other control parameters, such as the neighborhood size TT, the number of replacement individuals nrepn^{\rm rep}, and the probability of selecting types of neighborhood δ\delta. An analysis of remaining control parameters of MOEA/D-type algorithms is an avenue for future work.

Acknowledgement

This work was supported by the Science and Technology Innovation Committee Foundation of Shenzhen (Grant No. ZDSYS201703031748284).

References

References

  • [1] Y. S. Ong, P. B. Nair, A. J. Keane, Evolutionary optimization of computationally expensive problems via surrogate modeling, AIAA journal 41 (4) (2003) 687–696.
  • [2] A. Ponsich, A. L. Jaimes, C. A. C. Coello, A Survey on Multiobjective Evolutionary Algorithms for the Solution of the Portfolio Optimization Problem and Other Finance and Economics Applications, IEEE TEVC 17 (3) (2013) 321–344.
  • [3] H. K. Singh, T. Ray, R. A. Sarker, Optimum Oil Production Planning Using Infeasibility Driven Evolutionary Algorithm, Evol. Comput. 21 (1) (2013) 65–82.
  • [4] A. Trivedi, D. Srinivasan, K. Pal, C. Saha, T. Reindl, Enhanced Multiobjective Evolutionary Algorithm Based on Decomposition for Solving the Unit Commitment Problem, IEEE Trans. Industrial Informatics 11 (6) (2015) 1346–1357.
  • [5] K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, 2001.
  • [6] A. Zhou, B. Qu, H. Li, S. Zhao, P. N. Suganthan, Q. Zhang, Multiobjective evolutionary algorithms: A survey of the state of the art, Swarm and Evol. Comput. 1 (1) (2011) 32–49.
  • [7] B. Li, J. Li, K. Tang, X. Yao, Many-objective evolutionary algorithms: A survey, ACM C. S. 48 (1) (2015) 13:1–13:35.
  • [8] K. Deb, S. Agrawal, A. Pratap, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE TEVC 6 (2) (2002) 182–197.
  • [9] E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the Strength Pareto Evolutionary Algorithm, Tech. Rep. 103, ETHZ (2001).
  • [10] K. Deb, M. Mohan, S. Mishra, Evaluating the epsilon-Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions, Evol. Comput. 13 (4) (2005) 501–525.
  • [11] E. Zitzler, S. Künzli, Indicator-based selection in multiobjective search, in: PPSN, 2004, pp. 832–842.
  • [12] N. Beume, B. Naujoks, M. T. M. Emmerich, SMS-EMOA: multiobjective selection based on dominated hypervolume, EJOR 181 (3) (2007) 1653–1669.
  • [13] J. Bader, E. Zitzler, HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization, Evol. Comput. 19 (1) (2011) 45–76.
  • [14] H. Liu, F. Gu, Q. Zhang, Decomposition of a Multiobjective Optimization Problem Into a Number of Simple Multiobjective Subproblems, IEEE TEVC 18 (3) (2014) 450–455.
  • [15] H. Ishibuchi, T. Murata, A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Trans. SMC, Part C 28 (3) (1998) 392–403.
  • [16] T. Murata, H. Ishibuchi, M. Gen, Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms, in: EMO, 2001, pp. 82–95.
  • [17] E. J. Hughes, Evolutionary many-objective optimisation: many once or one many?, in: IEEE CEC, 2005, pp. 222–227.
  • [18] Q. Zhang, H. Li, MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE TEVC 11 (6) (2007) 712–731.
  • [19] A. Trivedi, D. Srinivasan, K. Sanyal, A. Ghosh, A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition, IEEE TEVC 21 (3) (2017) 440–462.
  • [20] H. Li, Q. Zhang, Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II, IEEE TEVC 13 (2) (2009) 284–302.
  • [21] S. Jiang, S. Yang, An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts, IEEE Trans. Cybernetics 46 (2) (2016) 421–437.
  • [22] S. Yang, S. Jiang, Y. Jiang, Improving the multiobjective evolutionary algorithm based on decomposition with new penalty schemes, Soft Comput. 21 (16) (2017) 4677–4691.
  • [23] H. Liu, L. Chen, Q. Zhang, K. Deb, Adaptively Allocating Search Effort in Challenging Many-Objective Optimization Problems, IEEE TEVC (2017) (in press).
  • [24] K. Li, K. Deb, Q. Zhang, S. Kwong, An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition, IEEE TEVC 19 (5) (2015) 694–716.
  • [25] Y. Yuan, H. Xu, B. Wang, B. Zhang, X. Yao, Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers, IEEE TEVC 20 (2) (2016) 180–198.
  • [26] A. E. Eiben, R. Hinterding, Z. Michalewicz, Parameter control in evolutionary algorithms, IEEE TEVC 3 (2) (1999) 124–141.
  • [27] F. G. Lobo, C. F. Lima, Z. Michalewicz (Eds.), Parameter setting in evolutionary algorithms, Studies in Computational Intelligence, Springer, 2007.
  • [28] H. Ishibuchi, Y. Sakane, N. Tsukamoto, Y. Nojima, Evolutionary Many-Objective Optimization by NSGA-II and MOEA/D with Large Populations, in: IEEE SMC, 2009, pp. 1758–1763.
  • [29] H. Ishibuchi, Y. Setoguchi, H. Masuda, Y. Nojima, How to compare many-objective algorithms under different settings of population and archive sizes, in: IEEE CEC, 2016, pp. 1149–1156.
  • [30] K. Deb, H. Jain, An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints, IEEE TEVC 18 (4) (2014) 577–601.
  • [31] Y. Yuan, H. Xu, B. Wang, X. Yao, A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization, IEEE TEVC 20 (1) (2016) 16–37.
  • [32] H. Ishibuchi, Y. Sakane, N. Tsukamoto, Y. Nojima, Simultaneous use of different scalarizing functions in MOEA/D, in: GECCO, 2010, pp. 519–526.
  • [33] H. Ishibuchi, N. Akedo, Y. Nojima, Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems, IEEE TEVC 19 (2) (2015) 264–283.
  • [34] R. H. Gómez, C. A. C. Coello, A hyper-heuristic of scalarizing functions, in: GECCO, 2017, pp. 577–584.
  • [35] A. Mohammadi, M. N. Omidvar, X. Li, K. Deb, Sensitivity analysis of Penalty-based Boundary Intersection on aggregation-based EMO algorithms, in: IEEE CEC, 2015, pp. 2891–2898.
  • [36] H. Ishibuchi, K. Doi, Y. Nojima, Characteristics of many-objective test problems and penalty parameter specification in MOEA/D, in: IEEE CEC, 2016, pp. 1115–1122.
  • [37] R. Tanabe, H. Ishibuchi, A. Oyama, Benchmarking Multi- and Many-objective Evolutionary Algorithms under Two Optimization Scenarios, IEEE Access 5 (2017) 19597–19619.
  • [38] K. Bringmann, T. Friedrich, P. Klitzke, Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator, in: PPSN, 2014, pp. 518–527.
  • [39] T. Hanne, On the convergence of multiobjective evolutionary algorithms, EJOR 117 (3) (1999) 553–564.
  • [40] J. E. Fieldsend, R. M. Everson, S. Singh, Using unconstrained elite archives for multiobjective optimization, IEEE TEVC 7 (3) (2003) 305–323.
  • [41] R. Wang, Z. Zhou, H. Ishibuchi, T. Liao, T. Zhang, Localized Weighted Sum Method for Many-Objective Optimization, IEEE TEVC 22 (1) (2018) 3–18.
  • [42] M. López-Ibáñez, J. D. Knowles, M. Laumanns, On Sequential Online Archiving of Objective Vectors, in: EMO, 2011, pp. 46–60.
  • [43] A. Radulescu, M. López-Ibáñez, T. Stützle, Automatically Improving the Anytime Behaviour of Multiobjective Evolutionary Algorithms, in: EMO, 2013, pp. 825–840.
  • [44] D. Brockhoff, T. Tran, N. Hansen, Benchmarking Numerical Multiobjective Optimizers Revisited, in: GECCO, 2015, pp. 639–646.
  • [45] T. Tusar, D. Brockhoff, N. Hansen, A. Auger, COCO: The Bi-objective Black Box Optimization Benchmarking (bbob-biobj) Test Suite, CoRR abs/1604.00359.
  • [46] H. Ishibuchi, Y. Sakane, N. Tsukamoto, Y. Nojima, Selecting a small number of representative non-dominated solutions by a hypervolume-based solution selection approach, in: FUZZ-IEEE, 2009, pp. 1609–1614.
  • [47] M. Basseur, B. Derbel, A. Goëffon, A. Liefooghe, Experiments on Greedy and Local Search Heuristics for ddimensional Hypervolume Subset Selection, in: GECCO, 2016, pp. 541–548.
  • [48] A. P. Guerreiro, C. M. Fonseca, L. Paquete, Greedy Hypervolume Subset Selection in Low Dimensions, Evol. Comput. 24 (3) (2016) 521–544.
  • [49] Q. Zhang, W. Liu, H. Li, The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances, in: IEEE CEC, 2009, pp. 203–208.
  • [50] R. Wang, J. Xiong, H. Ishibuchi, G. Wu, T. Zhang, On the effect of reference point in MOEA/D for multi-objective optimization, Appl. Soft Comput. 58 (2017) 25–34.
  • [51] A. J. Nebro, J. J. Durillo, C. A. C. Coello, F. Luna, E. Alba, A Study of Convergence Speed in Multi-objective Metaheuristics, in: PPSN, 2008, pp. 763–772.
  • [52] Y. Jin, Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm and Evol. Comput. 1 (2) (2011) 61–70.
  • [53] H. Li, M. Ding, J. Deng, Q. Zhang, On the use of random weights in MOEA/D, in: IEEE CEC, 2015, pp. 978–985.
  • [54] M. Li, S. Yang, X. Liu, Pareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization, IEEE TEVC 20 (5) (2016) 645–665.
  • [55] S. Wessing, N. Beume, G. Rudolph, B. Naujoks, Parameter Tuning Boosts Performance of Variation Operators in Multiobjective Optimization, in: PPSN, 2010, pp. 728–737.
  • [56] L. C. T. Bezerra, M. López-Ibáñez, T. Stützle, A Large-Scale Experimental Evaluation of High-Performing Multi-and Many-Objective Evolutionary Algorithms, Tech. Rep. 2017-005, IRIDIA (2017).
  • [57] M. Andersson, S. Bandaru, A. H. C. Ng, A. Syberfeldt, Parameter Tuning of MOEAs Using a Bilevel Optimization Approach, in: EMO, 2015, pp. 233–247.
  • [58] K. Deb, L. Thiele, M. Laumanns, E. Zitzler, Scalable Test Problems for Evolutionary Multi-Objective Optimization, in: Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, Springer, 2005, pp. 105–145.
  • [59] S. Huband, P. Hingston, L. Barone, R. L. While, A review of multiobjective test problems and a scalable test problem toolkit, IEEE TEVC 10 (5) (2006) 477–506.
  • [60] I. Das, J. E. Dennis, Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems, SIAM J. Optimiz. 8 (3) (1998) 631–657.
  • [61] M. Pescador-Rojas, R. H. Gómez, E. Montero, N. Rojas-Morales, M. C. Riff, C. A. C. Coello, An Overview of Weighted and Unconstrained Scalarizing Functions, in: EMO, 2017, pp. 499–513.
  • [62] K. Li, Q. Zhang, S. Kwong, M. Li, R. Wang, Stable Matching-Based Selection in Evolutionary Multiobjective Optimization, IEEE TEVC 18 (6) (2014) 909–923.
  • [63] Y. Qi, X. Ma, F. Liu, L. Jiao, J. Sun, J. Wu, MOEA/D with Adaptive Weight Adjustment, Evol. Comput. 22 (2) (2014) 231–264.
  • [64] H. Ishibuchi, H. Masuda, Y. Nojima, Pareto Fronts of Many-Objective Degenerate Test Problems, IEEE TEVC 20 (5) (2016) 807–813.
  • [65] E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, V. G. da Fonseca, Performance assessment of multiobjective optimizers: an analysis and review, IEEE TEVC 7 (2) (2003) 117–132.
  • [66] H. Ishibuchi, Y. Setoguchi, H. Masuda, Y. Nojima, Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes, IEEE TEVC 21 (2) (2017) 169–190.
  • [67] H. Ishibuchi, H. Masuda, Y. Nojima, Comparing solution sets of different size in evolutionary many-objective optimization, in: IEEE CEC, 2015, pp. 2859–2866.
  • [68] M. Asafuddoula, H. K. Singh, T. Ray, An Enhanced Decomposition-Based Evolutionary Algorithm With Adaptive Reference Vectors, IEEE Trans. Cybernetics (2017) (in press).
  • [69] R. H. Gómez, C. A. C. Coello, Improved Metaheuristic Based on the R2 Indicator for Many-Objective Optimization, in: GECCO, 2015, pp. 679–686.
  • [70] H. Sato, Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs, J. Heuristics 21 (6) (2015) 819–849.
  • [71] H. Ishibuchi, R. Imada, Y. Setoguchi, Y. Nojima, Reference point specification in hypervolume calculation for fair comparison and efficient search, in: GECCO, 2017, pp. 585–592.