Effectiveness and efficiency of non-dominated sorting for evolutionary multi- and many-objective optimization

To verify the effectiveness of non-dominated sorting for multi-objective optimization, we empirically investigate the role of non-dominated sorting in NSGA-II, which is for solving MOPs [7]. The NSGA-II consists of two main components, fast non-dominated sort and crowding distance, for distinguishing the quality of solutions in the environmental selection. At each generation of NSGA-II, non-dominated sorting is first employed to select solutions with lower ranks from the population combining parent population with offspring population, and crowding distance is used as the secondary metric to distinguish solutions in the same rank by favoring solutions with a large crowding distance.

Figure 2 presents the convergence profiles of inverted generational distance (IGD) values obtained by NSGA-II with non-dominated sorting and the variant without non-dominated sorting on 2-objective ZDT1 and ZDT4, and 3-objective DTLZ1 and DTLZ2, averaged over 30 independent runs, where the population size is set to 100 and the remaining parameters are set to the same values recommended in [7]. IGD is a popular metric for measuring the quality of a solution set in terms of both convergence and distribution. ZDT1, ZDT4, DTLZ1, and DTLZ2 are widely used benchmark MOPs with multi- and uni-modal properties, respectively [33, 34]. From the figure, the following two observations can be obtained.

First, non-dominated sorting plays a crucial role in guiding the population of NSGA-II to approximate the Pareto fronts of MOPs. On both uni- and multi-model MOPs, the population of NSGA-II is far from converging to the Pareto fronts in a maximum of 300 generations without using non-dominated sorting. Second, the crowding distance is a little helpful for the convergence of populations of NSGA-II on 2-objective MOPs, but the population cannot converge to the Pareto fronts of MOPs without non-dominated sorting. On 3-objective MOPs, it seems that the crowding distance cannot promote populations of NSGA-II towards the Pareto fronts. As the number of generations increases, the IGD values obtained by the NSGA-II without non-dominated sorting increase on 3-objective DTLZ1 and DTLZ2. The second observation can be confirmed by Fig. 3, where the minimal distance of solutions in population to Pareto fronts is presented at different iterations for the variant of NSGA-II without non-dominated sorting on 2-objective ZDT1 and ZDT4 and 3-objective DTLZ1 and DTLZ2.

To further illustrate the role of non-dominated sorting in MOEAs, Fig. 4 presents the number of solutions in different fronts determined by non-dominated sorting for next population of NSGA-II on 2-objective ZDT1 and ZDT4 and 3-objective DTLZ1 and DTLZ2, where the number of candidate solutions is 200 and the size of next population is 100. From the figure, it can be seen clearly that non-dominated sorting is a very effective strategy to distinguish the quality of solutions in population evolution of NSGA-II for solving MOPs. For the combined population consisting of parent and offspring populations, non-dominated sorting can determine a large number of candidate solutions unsuitable for surviving for next population when NSGA-II is used to solve MOPs. It can also be found that the number of solutions which are considered unsuitable for surviving considerably decreases on 3-objective MOPs, which implies the decrement of ability of non-dominated sorting in distinguishing the quality of solutions as the number of objectives increases.

Based on the above empirical results, we can conclude that non-dominated sorting is a promising strategy enabling the population to converge to the Pareto fronts for MOEAs.

In this subsection, we evaluate the effectiveness of non-dominated sorting in MOEAs for solving MaOPs. To this end, we consider the knee point driven non-dominated sorting-based MOEA, KnEA, recently tailored to handle MaOPs. The KnEA consists of two main components in the environmental selection: (1) non-dominated sorting and (2) knee point selection. At each generation of KnEA, non-dominated sorting is first performed on the combined population consisting of parent and offspring populations, and then, knee points in the first non-dominated front are selected, in case the number of non-dominated solutions in the first front is larger than the population size.

Figure 5 presents the convergence profiles of IGD values obtained by KnEA with non-dominated sorting and the variant without non-dominated sorting on 5- and 10-objective DTLZ1 and DTLZ2, where the population size is set to 100 and the expected rate of knee points is set to 0.1 for DTLZ1 and 0.5 for DTLZ2. From the figure, the following three observations can be obtained. First, non-dominated sorting is very helpful for KnEA to achieve a set of non-dominated solutions with better quality for solving MaOPs. The KnEA with non-dominated sorting can always obtain better IGD values than the variant of KnEA without non-dominated sorting under different iterations, on all tested MaOPs, especially for 5-objective DTLZ2. To illustrate the reason for the enhanced quality of solution set, Fig. 6 gives the generational distance (GD) values obtained by KnEA with non-dominated sorting and the variant without non-dominated sorting at different iterations on DTLZ1 and DTLZ2 with 5 and 10 objectives. The GD is a widely used metric for measuring the convergence of a solution set. As shown in the figure, non-dominated sorting can clearly help population of KnEA to better converge to the Pareto fronts on MaOPs, especially for DTLZ1 which has a large number of local Pareto fronts.

Second, the role of non-dominated sorting in promoting population of KnEA to converge to the Pareto fronts degenerates on MaOPs in comparison to that on MOPs. The main reason is attributed to a phenomenon called dominance resistance [19], since the number of solutions will considerably increase as the number of objectives increases. Taking two random solutions in M-dimensional objective space as an example, the probability that one solution dominates the other one is \((\frac{1}{2})^{M-1}\), as shown in Fig. 7. It is clear that the probability decreases rapidly with the increasing number of objectives, and it becomes almost impossible that solutions with more than 12 objectives in a random population can be dominated [35]. It is necessary to note that non-dominated sorting can still determine a few candidate solutions in the combined population unsuitable for surviving for next population in solving MaOPs, which is helpful for promoting population of KnEA to converge to the Pareto fronts.

Third, knee point selection plays a key role in enabling the population of KnEA to converge to the Pareto fronts for MaOPs. On all tested MaOPs, KnEA only using knee point selection can achieve a competitive performance in terms of IGD and GD, especially for DTLZ2 with 5 and 10 objectives. This result shows that KnEA is still effective on most MaOPs when the knee points are selected from the whole population instead of each non-dominated front of the population, despite that the performance has a little deterioration. It seems that non-dominated sorting is more helpful in KnEA on DTLZ1 with a large number of local Pareto fronts, which can considerably enhance the convergence of population of KnEA in terms of GD.

Therefore, we can summarize that non-dominated sorting is also important for developing a promising MOEA to solve MaOPs, especially for some complex MaOPs, such as those with multiple local Pareto fronts.

As shown in the above subsection, the effectiveness of non-dominated sorting degenerates in MOEAs for MaOPs due to the decrement of selection pressure of the Pareto dominance. To address this issue, a large number of enhanced versions of the Pareto dominance have been proposed based on different ideas.

The first idea for enhancing the effectiveness of the Pareto dominance is to divide the objective space into a number of grids and solutions in the same grid are considered as identical ones. One of representative dominance belonging to this category is \(\epsilon \)-dominance relation [36]. \(\epsilon \)-Dominance first divides each objective into d equal parts, and thus, an M-dimensional objective space will contain \(d^M\) hypercubes. Then, the grid coordinates of solutions are used to determine their dominance relations instead of the objective values. The \(\epsilon \)-dominance relation is a relaxation of the Pareto dominance and other similar work includes \(pa\epsilon \)-dominance [37], cone \(\epsilon \)-dominance [38], etc.

The second idea for enhancing the effectiveness of the Pareto dominance is based on the expansion of the dominance area. For two random solutions with M objectives, the probability that one solution dominates the other one is \((\frac{1}{2})^{M-1}\), and hence, it is rare for one solution to dominate the other one in high-dimensional space. The controlling dominance area of solutions (CDAS) method [39] expands the dominance area of each solution by a specified angle on each objective, and thus, the probability of dominance and the selection pressure increase. An adaptive version of CDAS was suggested in [40], where the expanding angle was adaptively estimated according to the extreme solutions. It is worth noting that the CDAS expands the dominance area by modifying the objective values of solutions; there also exist some dominance relations which expand the dominance area by modifying the definition of dominance, e.g., \(\alpha \)-dominance [41] and generalized Pareto optimality (GPO) [42].

The third idea is to adopt the concept of fuzzy logic to develop novel dominance relations, such as (1-k)-dominance [43], L-dominance [44], and fuzzy dominance [45, 46]. In the Pareto dominance, one solution dominates another one only if all the objective values of the former are smaller than or equal to those of the latter, whereas in fuzzy logic-based dominance relations, one solution may dominate another one if the majority of the objectives of the former are smaller than those of the latter. In this case, a solution can dominate those which have much worse values than it on most objectives and slightly better values than it on a few objectives, and thus, the quality of solutions can be distinguished.

The fourth idea enhances the effectiveness of the Pareto dominance by means of a set of uniformly distributed reference vectors as suggested in decomposition-based MOEAs [47, 48]. \(\theta \)-Dominance [48] is a dominance relation belonging to this category, where each solution is associated with its nearest reference vector, and a solution is said to dominate another one if and only if the two solutions are associated with the same reference vector and the former has better convergence and diversity than the latter. \(\theta \)-dominance relation aims to make each solution converge to the same direction of one reference vector, which can enable the population to hold a good convergence and diversity.

It is necessary to stress that there are also some other interesting ideas which enhance the effectiveness of non-dominated sorting by combining it with additional convergence- or diversity-related metrics, instead of directly modifying the definition of the Pareto dominance. Some representatives belonging to this category include hypervolume [49], knee point [22], enhanced IGD [18], and shift-based density [50].

In the past 2 decades, a large number of interesting algorithms have been developed to address the high computational cost of non-dominated sorting. In what follows, we only recall several non-dominated sorting algorithms which are widely used in literature. The interested readers can refer to [51] for a more detailed list of non-dominated sorting algorithms.

In 2003, Jensen [26] suggested a non-dominated sorting method, called Jensen’s sort, based on the divide-and-conquer strategy. Jensen’s sort is an improved version of the non-dominated sorting method developed by Kung et al. [52], where the time complexity has been reduced to \(O(N\mathtt{ln}^{M-1}N)\) from \(O(N^2\mathtt{ln}^{M-1}N)\) (M and N are hereafter denoted as the number of objectives and the population size, respectively), considerably outperforming the time complexity \(O(MN^2)\) of fast non-dominated sort (FNS) developed in NSGA-II. Compared to the FNS, Jensen’s sort also has a significant improvement in space complexity. The space complexity of Jensen’s sort is O(N), whereas FNS holds a space complexity of \(O(N^2)\). Hence, Jensen’s sort is computationally more efficient than FNS on MOPs with a small number of objectives, especially for those with two or three objectives. In spite of the high computational efficiency, Jensen’s sort suffers from the restriction that two compared solutions should not have the same value in any of their objectives.

To address the weakness of Jensen’s sort, Fang et al. [53], in 2008, proposed a new divide-and-conquer-based non-dominated sorting algorithm, where a new data structure called dominance tree was adopted to reduce the number of redundant comparisons in FNS. This algorithm is called the divide-and-conquer based sort. Empirical results demonstrated that the divide-and-conquer-based sort holds a time complexity close to \(O(MN\mathtt{ln}N)\) for two-objective MOPs and approaches asymptotically to the upper bound \(O(MN^2)\) as the number of objectives increases. Another improved version of Jensen’s sort, termed generalized Jensen’s sort, was also developed by Fortin et al. in [54]. As reported in [54], the generalized Jensen’s sort can well address the weakness of Jensen’s sort without increasing the time complexity and space complexity.

In 2012, McClymont and Keedwell [28] developed a novel non-dominated sorting method, called deductive sort, by exploiting the properties of Pareto optimality, dominance, and non-dominance, as well as the possible inherent inferences that can be made based on the nature of these relationships. Although deductive sort holds a time complexity of \(O(MN^2)\) in the worst case which is the same as that of FNS, empirical evidence indicated that it can save a large number of comparisons between solutions.

The corner sort suggested by Wang and Yao [30] in 2013 is also a computationally very efficient non-dominated sorting algorithm. In corner sort, a non-dominated solution is first selected from the corner solutions, and then, the solutions dominated by it will be ignored to save comparisons between solutions. As reported in [30], corner sort is more suited for solving MaOPs than FNS and deductive sort, and the more objectives an MaOP has, the more objective comparisons it can save. Corner sort holds a time complexity of \(O(MN^2)\) in the worst case, but in some best cases, its time complexity can be reduced to \(O(MN\sqrt{N})\).

In 2015, Martin et al. [55] proposed a non-dominated sorting method, called M-front, whose main idea was to utilize the existing knowledge of population in dominance relationship at last generation to perform non-dominated sorting for the current population. In M-front, the geometric and algebraic properties of the Pareto dominance were used to speed up the insertions and removals of solutions in non-dominated fronts. The M-front has a best case time complexity of O(MN) or \(O(MN\mathtt{ln}N)\) if the k-d tree is used, and a worst case time complexity of \(O(MN^2)\).

Zhang et al. [29] also developed an efficient non-dominated sorting method in 2015, called ENS, which has been shown to well suit for solving MOPs with a small number of objectives, especially for MOPs with two or three objectives. The high efficiency of ENS is attributed to the fact that an operation of pre-sort was suggested for population according to one of the objectives, since in the sorted population, a solution can never be dominated by solutions ranked behind it, thereby saving a large number of comparisons between solutions. It is worth noting that the superiority of ENS will decrease as the number of objectives increases, despite that it still outperforms several existing non-dominated sorting methods, such as FNS and deductive sort as indicated in [29]. To solve this problem, a tree-based non-dominated sorting method, termed T-ENS, was suggested by Zhang et al. in [23] based on the ENS framework. Empirical evaluations demonstrated that T-ENS is computationally very efficient for MaOPs and its computational cost almost keeps the same as the number of objectives increases. T-ENS holds a worst case time complexity of \(O(MN^2)\) (the same with that of ENS) and a best case time complexity of \(O(MN\mathtt{ln}N/\mathtt{ln}M)\), which is better than \(O(MN\mathtt{ln}N)\) of ENS-BS and \(O(MN\sqrt{N})\) of ENS-SS.

Recently, an interesting non-dominated sorting approach for many-objective optimization, called A-ENS, was reported in [31], where the idea of approximate non-dominated sorting was developed. The main difference between A-ENS and existing non-dominated sorting methods lies in the fact that A-ENS can only obtain an approximate non-dominated sorting result, whereas the other methods all aim to obtain an accurate result. Empirical validation by embedding it into three popular MOEAs showed that A-ENS is not only computationally very efficient for MaOPs, but also can improve search performance on most test problems. The time complexity of A-ENS is \(O(N^2)\) in the worst case and \(O(N\sqrt{N})\) in the best cases, which is independent of the number of objectives, since, in A-ENS, the dominance relationship between any two solutions is determined by a maximum of three-objective comparisons.

In the following, we verify the computational efficiency of eight widely used non-dominated sorting methods when they are adopted for handling MOPs. The eight methods under consideration include fast non-dominated sort (FNS) [7], generalized Jensen’s sort [54], divide-and-conquer-based sort [53], deductive sort [28], corner sort [30], M-front [55], ENS-SS [29], and T-ENS [23].

In the experiments, the computational efficiency of these non-dominated sorting methods is considered on random populations and MOEAs. The first scenario is used to mimic the situation in the early search stages of MOEAs, and the second scenario is adopted to test the computational efficiency of these non-dominated sorting methods when they are embedded into MOEAs for solving MOPs. In the second scenario, all components of an embedded MOEA are identical with the only exception of the non-dominated sorting methods adopted in it.

Figures 8 and 9 present the number of objective comparisons and runtime(s) of the eight non-dominated sorting methods in the first scenario for two-objective and three-objective optimization, averaged over 30 random populations with the same size. From the figures, the following two results can be observed. First, in terms of number of objective comparisons, the generalized Jensen’s sort performs the best on random populations for both two-objective and three-objective optimization. ENS-SS and divide-and-conquer-based sort need slightly more objective comparisons than generalized Jensen’s sort. The rest five non-dominated sorting methods underperform the generalized Jensen’s sort, ENS-SS, and divide-and-conquer-based sort.

Second, in terms of runtime, ENS-SS always achieves the best efficiency on random populations for two-objective and three-objective optimization. The superiority of ENS-SS over the generalized Jensen’s sort in runtime may be partly attributed to the fact that ENS-SS holds a space complexity of O(1), whereas the space complexity of generalized Jensen’s sort is O(N). It is worth noting that deductive sort also achieves a competitive efficiency on random populations in terms of runtime despite that it uses more objective comparisons.

Tables 1 and 2 list the experimental results of the eight non-dominated sorting methods when they are embedded into NSGA-II with a population size of 100 and 500 for solving two-objective and three-objective DTLZ2, averaged over 30 runs. All parameters of NSGA-II are set as recommended in [7]. From the tables, it can be found that the superiority of ENS-SS over the other seven non-dominated sorting methods has been enhanced when they are embedded into MOEAs to solve MOPs, in terms of both number of objective comparisons and runtime.

For the number of objective comparisons, the generalized Jensen’s sort still performs the best for three-objective DTLZ2, but ENS-SS can achieve the best efficiency in solving two-objective DTLZ2. As for the runtime, ENS-SS takes much less cost than the other seven non-dominated sorting methods for solving two-objective and three-objective DTLZ2, in case a population size of 100 is used. When the population size increases to 500, ENS-SS takes the least runtime for solving two-objective DTLZ2, whereas T-ENS will achieve the best for three-objective DTLZ2.

From the tables, it can also be seen that the computational efficiency of ENS-SS will be enhanced when a large population size of NSGA-II is used to solve MOPs, especially for solving MOPs with two objectives. Take the well-known non-dominated sorting method FNS as a comparison, the runtime taken by FNS is about 19 times of that of ENS-SS if a population size of 100 is used to solve two-objective DTLZ2. This ratio will be incremented to 94 as the population size becomes 500.

On the basis of the above empirical comparisons, we can conclude that ENS-SS is computationally more efficient than the state-of-the-art non-dominated sorting methods for multi-objective optimization, which can significantly improve the computational efficiency of an MOEA when it is embedded into the algorithm to solve MOPs. In the case of solving MOPs with three objectives, T-ENS will be strongly suggested to be adopted if a large population size is used in the MOEA.

In this subsection, we test the computational efficiency of the above eight non-dominated sorting methods on MaOPs.

The experiments are conducted on three different scenarios which are often encountered in many-objective optimization. In the first scenario, we test the efficiency of the non-dominated sorting methods on random populations for many-objective optimization; in the second scenario, the computational costs of the non-dominated sorting methods are compared by embedding them into the MOEAs which are specially tailored to solve MaOPs; in the third scenario, we compare the efficiency of the non-dominated sorting methods when they are used to obtain a set of reference points uniformly distributed on the true PFs, which is required for calculating some performance indicators, such as GD [56] and IGD [57].

Figures 10 and  11 plot the experimental results of the eight non-dominated sorting methods in the first scenario averaged over 30 random populations for the same number of objectives, where two population sizes of 500 and 1000 are considered, respectively. From the figures, the following two conclusions can be obtained. First, the efficiency of T-ENS is superior over the other seven non-dominated sorting methods in terms of both number of objective comparisons and runtime on random populations for many-objective optimization. The superiority of T-ENS will be enhanced as the population size increases. Second, ENS-SS performs better than T-ENS on random populations with four objectives in terms of runtime, despite that it consumes more objective comparisons than T-ENS. The main reason is attributed to the fact that ENS-SS holds a space complexity of O(1), whereas the space complexity of T-ENS is O(N).

Tables 3 and 4 list the experimental results of the eight non-dominated sorting methods when they are embedded into KnEA with a population size of 100 and 500 to solve 5-objective and 10-objective DTLZ2, respectively. The parameter settings of KnEA are the same as those recommended in [22] and the reported results are averaged over 30 independent runs. From the tables, we can find that T-ENS performs much more efficient than the other seven non-dominated sorting methods, in case that they are embedded into MOEAs to solve MaOPs. ENS-SS achieves the second best efficiency in terms of runtime when they are embedded into KnEA to solve MaOPs. It can also be seen that the superiority of T-ENS over the compared methods will be enhanced as the population size and the number of objectives increase in KnEA. These empirical results show that T-ENS is more suited to deal with large-scale MaOPs, since a large population is often needed for solving large-scale optimization problems.

Tables 5 and 6 present the experimental results of the eight non-dominated sorting methods for obtaining a set of reference points uniformly distributed on the true PF of DTLZ7 under 1000 and 10,000 sampled points, respectively. As can be seen from the tables, the generalized Jensen’s sort achieves the fewest objective comparisons in obtaining a set of reference points uniformly distributed on the true PF of DTLZ7, except in the case of 1000 sampled points for 5-objective DTLZ7, where T-ENS performs the fewest objective comparisons. In terms of runtime, T-ENS takes the least among all eight considered non-dominated sorting methods, despite that it consumes more objective comparisons than the generalized Jensen’s sort. It can also be found that ENS-SS is the second less time-consuming non-dominated sorting method except in the case of 10,000 sampled points for 10-objective DTLZ7, where deductive sort performs the second best.

From the empirical results shown in the above three scenarios, we can conclude that T-ENS is more suited for many-objective optimization, whose computational efficiency is much more competitive than that of the existing non-dominated sorting methods, especially when a large population size is adopted.

In the above two subsections, we have empirically verified the computational efficiency of eight state-of-the-art non-dominated sorting algorithms for multi-objective and many-objective optimization, respectively. In this subsection, we consider another interesting idea of performing non-dominated sorting for many-objective optimization, called approximate non-dominated sorting. A-ENS was the first algorithm developed recently based on approximate non-dominated sorting for many-objective optimization [31].

The main difference between A-ENS and existing non-dominated sorting algorithms lies in the fact that, instead of identifying the accurate non-dominated sorting result for a given population in existing non-dominated sorting algorithms, A-ENS determines an approximate sorting result by performing at most three-objective comparisons for each pair of solutions. This means that the existing non-dominated sorting algorithms always find the same sorting result for a given population, and these algorithms distinguish themselves only in the computational efficiency. A-ENS obtains a sorting result different from that of the other non-dominated sorting algorithms due to the errors caused by approximate sorting. In the following, we empirically verify the efficiency of A-ENS and the influence on performance of MOEAs by embedding it into two MOEAs, KnEA and Two_Arch2, developed recently for solving MaOPs. All reported experimental results are obtained by averaging over 30 independent runs.

Table 7 presents the computational efficiency of A-ENS in KnEA and Two_Arch2 on DTLZ1–DTLZ7 [58] and WFG1–WFG9 [59] with 5 and 10 objectives, in comparison with the accurate non-dominated sorting algorithm T-ENS. The parameter settings of KnEA and Two_Arch2 are the same as recommended in [22, 60]. From the table, it can be seen clearly that A-ENS is more efficient than T-ENS in MOEAs for solving MaOPs. Compared to the accurate non-dominated sorting T-ENS, A-ENS consumes roughly 70% runtime of that of T-ENS in both KnEA and Two_Arch2 to solve DTLZ and WFG test problems with 5 and 10 objectives. It can also be found that the superiority of A-ENS over T-ENS in computational efficiency will be enhanced as the number of objectives increases to 10. The above results demonstrate the competitiveness of approximate non-dominated sorting in computational efficiency for handling many-objective optimization.

To evaluate the influence of A-ENS on performance of MOEAs, Tables 8, 9 present the hypervolume (HV) values obtained by KnEA and Two_Arch2 with A-ENS and accurate non-dominated sorting algorithm T-ENS on 5- and 10-objective DTLZ and WFG test problems. HV is a performance indicator to measure the quality of solution sets obtained by MOEAs in terms of both convergence and diversity [61]. The method for calculating HV value is the same to that adopted in [23]. The larger the value of HV, the better the solution set. From the tables, the following three results can be observed.

First, A-ENS can enhance the performance of both KnEA and Two_Arch2 in solving most 5- and 10-objective DTLZ and WFG test problems without considerably deterioration on all test instances under consideration. For the 32 test instances, A-ENS achieves better HV values than accurate non-dominated sorting on 19 test instances in KnEA, and 24 instances in Two_Arch2. The enhanced performance of KnEA and Two_Arch2 may show that the errors introduced by approximate non-dominated sorting are helpful for MOEAs to improve the performance in solving MaOPs.

Second, compared to the performance on 5-objective MaOPs, the effectiveness of A-ENS is significantly enhanced on 10-objective MaOPs for both KnEA and Two_Arch2. A-ENS obtains better HV values on 8 out of 16 test instances with 5 objectives in KnEA and 9 instances in Two_Arch2. The numbers of A-ENS outperforming accurate non-dominated sorting increase to 11 in KnEA and 15 in Two_Arch2 on 16 test instances with 10 objectives. Third, A-ENS is more helpful for Two_Arch2 than KnEA in improving their performance to solve MaOPs. This implies that the idea of approximate non-dominated sorting deserves further investigation by developing MOEAs well suited for approximate non-dominated sorting as reported in [31].

From the above empirical results, we can conclude that approximate non-dominated sorting A-ENS is a promising idea to perform non-dominated sorting for many-objective optimization, which cannot only improve the computational efficiency, but also enhance the performance in quality of solution set, when it is adopted in MOEAs to solve MaOPs.