Research Article  Open Access
Wu Lin, Qiuzhen Lin, Zexuan Zhu, Jianqiang Li, Jianyong Chen, Zhong Ming, "Evolutionary Search with Multiple Utopian Reference Points in DecompositionBased Multiobjective Optimization", Complexity, vol. 2019, Article ID 7436712, 22 pages, 2019. https://doi.org/10.1155/2019/7436712
Evolutionary Search with Multiple Utopian Reference Points in DecompositionBased Multiobjective Optimization
Abstract
Decompositionbased multiobjective evolutionary algorithms (MOEA/Ds) have become increasingly popular in recent years. In these MOEA/Ds, evolutionary search is guided by the used weight vectors in decomposition function to approximate the Pareto front (PF). Generally, the decomposition function will be constructed by the weight vectors and the reference point, which play an important role to balance convergence and diversity during the evolutionary search. However, in most existing MOEA/Ds, only one ideal point is used as the reference point for all the evolutionary search, which is harmful to search the entire PF when tackling the problems with difficulttoapproximate PF boundaries. To address the above problem, this paper proposes an evolutionary search method with multiple utopian reference points in MOEA/Ds. Similar to the existing MOEA/Ds, each solution is associated with one weight vector, which provides an evolutionary search direction, while the novelty of our approach is to use multiple utopian reference points, which can provide evolutionary search directions for different weight vectors. Corner solutions are used to approximate the nadir point and then multiple utopian reference points for evolutionary search can be constructed based on the ideal point and the nadir point, which are uniformly distributed on the coordinate axis or planes. The use of these utopian points can prevent solutions to gather in the same region of PF and helps to strike a good balance of exploration and exploitation in the search space. The performance of our proposed algorithm is validated on tackling 16 recently proposed test problems with difficulttoapproximate PF boundaries and empirically compared to eight stateoftheart multiobjective evolutionary algorithms. The experimental results demonstrate the superiority of the proposed algorithm on solving most of the test problems adopted.
1. Introduction
In some realworld applications [1–3], there are many problems involving the optimization of multiple (often conflicting) objectives, which are termed multiobjective optimization problems (MOPs). In general, a MOP can be defined mathematically as follows:where is the ndimensional decision (variable) space (n is the number of decision variables), is a decision vector in , and the objective vector F(x) consists of m objective functions . Usually, the output of MOPs will be a set of tradeoff solutions for all the objectives, called Paretooptimal solutions (PS). The mapping of PS on the objective space is called Paretooptimal front (PF). Traditional mathematical methods are difficult to obtain a subset of PS in a single run, while multiobjective evolutionary algorithms (MOEAs) can use a population composed of many individuals to approximate the PF, which are popular for tackling MOPs [4–6]. Compared with traditional mathematical methods, MOEAs can well solve various kinds of MOPs without their differentiable and derivable characteristics. Due to these advantages, MOEAs have been very popular in recent years [7–10].
Most of MOEAs can be classified to three categories based on the selection mechanisms: Paretobased MOEAs [11–14]; indicatorbased MOEAs [15, 16]; and decompositionbased MOEAs [17, 18]. In fact, there are only two main tasks in the optimization process of MOEAs. The first one is to ensure convergence, i.e., MOEAs should have the convergence power to push its population towards the PF, while the second one is to maintain diversity, i.e., MOEAs should search a set of solutions uniformly distributed along the PF. Despite the equal importance of both tasks, most stateoftheart MOEAs follow the principle of convergence first and diversity second, such as NSGAII [11], SPEA2 [12], MDMOEA [13], and CAMOEA [14]. Specifically, in MDMOEA [13], a new dominance relation, i.e., Ldominance, is proposed to better balance convergence and diversity when solving manyobjective optimization problems. For MOPs with irregular PFs, CAMOEA [14] uses the clustering method to detect the distribution of individuals in the objective space and then selects individuals according to cluster centers in the last nondominated front. In these MOEAs [11–14], nondominated solutions are selected in priority into the next generation for ensuring convergence, which will induce the diversity loss in sense.
One popular decompositionbased framework for MOEA (MOEA/D) proposed by Zhang et al. [17] has been widely studied in recent years. Moreover, some improved MOEA/D variants [19–22] are designed to better balance convergence and diversity. In MOEA/DDE [19], the offspring can replace at most n_{r} individuals in its neighborhood to prevent diversity loss, where n_{r} is preset as a small positive integer. For example, in MOEA/DSTM [20] with a stable matching (STM) model, each individual is assigned to one subproblem based on their mutual preference information, trying to balance convergence and diversity during the evolutionary search. Moreover, MOEA/DATO [21] adaptively assigns the suitable combination of mating neighborhood size and reproduction operator to each subproblem at different searching stage. In IMOEA/DU [22], a crossover operator based on uniform design and selection strategy based on decomposition are used to help MOEAs to improve the search efficiency. Recently, in MOEA/HD [23], subproblems are layered into different hierarchies, aiming to better balance convergence and diversity during evolution. In MOEA/DCPDE [24], the best individual in each generation will be regarded as a seed, which will evolve two individuals by cloud generator. In DAA [25], an efficient decompositionbased archiving approach is proposed to dealing with multiobjective optimization problems. On the other hand, recent research studies have indicated that the coevolution mechanism can significantly improve the performance of MOEAs [26, 27]. The basic idea in these MOEAs is to divide a complex system into several modules, which are then evolved separately [26, 28]. For example, MOEA/DM2M [29] decomposes a MOP into a set of simple MOPs and then solves these simple MOPs in a collaborative manner. Similarly, ECODBA [30] exploits coevolution, decomposition, and energy laws to come up with good solutions within an acceptable execution time, aiming to solve some realworld applications, i.e., combinatorial bilevel problems. Furthermore, some other heuristic searching algorithms, i.e., particle swarm optimization [31] and immune algorithm [32] are also developed to solving optimization problems.
However, it is found in [33–45] that most of MOEA/Ds adopt one single reference point for all the evolutionary search directions, which is harmful for searching the entire PF when tackling MOPs that are characterized with difficulttoapproximate PF boundaries [46]. To solve this kind of MOPs, in this paper, an evolutionary search method with multiple utopian reference points is proposed for MOEA/Ds. Each solution will be associated with one weight vector, which provides an evolutionary search direction. However, in our approach, multiple utopian reference points are used to provide evolutionary search directions for different weight vectors. To summarize, our approach consists of the following features.
Different from the existing decomposition approaches, multiple utopian reference points are used to replace the ideal reference point in our proposed decomposition function. The use of these utopian reference points can provide multiple search directions, which will guide the solutions towards their respective utopian reference points. Therefore, our proposed approach can prevent the solutions to gather in the same region of PF and help to strike a good balance of exploration and exploitation in the search space.
These utopian reference points are uniformly distributed on the coordinate axis or planes, which are used to provide different evolutionary search directions for different weight vectors. Moreover, they are adaptively adjusted according to the evaluation of the ideal point and the nadir point in each generation. By this way, the evolutionary search directions are adaptively adjusted, which guide solutions to approximate the entire PF during the evolutionary process.
The rest of this paper is organized as follows. Section 2 provides some useful preliminaries of this paper. Section 3 describes the technical details of the proposed evolutionary search method with multiple utopian reference points and the entire algorithm. The experimental results and related discussions are presented in Sections 4 and 5, respectively. Finally, Section 6 concludes this paper and provides some future directions.
2. Preliminaries
2.1. Tchebycheff Decomposition
In decomposition approaches, the scalar subproblem is formulated as a weighted aggregation of all the objectives by decomposition function. The TCH decomposition [17] is a commonly used decomposition function in MOEA/Ds, which can be constructed by a weight vector and a reference point. It can be mathematically defined by the following formulation:where is used as the reference point for the weight vector , for all and . Note that is set to be a very small number, say 10^{−6}, in case . Actually, in most existing MOEA/Ds [19–25], the ideal reference point is usually used as the initial point of all weight vectors, which is estimated by using the best value of each objective found so far during evolution. Note that all the solutions should be dominated by the ideal reference point in the objective space. Thus, it is obvious that is larger than for all in the objective space. In the recent study [47], the geometric property of the subproblem’s objective function in the TCH decomposition has been studied in detail. It can be summarized as follows.
Proposition 1. Let be an ideal reference point of (1) and be a positive weight vector. If a given objective vector is in the lineas shown in Figure 1(a). Thenwhere denotes the l_{1}norm.
(a)
(b)
In the case that F(x) is not located in L_{1}, the following proposition depicts the geometric property of .
Proposition 2. Let be an ideal reference point of (1) and be a positive weight vector. Given an objective vector , if is generated to satisfy two constraints: (1) and are located in the same contour line, i.e., ; (2) lies in the line L_{1} as shown in Figure 1(b); we have
The above two propositions demonstrate the geometric property of TCH decomposition in a serious mathematical proof. More details of proofs have been systematically discussed and analyzed in [47].
2.2. Different Types of Reference Points
There have been numerous studies of decomposition approaches [35–45] to use different types of reference points for providing evolutionary search directions. According to the position of reference point relative to the true PF in the objective space, there have three main kinds of reference points in existing MOEA/Ds. For clarity, we give the mathematical definitions of three kinds of reference points as follows.
Definition 3 (the ideal point). The ideal point is assigned by the best value of each objective in the true PF, as defined by
Definition 4 (the nadir point). The nadir point is assigned by the worst value of each objective in the true PF, as defined by
Definition 5 (the utopian point). The utopian point is assigned by an infeasible objective vector that dominates the ideal point, as defined bywhere for all .
As shown in Figure 2(a), the ideal point is the most commonly used reference point for search directions (as indicated by the weight vectors), which is estimated by using the best value of each objective found so far during evolution. The use of the ideal reference point can speed up convergence, but it will also cause the loss of diversity. The representative MOEA/Ds, such as MOEA/D [17] and its variants MOEA/DDE [19], MOEA/DSTM [20], MOEA/DATO [21], IMOEA/DU [22], MOEA/HD [23], MOEA/DCPDE [24], and DAA [25], all adopt the ideal point as the reference point for all the search directions. However, it can be observed from Figure 2(b) that the current population is pushed away from the nadir reference point as far as possible. Therefore, the solutions in the boundary parts of the PF can be easier to be exploited if the nadir point rather than the ideal point is used as the reference point. The existing MOEA/Ds [36–39], i.e., MOEA/DTPN [37], MOEA/DMR [38], and PAEA [39], adopt the nadir reference point, which show a better performance to maintain diversity. Moreover, in Figure 2(c), the utopian reference point can be used to explore the new areas in the boundary parts of the PF when tackling the MOPs with difficulttoapproximate PF boundaries, which has been validated in some studies [40–43], like MOEA/DUP [42] and Global WASFGA [43]. Furthermore, there are some attempts [44, 45] to use multiple reference points, which are used to ensure good diversity by guiding different solutions to approximate the true PF. As shown in Figure 2(d), multiple reference points rather than the ideal reference point are used to provide search directions for different solutions, which are uniformly distributed along the approximated PF.
(a)
(b)
(c)
(d)
2.3. The Motivations of Our Method1
In decomposition approaches, each subproblem is built by using a weight vector and a reference point, which provides an evolutionary search direction for its associated solution. As it is impossible to know the exact ideal point beforehand, an approximate ideal point is often used as the reference point for all the search directions in MOEA/Ds [17, 19–25], which is obtained by using the best value of each objective found so far during evolution. For example, in MOEA/D [17], a set of uniform weight vectors decomposes a MOP into a number of subproblems, which are assigned with the same computational resource in evolutionary search. However, as pointed out in MOEA/DDRA [48] and MOEA/DIRA [49], these subproblems are not equally important and the computational resources should be allocated according to the difficulties of subproblems. Especially, when tackling the problems with difficulttoapproximate PF boundaries, solutions in the middle part of the PF are easier to be found, while that in the PF boundaries are difficult to be searched. Thus, the solutions with good convergence in the middle part of the PF will replace the ones close to the PF boundaries with a high probability, which will cause overcrowdedness at the middle part of the PF. As observed in Figure 3(a), the newly generated offspring close to the ideal reference point have a better aggregated function value for their corresponding subproblems, which will replace these parent solutions with poor convergence into the next generation. Once solutions are all trapped into the middle part of the PF, the boundary solutions will be almost impossible to be found due to the restriction of search directions in decomposition approaches. Similarly, as shown in Figure 3(b), although the nadir point is used as the reference point for search directions, the loss of diversity in the PF boundaries still exists when tackling the MOPs with difficulttoapproximate PF boundaries, while its middle part of the PF can be easily found.
(a)
(b)
Therefore, for the problems with difficulttoapproximate PF boundaries, this paper proposes an evolutionary search method with multiple utopian reference points (MUP) in MOEA/Ds, which can avoid overcrowdedness at the middle part of the PF and search the entire PF. Similar to the existing MOEA/Ds, each solution is associated with one weight vector, which can provide an evolutionary search direction. However, the main difference of our approach with the existing MOEA/Ds is that multiple utopian reference points are used to provide evolutionary search directions for different weight vectors. As these utopian reference points are uniformly distributed along all the coordinate axis or planes that are constructed by the ideal reference point and the nadir reference point, a much wider breadthdiversity [46], which indicates how widely the solutions are distributed over the PF, can be obtained in the evolutionary process. Our approach can help to explore the boundary areas on the PF due to the use of multiple utopian reference points. At the same time, all the solutions are guided by their respective utopian reference points to approximate the true PF, which prevents them to gather at the same region of the PF and helps to strike a good balance of exploration and exploitation in the search space.
2.4. Related Work of MOEA/Ds
As recently revealed in [35], the reference point providing evolutionary search directions plays a crucial role in balancing convergence and diversity of MOEA/D. Actually, different types of reference points, such as the ideal point, the nadir point, and the utopian point, could have different impacts on the search behaviors of MOEA/Ds. Recently, the nadir point is used in [36–39] as the reference point for strengthening diversity, while the utopian point is adopted in [40–42] as the reference point for all the evolutionary search directions in MOEA/Ds. Both of a utopian point and a generalized nadir point are used simultaneously as the reference points in [43], which indicates that MOEA/Ds can achieve a much wider distribution to approximate the PF if the utopian point rather than the ideal point is treated as the reference point. In the abovementioned MOEA/Ds, there are at most two reference points adopted to provide search directions. However, in RMOEA/D [44], a new scalarizing function using a series of new reference points derived from a given reference point in the preference model is proposed, which ensures a much wider spread of approximate solutions. However, this approach only works well on MOPs with two objectives, which cannot be extended for MOPs with more objectives. Similarly, a new scalarization method is proposed in [45] to get a more uniform distribution on the PF. To summarize, the appropriate selection of reference points for evolutionary search directions can improve the performance of MOEA/Ds, which will better balance exploration and exploitation during the evolutionary process.
3. The Proposed Method
In this section, the generation of multiple utopian points (MUP) is first introduced in Section 3.1. Then, the decomposition approach of using MUP is described in Section 3.2, while the incorporation of MUP method into MOEA/D is clarified in Section 3.3.
3.1. Generation of Multiple Utopian Points
In existing MOEA/Ds [40–43], a utopian point is usually set as Definition 5. It is clear that the utopian point dominates the ideal point according to this definition. As illustrated in Figure 4, a utopian point is only located in the narrow dominated areas between the ideal point and the origin point, as named by the narrow utopian area in Figure 4.
In this paper, one more generalized formula of the utopian point is given, as mathematically defined byIt can be observed from (9) that the utopian area can be extended to a much wider objective space using this general definition. Thus, in other words, the area except for the dominated area of PS can be served as the utopian area.
In our proposed decomposition method with MUP, the weight vectors and the reference points are still the critical components. Given a set of uniformly distributed weight vectors that is generated by using Das and Dennis’s [50] systematic approach and an ideal reference point that is estimated by using the best value of each objective found so far during evolution, a MOP is decomposed into a set of scalar optimization subproblems by using a decomposition function. Unlike the existing MOEA/Ds [19–25] with only an ideal point, a set of utopian reference points is derived from the ideal point in this paper. Each of these utopian reference points (where and ) can be generated by shifting the ideal reference point along the coordinate axis, as described in (10)
The ideal point and the nadir point decide the range of these newly generated utopian points as illustrated in (11). In this paper, we use the corner solutions [50] to compute the nadir point. In fact, these M corner solutions lying on the objective axes have a good ability in representing the boundary of each objective on the PF, which can be obtained by simultaneously minimizing objectives. As suggested in [51], the Euclidean distance to the ideal point is considered in the paper, as follows:Then, the corner solution can be obtained as follows:Thus, the nadir point can be computed by
In our proposed method, each utopian point is associated with a weight vector as illustrated in (10). Although the ideal reference point is inaccurate, the case that solutions are overcrowded around the ideal reference point will not occur as multiple utopian reference points are used to provide evolutionary search directions for different weight vectors. As shown in Figure 5, for MOPs with two objectives, these newly generated utopian reference points are uniformly distributed in the coordinate axis, which are bounded between the ideal point and the nadir point. However, for MOPs with more than two objectives, these utopian reference points will be distributed in the coordinate planes. According to (11), these utopian reference points are adaptively adjusted according to the change of the ideal point and the nadir point during the evolutionary process.
3.2. Decomposition with MUP
In our proposed decomposition approach, a set of uniformly distributed utopian reference points replaces the ideal reference point to guide the search behaviors of individuals. Due to the replacement of reference point, the classical TCH decomposition function in (2) is not suitable for balancing convergence and diversity in our approach. Therefore, to strike a good balance of exploration and exploitation in the search space, a novel decomposition function is proposed by applying some mild modifications on the classical TCH decomposition function, as mathematically defined bywhere the utopian point is used as the starting point for each search direction generated by (10). Unlike the classical TCH decomposition function in (2), the utopian point rather than the ideal point is used to provide evolutionary search direction for each associated individual, and the absolute operator is removed to allow the objective value of the solution to be smaller than the utopian reference point in some dimensions, i.e., , where .
Without using the absolute operator in (15), it is obvious that there are two situations in our proposed decomposition function. Actually, there is no difference with the classical TCH decomposition function when the solution is dominated by the utopian reference point. However, if the solution is not dominated by the utopian reference point (i.e., their relationship is nondominated), the objective value of the solution that is smaller than the utopian reference point in one dimension will not play any effect on the aggregated function value of (15), whereas the objective values larger than the utopian reference point in other dimensions will decide the aggregated function value. Of course, according to the definition of utopian point, solutions are impossible to dominate the utopian reference point. Similar to the study in [47], the geometric property of the subproblems’ objective functions is investigated when using (15) for decomposition.
Proposition 6. Let be a utopian reference point of (1) and be a positive weight vector. If a given objective vector is in the line:which is shown in Figure 6(a). Then,
(a)
(b)
In the above equation, since for all , the geometric property of the subproblems’ objective functions is the same with that of the classical TCH decomposition function. According to Proposition 1 introduced in Section 2, Proposition 6 can be tenable by replacing the ideal reference point with the utopian reference point.
Proposition 7. Let be a utopian reference point of (1) and be a positive weight vector. Given an objective vector , if is generated to satisfy two constraints: (1) and are located in the same contour line, i.e., ; (2) lies in the line as shown in Figure 6(b); we have
In this proposition, there are two different cases according to the dominance relation between the solution and the utopian reference point in the objective space. As shown in Figure 6(b), for all . In this case, there is no difference between our method and the classical TCH approach on the geometric property. Thus, Proposition 7 can be tenable according to Proposition 2. However, there is another case that the solution is nondominated by the utopian reference point. As shown in Figure 6(b), for at least one dimension . The proof is given as follows.
Proof. According to the conditions of , we get
Remark 8. In geometry, is equal to the l_{1}norm of as shown in Figure 6(b). is the intersection point between the line L_{2} and the contour line of in the objective space, as follows:sinceFor example, given , , and , we can calculate
3.3. Incorporation of MUP Method into MOEA/D
In this section, we introduce the framework of our evolutionary search method with MUP in MOEA/Ds, i.e., MOEA/DMUP, whose pseudocode is given in Algorithm 1. At the beginning, a population with N solutions is initialized in line , and a set of uniformly distributed weight vectors is generated by using the Das and Dennis [50] systematic approach in line . Then, these N solutions are randomly allocated to associate each of N subproblems. Moreover, for each weight vector (), its T closest weight vectors are assigned as its neighbors in lines , where . Then, the ideal point will be initialized by finding the best value of each objective and the nadir point will be initialized using the corner solutions in lines , which have been introduced in Section 3.1. Afterward, like other MOEA/Ds [19–25], parent solutions are randomly selected from the neighborhood with a high probability in line . In this case, the more similar child solutions will be produced to have a good exploitation on the local region. Otherwise, parent solutions are randomly selected from the whole population with a low probability in line . In this case, a very wide range of child solutions could be generated by evolutionary operators due to the dissimilarity among these parent solutions. After that, two parent solutions are randomly selected in line , which are used to generate a new offspring by evolutionary operators in lines , i.e., differential evolution (DE) and polynomialbased mutation [19]. Next, the newly generated offspring will be used to update the ideal point in line , and then the neighborhood of ith subproblem is also updated by the offspring in line . As shown in Algorithm 2, each subproblem is associated with a unique utopian reference point in line , which will be used to compute the aggregated function values of solutions. Then, as shown in lines  of Algorithm 2, the compared parent solution will be replaced by the newly generated offspring if the offspring has the smaller aggregated function value. After updating all the neighborhoods of subproblems, the nadir point will be reevaluated by recalculating the corner solutions of the updated population in line . If the stopping criterion is not satisfied in line , the above evolutionary process will be repeated in lines ; otherwise, the final population will be outputted in line .


4. Experimental Settings
4.1. Test Instance
Sixteen test problems [46] (i.e., F1F16) featured by difficulttoapproximate PF boundaries are considered as the benchmark problems in our experimental studies. F1F8 are twoobjective optimization problems, while F9F16 are threeobjective optimization problems. As suggested in [46], the number of decision variables is set as 31 in twoobjective optimization problems (F1F8). However, in threeobjective optimization problems (F9F16), the number of decision variables is set as 32. The true PFs of F1F7 are the same, which can be represented by a straight line in the objective space. The true PF of F8 is convex. Similar to F1F8, the geometry of the true PFs of F9F15 is a hyperplane except that the PF of F16 is convex. The design details and control parameters for F1F16 are introduced in [46].
4.2. The Compared Algorithms
Three classical MOEAs (NSGAII [11], SMSEMOA [15], and MOEAD/DDRA [48]) and a modified variant of MOEA/DDRA (MOEA/DDRAUT [46]) are chosen for comparison to assess the performance of the proposed algorithm on F1F16. NSGAII is a famous dominancebased MOEA, while SMSEMOA is a wellknown indicatorbased MOEA using the hypervolume metric for population diversity maintenance. Moreover, MOEA/DDRA is a typical decompositionbased MOEA, in which all subproblems are dynamically allocated with different computational resources according to their different computational difficulties in evolution. MOEA/DDRAUT is first suggested in [46] and the authors modify MOEA/DDRA to MOEA/DDRAUT by changing the reference point from the ideal point (denoted as ) to the utopian point (denoted as ), where is under the objective space. As reported in [40–43], using the utopian point as the reference point for all search directions, a much wider spread of approximate solutions can be achieved in MOEA/Ds. Furthermore, for better demonstrating the superiority of our proposed algorithm on F1F16, four representative MOEA/Ds are also used for comparison, i.e., MOEA/DSTM [20], MOEA/DM2M [29], MOEA/DAWA [34], and MOEA/DPaS [33]. These codes of the compared algorithms are implemented in PlatEMO [52], while the code of MOEA/DMUP is available at https://github.com/wulinszu/MOEADMUP.git.
4.3. Parameter Settings
As shown in Table 1, the parameters of the compared algorithms, i.e., NSGAII [11], SMSEMOA [15], MOEA/DDRA [48], and other MOEA/D variants (MOEA/DSTM [20], MOEA/DM2M [29], MOEA/DAWA [34], and MOEA/DPaS [33]), are set the same as in their corresponding references. For MOEA/DDRAUT, , where and is set as a small positive number. As suggested in [46], is used. However, in MOEA/DMUP, the neighborhood size is , and the probability used to select in the neighborhood is . The common parameters of these algorithms in our experimental studies are summarized as follows:(1)The population size: N is set to 200 for F1F8 and 300 for F9F16.(2)Reproduction operators: To be fair, we use DE operator and Polynomialbased mutation for offspring generation in all the compared algorithms except that MOEA/DM2M employs another recombination operator [53] as suggested in [29]. As recommended in [19], we set and in DE operation, and in Polynomialbased mutation operator, where is the number of decision variables.(3)The stopping condition and the number of runs: The maximal number of function evaluation is set to 300,000 for all test problems. All the algorithms are run 30 times independently on each test problem.

4.4. Performance Metrics
To compare the performance of all algorithms on test instances, the inverted generational distance (IGD) indicator and the hypervolume indicator (I_{H}) are used in our experiments. A set of solutions uniformly sampled along the true PF is needed for computing the former indicator, i.e., IGD. However, for the later, i.e., I_{H}, a reference point is necessary. In our experiment, all the nondominated solutions are selected from the final population, which are used to compare the performance of all algorithms in terms of IGD values and I_{H} values.
IGD [54]: Let be a set of solutions which are uniformly sampled along the PF in the objective space. The approximate set (denoted as A in (23)) composes of a set of nondominated solutions, which are selected from the final population obtained by the corresponding algorithm. Then, the IGD value can be computed as follows:where and m is the number of objectives. As suggested in [46], 500 representative points are uniformly sampled from the PF to form for F1F8, and 1,000 points are chosen as for F9F16.
I_{H} [55]: Let be a reference point in the objective space. The approximate set (denoted as A in (24)) composes of a set of nondominated solutions, which are obtained by the corresponding algorithm in the objective space. Then, the I_{H} value is computed as follows:where is the Lebesgue measure. As suggested in [29], the reference point is considered in our experiments. Please note that all the nondominated solutions in A should dominate the reference point in the objective space.
5. Experimental Studies
In this section, we present and discuss the comparisons of MOEA/DMUP with other stateoftheart algorithms. Three classical algorithms (NSGAII, SMSMOEA, and MOEA/DDRA), and a competitive algorithm with the utopian reference point (MOEA/DDRAUT) are chosen for comparison. Experimental results obtained by the above four algorithms in terms of the two common indicators, i.e., IGD and I_{H}, are shown in Tables 2 and 3, respectively. In addition, four representative MOEA/D variants such as MOEA/DSTM, MOEA/DM2M, MOEA/DAWA and MOEA/DPaS are also chosen to further validate the superiority of our proposed algorithm. The values of IGD and I_{H} obtained by the four MOEA/D variants are shown in Tables 4 and 5, respectively. Please note that the final nondominated solutions with the median IGD values obtained by different algorithms in 30 runs are plotted in Figures 8 and 9.
 
According to Wilcoxon’s rank sum test with a significant level , +, − and = indicate that the corresponding MOEA is significantly better than, worse than or similar to MOEA/DMUP. 
 
According to Wilcoxon’s rank sum test with a significant level , +, − and = indicate that the corresponding MOEA is significantly better than, worse than or similar to MOEA/DMUP. 
 
According to Wilcoxon’s rank sum test with a significant level , +, − and = indicate that the corresponding MOEA is significantly better than, worse than or similar to MOEA/DMUP. 
 
According to Wilcoxon’s rank sum test with a significant level , +, − and = indicate that the corresponding MOEA is significantly better than, worse than or similar to MOEA/DMUP. 
5.1. Quantitative Comparisons
According to Wilcoxon’s rank sum test with a significant level of 0.05, the experimental results obtained by the nine MOEAs in terms of IGD metric and I_{H} metric are shown in Tables 2–5, respectively. In general, it can be observed that MOEA/DMUP performs better than the other eight algorithms on most test problems, i.e., F1F16. More specifically, it can be seen from Tables 2–5 that our proposed MOEA/DMUP achieves the best results in terms of the mean IGD values in all compared algorithms on F1F6 and F9F16. In addition, compared with the other algorithms except MOEA/DDRAUT and MOEA/DM2M, MOEA/DMUP obtains the best values for both mean IGD metric and I_{H} metric on F7. For F8, MOEA/DMUP only performs slightly worse than MOEA/DDRAUT in terms of mean IGD metric, while they have no significant difference in terms of mean I_{H} metric. Next, we specifically analyze and discuss the superiority and drawback of MOEA/DMUP with four classical MOEAs and four representative MOEA/Ds, respectively. The comparison results of MOEA/DMUP with four classical MOEAs in terms of mean IGD and I_{H} values are presented in Tables 2 and 3, respectively. The best metric values are highlighted in bold face and the metric values which are significantly similar to the metric value of MOEA/DMUP are marked with italic font.
As shown in Tables 2 and 3, we can conclude that MOEA/DMUP is significantly better than NSGAII and SMSEMOA in terms of mean IGD and I_{H} values on all test problems adopted, i.e., F1F16. In fact, the fast nondominated sorting approach always tends to choose these solutions in the middle part of the PF, which is caused by the characteristics of the problems that the solutions located in the middle part of the PF always can dominate other boundary solutions during the evolutionary process. Thus, as shown in Tables 2 and 3, NSGAII always obtains very poor performance on all test problems, i.e., F1F16. Similarly, the update strategy of neighborhood used in most MOEA/Ds is executed based on the aggregated function value to replace parent solutions, which also follows the strategy of convergence first and diversity second. Thus, overcrowdedness in the middle part of the PF still occurs in most MOEA/Ds. For example, although a dynamic computational resource allocation strategy is adopted in MOEA/D, MOEA/DDRA still fails to cover the boundaries of these PFs when solving F1F16. As shown in Tables 2 and 3, in terms of mean IGD and I_{H} values, MOEA/DMUP achieves better performance than MOEA/DDRA on all test problems except that they have no significant difference on F7 regarding the mean IGD value. For MOEA/DDRAUT, more boundary areas can be found in the evolutionary search process, while MOEA/DDRAUT is still beaten by our proposed MOEA/DDRAUT on most test problems. These results validate that solutions in the middle part of the PF are likely maintained in the environmental selection mechanisms of these traditional MOEAs when tackling the problems with difficulttoapproximate PF boundaries. It can be observed from Tables 2 and 3, MOEA/DMUP significantly outperforms MOEA/DDRAUT on most test problems. For example, on F1F6, MOEA/DMUP is significantly better than MOEA/DDRAUT in terms of mean IGD and I_{H} values. However, on F7, no algorithm can approximate the entire PF due to the extreme difficulty to search the PF boundaries. Quantitatively, MOEA/DMUP is slightly beaten by MOEA/DDRAUT in terms of mean IGD and I_{H} values on F7. In addition, the performance of MOEA/DDRA is similar to MOEA/DMUP in terms of IGD on F7. This is mainly because the used dynamic resource allocation strategy can allocate more computational resources to search the undiscovered boundaries of the true PF on F7. Quantitatively, for F8, MOEA/DMUP is slightly beaten by MOEA/DDRAUT in terms of IGD metric, while they have similar results in terms of I_{H} metric. As discussed above, the use of the utopian reference point instead of the ideal reference point is helpful to exploit the boundaries of the PF. However, in MOEA/DMUP, multiple utopian reference points are used to provide different evolutionary search directions, which fails to cover the entire PF of F8. This is mainly because the inaccuracy of the nadir point leads to the wrong judgment about the upper bounds of the entire PF of F8. Furthermore, For F9F16, MOEA/DMUP achieves a better performance than MOEA/DDRAUT in terms of mean IGD metric, except that they are similar on F15. In terms of mean I_{H} metric, MOEA/DMUP performs much better than MOEA/DDRAUT on F10F12 and F16, and they obtain statistically similar results for the rest threeobjective test problems. In general, these results confirm the superiority of MOEA/DMUP for tackling these problems with difficulttoapproximate PF boundaries.
As shown in Tables 4 and 5, the experimental results of MOEA/DMUP with four representative MOEA/Ds (MOEA/DSTM, MOEA/DM2M, MOEA/DAWA, and MOEA/DPaS) also demonstrate the superiority of MOEA/DMUP on these test problems. It is clear from the two tables that MOEA/DMUP significantly outperforms MOEA/DSTM, MOEA/DAWA, and MOEA/DPaS on F1F16 and achieves better performance on most test problems than MOEA/DM2M. As shown in Tables 4 and 5, MOEA/DMUP is only beaten by MOEA/DM2M on F7, and they obtain statistically similar results on F13 and F14 in terms of I_{H}. On other problems, MOEA/DMUP is significantly better than MOEA/DM2M. In terms of IGD, MOEA/DSTM is similar to MOEA/DMUP on F7, while MOEA/DSTM is significantly worse than MOEA/DMUP on the rest problems. When compared to MOEA/DAWA and MOEA/DPaS, MOEA/DMUP performs much better on all test problems. Furthermore, when compared to MOEA/DSTM, MOEA/DM2M, MOEA/DAWA, and MOEA/DPaS, MOEA/DM2M attains the best mean IGD and I_{H} values on all twoobjective test problems. From these comparison results, it can be concluded that our proposed MOEA/DMUP obtains the best performance, and the decomposition strategy used in MOEA/DM2M achieves some success for some problems with difficulttoapproximate PF boundaries, as it can effectively maintain the boundary solutions into the next population. To conclude, our proposed MOEA/DMUP can attain significantly better convergence and breadthdiversity than other compared MOEAs on most test problems adopted. For the problems with difficulttoapproximate PF boundaries, diversity should be more considered during the evolution.
To visually show the convergence speeds of all the compared algorithms during the evolution, the curves of IGD value over the number of evaluations are depicted in Figure 7, when solving two biobjective optimization problems (F1 and F6) and three tripleobjective optimization problems (F10, F13, and F16). As shown in Figures 7(a) and 7(b), although MOEA/DDRAUT shows a faster convergence speed than MOEA/DMUP in the early stage, MOEA/DMUP can finally obtain the best IGD values on F1 and F6. For F10, F13, and F16, respectively, in Figures 7(c), 7(d), and 7(e), MOEA/DMUP also shows a much faster convergence speed during the evolution and achieves the best IGD values.
(a)
(b)
(c)
(d)
(e)
5.2. Qualitative Comparisons
Due to page limitations, we select two competitive algorithms, i.e., MOEA/DDRAUT and MOEA/DM2M, to qualitatively demonstrate the superiority of our proposed algorithm on solving most of the test problems adopted. For example, some representative twoobjective problems, i.e., F1, F3, F5, F6, and F8 are shown in Figure 8 and some threeobjective problems are shown Figure 9, respectively. As shown in Figure 8, it is obvious that our proposed algorithm MOEA/DMUP performs best on these test problems. For F8 with the convex PF, MOEA/DMUP is only beaten by MOEA/DDRAUT, while MOEA/DMUP is obviously better than MOEA/DM2M. As shown in Figure 8, MOEA/DMUP obtains a better approximation of the PF on F8 than MOEA/DM2M. For example, boundary solutions obtained by MOEA/DDRAUT have not completely converged to the true PF, while MOEA/DMUP performs much better.
As shown in Figure 9, the final nondominated sets obtained by the three algorithms on F9, F12 and F16 are plotted. It is obvious that MOEA/DMUP performs significantly better than MOEA/DDRAUT and MOEA/DM2M for these threeobjective problems, i.e., F9, F12 and F16. Moreover, it can be seen from Figure 9 that more boundary solutions are obtained by MOEA/DMUP, while the other two algorithms cannot approximate the PF boundaries sufficiently.
5.3. Parameter Sensitivity Analysis
In our algorithm, the maximal number of solutions replaced by a newly generated solution could be set as large as T (the neighborhood size). However, in most MOEA/Ds [19], the maximal number of solutions replaced by a newly generated solution is bounded by nr, which is set to be much smaller than T. To study the impact of nr in MOEA/DMUP, different values (i.e., 2, 10, 20 and 30) are used for performance comparison. Due to page limitations, only the curves of IGD values obtained by four nr values on some test problems, i.e., F6 and F16, are provided in Figures 10(a) and 10(b). As shown in Figure 10, it is found that the performance of MOEA/DMUP with a large nr value is superior to that with a small nr value. Thus, in MOEA/DMUP, the maximal number of solutions replaced by a newly generated solution is set to be as large as the neighborhood size, which can better balance convergence and diversity during the evolutionary process.
(a)
(b)
6. Conclusion
In this paper, we have proposed an evolutionary search method with multiple utopian reference points for MOEA/D, called MOEA/DMUP, which uses multiple utopian reference points to provide evolutionary search directions for different weight vectors. In order to effectively exploit the undiscovered boundaries of PF and enhance the breadthdiversity, the utopian reference point of each search direction is got by transforming the ideal point at a specified distance. Moreover, the nadir point is used to restrict the maximal translational distance. In other words, the positions of multiple utopian reference points in the objective space are bounded by the ideal point and the nadir point. Comparing our proposed algorithm with eight stateoftheart MOEAs in terms of both IGD and I_{H} metrics, we have witnessed the effectiveness and competitiveness of MOEA/DMUP on F1F16 used in this paper. As indicated by the experimental results, most existing MOEA/Ds cannot approximate the entire PFs on these test problems because the boundaries of PF cannot be effectively exploited. For the problems with difficulttoapproximate PF boundaries, there is a little effort that has been made to effectively exploit the boundary areas and balance exploration and exploitation in the search space. Therefore, there is much room for further development.
In the future work, we would like to investigate more effective selection mechanisms to better balance convergence and diversity during the evolutionary search process when tackling the problems with difficulttoapproximate PF boundaries. Specifically, we will further study a more accurate generation method for utopian reference points and design recombination operators with stronger search ability. We also will put more efforts to develop mechanisms that can adaptively approximate the complex PFs and to extend our algorithm for solving manyobjective optimization problems. Moreover, it is valuable to apply our proposed algorithm to solve some realworld applications [56, 57].
Data Availability
All the source code and data can be provided by contacting the corresponding author.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work was supported by the National Natural Science Foundation of China under Grants 61876110, 61836005, and 61672358, the Joint Funds of the National Natural Science Foundation of China under Key Program Grant U1713212, the Natural Science Foundation of Guangdong Province under Grant 2017A030313338, and Shenzhen Technology Plan under Grant JCYJ20170817102218122. Also, this work was supported by the National Engineering Laboratory for Big Data System Computing Technology.
References
 Y. Zhang, D.W. Gong, and J. Cheng, “Multiobjective particle swarm optimization approach for costbased feature selection in classification,” IEEE Transactions on Computational Biology and Bioinformatics, vol. 14, no. 1, pp. 64–75, 2017. View at: Publisher Site  Google Scholar
 J.Q. Li, Q.K. Pan, and Y.C. Liang, “An effective hybrid tabu search algorithm for multiobjective flexible jobshop scheduling problems,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 647–662, 2010. View at: Publisher Site  Google Scholar
 N. Yousefi, “Solving nonconvex economic load dispatch problem using particle optimization with time varying acceleration coefficients,” Complexity, vol. 21, no. 6, pp. 299–308, 2016. View at: Google Scholar
 X. Zhao, X.S. Gao, and Z.C. Hu, “Evolutionary programming based on nonuniform mutation,” Applied Mathematics and Computation, vol. 192, no. 1, pp. 1–11, 2007. View at: Publisher Site  Google Scholar
 B. Xin, L. Chen, J. Chen, H. Ishibuchi, K. Hirota, and B. Liu, “Interactive multiobjective optimization: a review of the stateoftheart,” IEEE Access, vol. 6, pp. 41256–41279, 2018. View at: Publisher Site  Google Scholar
 W. Gong, Z. Cai, and D. Liang, “Adaptive ranking mutation operator based differential evolution for constrained optimization,” IEEE Transactions on Cybernetics, vol. 45, no. 4, pp. 716–727, 2015. View at: Publisher Site  Google Scholar
 F. Han, Y. Sun, and Q. Ling, “An improved multiobjective quantumbehaved particle swarm optimization based on double search strategy and circular transposon mechanism,” Complexity, vol. 2018, Article ID 8702820, 22 pages, 2018. View at: Publisher Site  Google Scholar
 Y. Yu, H. Ma, M. Yu, S. Ye, and X. Chen, “Multipopulation management in evolutionary algorithms and application to complex warehouse scheduling problems,” Complexity, vol. 2018, Article ID 4730957, 14 pages, 2018. View at: Publisher Site  Google Scholar
 Q. Lin, X. Wang, B. Hu et al., “Multiobjective personalized recommendation algorithm using extreme point guided evolutionary computation,” Complexity, vol. 2018, pp. 1–18, 2018. View at: Publisher Site  Google Scholar
 J. Li, Q. Pan, P. N. Suganthan, and T. J. Chua, “A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 59, no. 4, pp. 647–662, 2011. View at: Google Scholar
 K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGAII,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at: Publisher Site  Google Scholar
 E. Zitzler, M. Laumanns, and L. Thiele, “SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization,” in Proceedings of the Evolutionary Methods for Design, Optimization and Control with Application to Industrial Problems, pp. 95–100, Athens, Greece, 2002. View at: Google Scholar
 X. Zou, Y. Chen, M. Liu, and L. Kang, “A new evolutionary algorithm for solving manyobjective optimization problems,” IEEE Transactions on Systems, Man and Cybernetics, vol. 18, no. 4, pp. 577–601, 2014. View at: Google Scholar
 Y. Hua, Y. Jin, and K. Hao, “A clusteringbased adaptive evolutionary algorithm for multiobjective optimization with irregular pareto fronts,” IEEE Transactions on Cybernetics, 2018. View at: Google Scholar
 N. Beume, B. Naujoks, and M. Emmerich, “SMSEMOA: Multiobjective selection based on dominated hypervolume,” European Journal of Operational Research, vol. 181, no. 3, pp. 1653–1669, 2007. View at: Publisher Site  Google Scholar
 K. Li, J. Zheng, M. Li, C. Zhou, and H. Lv, “A novel algorithm for nondominated hypervolumebased multiobjective optimization,” in Proceedings of the IEEE International Conference Systems, Man, and Cybernetics, pp. 5220–5226, San Antonio, Tex, USA, 2009. View at: Google Scholar
 Q. Zhang and H. Li, “MOEA/D: a multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 6, pp. 712–731, 2007. View at: Publisher Site  Google Scholar
 H. Zhang, X. Zhang, X.Z. Gao, and S. Song, “Selforganizing multiobjective optimization based on decomposition with neighborhood ensemble,” Neurocomputing, vol. 173, pp. 1868–1884, 2016. View at: Publisher Site  Google Scholar
 H. Li and Q. Zhang, “Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGAII,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 284–302, 2009. View at: Publisher Site  Google Scholar
 S. X. Zhang, L. M. Zheng, L. Liu, S. Y. Zheng, and Y. M. Pan, “Decompositionbased multiobjective evolutionary algorithm with mating neighborhood sizes and reproduction operators adaptation,” Soft Computing, vol. 21, no. 21, pp. 6381–6392, 2017. View at: Publisher Site  Google Scholar
 K. Li, Q. Zhang, S. Kwong, M. Li, and R. Wang, “Stable matchingbased selection in evolutionary multiobjective optimization,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 6, pp. 909–923, 2014. View at: Publisher Site  Google Scholar
 C. Dai and X. Lei, “An improvement decompositionbased multiobjective evolutionary algorithm with uniform design,” KnowledgeBased Systems, vol. 125, pp. 108–115, 2017. View at: Publisher Site  Google Scholar
 H. Xu, W. Zeng, D. Zhang, and X. Zeng, “MOEA/HD: a multiobjective evolutionary algorithm based on hierarchical decomposition,” IEEE Transactions on Cybernetics, vol. 49, no. 2, pp. 517–526, 2019. View at: Publisher Site  Google Scholar
 W. Li, L. Wang, Q. Jiang, X. Hei, and B. Wang, “Multiobjective cloud particle optimization algorithm based on decomposition,” Directory of Open Access of Journals, vol. 8, no. 2, pp. 157–176, 2015. View at: Publisher Site  Google Scholar
 Y. Zhang, D.W. Gong, J.Y. Sun, and B.Y. Qu, “A decompositionbased archiving approach for multiobjective evolutionary optimization,” Information Sciences, vol. 430431, pp. 397–413, 2018. View at: Publisher Site  Google Scholar
 M. A. Potter and K. A. De Jong, “Cooperative coevolution: An architecture for evolving coadapted subcomponents.,” Evolutionary Computation, vol. 8, no. 1, pp. 1–29, 2000. View at: Publisher Site  Google Scholar
 Y. Gong, W. Chen, Z. Zhan et al., “Distributed evolutionary algorithms and their models: A survey of the stateoftheart,” Applied Soft Computing, vol. 34, pp. 286–300, 2015. View at: Google Scholar
 H. Wang and Y. Chen, “A coevolutionary algorithm for the flexible delivery and pickup problem with time windows,” International Journal of Production Economics, vol. 141, no. 1, pp. 4–13, 2013. View at: Publisher Site  Google Scholar
 H.L. Liu, F. Gu, and Q. Zhang, “Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 3, pp. 450–455, 2014. View at: Publisher Site  Google Scholar
 A. Chaabani, S. Bechikh, and L. B. Said, “A new coevolutionary decompositionbased algorithm for bilevel combinatorial optimization,” Applied Intelligence, vol. 48, no. 9, pp. 2847–2872, 2018. View at: Publisher Site  Google Scholar
 X. C. Zhao, “A perturbed particle swarm algorithm for numerical optimization,” Applied Soft Computing, vol. 10, no. 1, pp. 119–124, 2010. View at: Google Scholar
 Q. Lin and J. Chen, “A novel micropopulation immune multiobjective optimization algorithm,” Computers & Operations Research, vol. 40, no. 6, pp. 1590–1601, 2013. View at: Publisher Site  Google Scholar
 R. Wang, Q. Zhang, and T. Zhang, “Decompositionbased algorithms using pareto adaptive scalarizing methods,” IEEE Transactions on Evolutionary Computation, vol. 20, no. 6, pp. 821–837, 2016. View at: Publisher Site  Google Scholar
 Y. T. Qi, X. L. Ma, F. Liu, L. C. Jiao, J. Y. Sun, and J. S. Wu, “MOEA/D with adaptive weight adjustment,” Evolutionary Computation, vol. 22, no. 2, pp. 231–264, 2014. View at: Publisher Site  Google Scholar
 R. Wang, J. Xiong, H. Ishibuchi, G. Wu, and T. Zhang, “On the effect of reference point in MOEA/D for multiobjective optimization,” Applied Soft Computing, vol. 58, pp. 25–34, 2017. View at: Publisher Site  Google Scholar
 H. Sato, “Inverted PBI in MOEA/D and its impact on the search performance on multi and manyobjective optimization,” in Proceeding of the 2014 Conference on Genetic and Evolutionary Computation, pp. 645–652, Vancouver, Canada, 2014. View at: Google Scholar
 S. Jiang and S. Yang, “An improved multiobjective optimization evolutionary algorithm based on decomposition for complex pareto fronts,” IEEE Transactions on Cybernetics, vol. 46, no. 2, pp. 421–437, 2015. View at: Publisher Site  Google Scholar
 Z. Wang, Q. Zhang, H. Li, H. Ishibuchi, and L. Jiao, “On the use of two reference points in decomposition based multiobjective evolutionary algorithms,” Swarm and Evolutionary Computation, vol. 34, pp. 89–102, 2017. View at: Publisher Site  Google Scholar
 Y. Zhou, Y. Xiang, Z. Chen, J. He, and J. Wang, “A scalar projection and anglebased evolutionary algorithm for manyobjective optimization problems,” IEEE Transactions on Cybernetics, 2018. View at: Google Scholar
 J. Dutta and C. Kaya, “A new scalarization and numerical method for constructing weak Pareto front of multiobjective optimization problems,” Optimization, vol. 60, no. 89, pp. 1091–1104, 2011. View at: Google Scholar
 H. Ishibuchi, K. Doi, H. Masuda, and Y. Nojima, “Relation between weight vectors and solutions in MOEA/D,” in Proceedings of the IEEE Symposium Series on Computational Intelligence, SSCI 2015, pp. 861–868, December 2015. View at: Google Scholar
 Y. Qi, Q. Zhang, X. Ma, Y. Quan, and Q. Miao, “Utopian point based decomposition for multiobjective optimization problems with complicated Pareto fronts,” Applied Soft Computing, vol. 61, pp. 844–859, 2017. View at: Publisher Site  Google Scholar
 R. Saborido, A. B. Ruiz, and M. Luque, “Global WASFGA: an evolutionary algorithm in multiobjective optimization to approximate the whole pareto optimal front,” Evolutionary Computation, vol. 25, no. 2, pp. 309–349, 2017. View at: Publisher Site  Google Scholar
 Y. Qi, X. Li, J. Yu, and Q. Miao, “Userpreference based decomposition in MOEA/D without using an ideal point,” Swarm and Evolutionary Computation, vol. 44, no. 2, pp. 597–611, 2019. View at: Publisher Site  Google Scholar
 A. GhaneKanafi and E. Khorram, “A new scalarization method for finding the efficient frontier in nonconvex multiobjective problems,” Applied Mathematical Modelling, vol. 39, no. 2324, pp. 7483–7498, 2015. View at: Publisher Site  Google Scholar
 Z. Wang, Y. S. Ong, J. Sun, A. Gupta, and Q. Zhang, “A generator for multiobjective test problems with difficulttoapproximate pareto front boundaries,” IEEE Transactions on Evolutionary Computation, 2018. View at: Google Scholar
 X. Ma, Q. Zhang, G. Tian, J. Yang, and Z. Zhu, “On Tchebycheff decomposition approaches for multiobjective evolutionary optimization,” IEEE Transactions on Evolutionary Computation, vol. 22, no. 2, pp. 226–244, 2017. View at: Google Scholar
 Q. Zhang, W. Liu, and H. Li, “The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances,” in Proceedings of the 2009 IEEE Congress on Evolutionary Computation, CEC 2009, pp. 203–208, Trondheim, Norway, May 2009. View at: Google Scholar
 Q. Lin, G. Jin, Y. Ma et al., “A diversityenhanced resource allocation strategy for decompositionbased multiobjective evolutionary algorithm,” IEEE Transactions on Cybernetics, vol. 48, no. 8, pp. 2388–2401, 2018. View at: Google Scholar
 I. Das and J. E. Dennis, “Normalboundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems,” SIAM Journal on Optimization, vol. 8, no. 3, pp. 631–657, 1998. View at: Publisher Site  Google Scholar  MathSciNet
 H. Wang and X. Yao, “Corner sort for paretobased manyobjective optimization,” IEEE Transactions on Cybernetics, vol. 44, no. 1, pp. 92–102, 2014. View at: Publisher Site  Google Scholar
 Y. Tian, R. Cheng, X. Zhang, and Y. Jin, “PlatEMO: A matlab platform for evolutionary multiobjective optimization,” IEEE Computational Intelligence Magazine, vol. 12, no. 4, pp. 73–87, 2017. View at: Publisher Site  Google Scholar
 H. Liu and X. Li, “The multiobjective evolutionary algorithm based on determined weight and subregional search,” in Proceedings of the IEEE Conference on Evolutionary Computation, pp. 1928–1934, Trondheim, Norway, 2009. View at: Google Scholar
 M. Li and J. Zheng, “Spread assessment for evolutionary multiobjective optimization,” in Proceedings of the 5th International Conference on Evolutionary MultiCriterion Optimization, pp. 216–230, Nantes, France, 2009. View at: Publisher Site  Google Scholar
 L. While, P. Hingston, L. Barone, and S. Huband, “A faster algorithm for calculating hypervolume,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 1, pp. 29–38, 2006. View at: Publisher Site  Google Scholar
 J.Q. Li, Q.K. Pan, and M. F. Tasgetiren, “A discrete artificial bee colony algorithm for the multiobjective flexible jobshop scheduling problem with maintenance activities,” Applied Mathematical Modelling, vol. 38, no. 3, pp. 1111–1132, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 Y. Y. Han, D. W. Gong, and X. Y. Sun, “A discrete artificial bee colony algorithm incorporating differential evolution for flow shop scheduling problem with blocking,” Engineering Optimization, vol. 47, no. 7, pp. 927–946, 2015. View at: Google Scholar
Copyright
Copyright © 2019 Wu Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.