Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front

The hypervolume and the inverted generational distance (IGD) have been frequently used for the comparison of evolutionary multiobjective optimization algorithms. For the hypervolume, the relation between the location of a reference point and the optimal distribution of solutions has been studied in the literature. However, such a relation has not been studied for the IGD whereas IGD-based comparison results depend on the specification of reference points. Our intention is to clearly demonstrate the dependency of IGD-based comparison results on reference point specification. First, we explain difficulties of fair comparison in the following two cases: one is the use of all nondominated solutions among obtained solutions by compared algorithms as reference points, and the other is the use of a small number of uniformly sampled reference points. Discussions on these two cases show the necessity of a large number of uniformly sampled reference points on the entire Pareto front. Then, we show a bias of the IGD with such a reference point set through computational experiments. It is shown that the IGD tends to favor a solution set with much smaller diversity than a fully expanded solution set over the entire Pareto front. Finally, we propose a new specification method where reference points are uniformly sampled not only from the Pareto front but also from outside the Pareto front.

[1]  Carlos A. Coello Coello,et al.  Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[2]  Shengxiang Yang,et al.  A Performance Comparison Indicator for Pareto Front Approximations in Many-Objective Optimization , 2015, GECCO.

[3]  Nicola Beume,et al.  SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..

[4]  Anne Auger,et al.  Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications , 2012, Theor. Comput. Sci..

[5]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[6]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[7]  Kaname Narukawa,et al.  A comparison of different algorithms for the calculation of dominated hypervolumes , 2013, GECCO '13.

[8]  Xin Yao,et al.  A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization , 2016, IEEE Transactions on Evolutionary Computation.

[9]  Ye Tian,et al.  A multi-objective evolutionary algorithm based on an enhanced inverted generational distance metric , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[10]  Luís M. S. Russo,et al.  Quick Hypervolume , 2012, IEEE Transactions on Evolutionary Computation.

[11]  R. Lyndon While,et al.  Improving and Extending the HV4D Algorithm for Calculating Hypervolume Exactly , 2016, Australasian Conference on Artificial Intelligence.

[12]  Lucas Bradstreet,et al.  A Fast Way of Calculating Exact Hypervolumes , 2012, IEEE Transactions on Evolutionary Computation.

[13]  Gary G. Yen,et al.  Many-Objective Evolutionary Algorithm: Objective Space Reduction and Diversity Improvement , 2016, IEEE Transactions on Evolutionary Computation.

[14]  Eckart Zitzler,et al.  HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization , 2011, Evolutionary Computation.

[15]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[16]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[17]  Hisao Ishibuchi,et al.  Pareto Fronts of Many-Objective Degenerate Test Problems , 2016, IEEE Transactions on Evolutionary Computation.

[18]  Carlos A. Coello Coello,et al.  IGD+-EMOA: A multi-objective evolutionary algorithm based on IGD+ , 2016, CEC.

[19]  Hisao Ishibuchi,et al.  Reference point specification in hypervolume calculation for fair comparison and efficient search , 2017, GECCO.

[20]  Hisao Ishibuchi,et al.  A Study on Performance Evaluation Ability of a Modified Inverted Generational Distance Indicator , 2015, GECCO.

[21]  Akira Oyama,et al.  On the fast hypervolume calculation method , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[22]  Lothar Thiele,et al.  The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration , 2007, EMO.

[23]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[24]  Xin Yao,et al.  Benchmark Functions for CEC ’ 2017 Competition on Evolutionary Many-Objective Optimization , 2017 .

[25]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[26]  Tapabrata Ray,et al.  A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[27]  Anne Auger,et al.  Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point , 2009, FOGA '09.

[28]  Hisao Ishibuchi,et al.  Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.

[29]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[30]  Gary G. Yen,et al.  Performance Metric Ensemble for Multiobjective Evolutionary Algorithms , 2014, IEEE Transactions on Evolutionary Computation.

[31]  Hisao Ishibuchi,et al.  Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes , 2017, IEEE Transactions on Evolutionary Computation.

[32]  Carlos A. Coello Coello,et al.  A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.

[33]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[34]  R. Lyndon While,et al.  A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.

[35]  Hisao Ishibuchi,et al.  Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems , 2017, FOGA '17.

[36]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[37]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[38]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[39]  Hisao Ishibuchi,et al.  How to compare many-objective algorithms under different settings of population and archive sizes , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[40]  Jie Zhang,et al.  Consistencies and Contradictions of Performance Metrics in Multiobjective Optimization , 2014, IEEE Transactions on Cybernetics.

[41]  Qingfu Zhang,et al.  An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition , 2015, IEEE Transactions on Evolutionary Computation.

[42]  Peter J. Fleming,et al.  Preference-inspired co-evolutionary algorithms using weight vectors , 2015, Eur. J. Oper. Res..

[43]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

[44]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

[45]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[46]  Kazuyuki Murase,et al.  Evolutionary Path Control Strategy for Solving Many-Objective Optimization Problem , 2015, IEEE Transactions on Cybernetics.

[47]  Wang Yu-ping,et al.  A new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization , 2015 .

[48]  Hisao Ishibuchi,et al.  Difficulties in specifying reference points to calculate the inverted generational distance for many-objective optimization problems , 2014, 2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM).

[49]  Hisao Ishibuchi,et al.  Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems , 2015, IEEE Transactions on Evolutionary Computation.