How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison

The hypervolume indicator has frequently been used for comparing evolutionary multi-objective optimization (EMO) algorithms. A reference point is needed for hypervolume calculation. However, its specification has not been discussed in detail from a viewpoint of fair performance comparison. A slightly worse point than the nadir point is usually used for hypervolume calculation in the EMO community. In this paper, we propose a reference point specification method for fair performance comparison of EMO algorithms. First, we discuss the relation between the reference point specification and the optimal distribution of solutions for hypervolume maximization. It is demonstrated that the optimal distribution of solutions strongly depends on the location of the reference point when a multi-objective problem has an inverted triangular Pareto front. Next, we propose a reference point specification method based on theoretical discussions on the optimal distribution of solutions. The basic idea is to specify the reference point so that a set of well-distributed solutions over the entire linear Pareto front has a large hypervolume and all solutions in such a solution set have similar hypervolume contributions. Then, we examine whether the proposed method can appropriately specify the reference point through computational experiments on various test problems. Finally, we examine the usefulness of the proposed method in a hypervolume-based EMO algorithm. Our discussions and experimental results clearly show that a slightly worse point than the nadir point is not always appropriate for performance comparison of EMO algorithms.

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

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

[3]  Beatrice M. Ombuki-Berman,et al.  A Scalability Study of Many-Objective Optimization Algorithms , 2018, IEEE Transactions on Evolutionary Computation.

[4]  Carlos M. Fonseca,et al.  Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms , 2016, Evolutionary Computation.

[5]  Hisao Ishibuchi,et al.  Benchmarking Multi- and Many-Objective Evolutionary Algorithms Under Two Optimization Scenarios , 2017, IEEE Access.

[6]  Iryna Yevseyeva,et al.  On Reference Point Free Weighted Hypervolume Indicators based on Desirability Functions and their Probabilistic Interpretation , 2014 .

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

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

[9]  Bilel Derbel,et al.  Experiments on Greedy and Local Search Heuristics for ddimensional Hypervolume Subset Selection , 2016, GECCO.

[10]  Karl Bringmann,et al.  Two-dimensional subset selection for hypervolume and epsilon-indicator , 2014, GECCO.

[11]  Dimo Brockhoff,et al.  Optimal µ-Distributions for the Hypervolume Indicator for Problems with Linear Bi-objective Fronts: Exact and Exhaustive Results , 2010, SEAL.

[12]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  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.

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

[15]  Michael T. M. Emmerich,et al.  Cone-Based Hypervolume Indicators: Construction, Properties, and Efficient Computation , 2013, EMO.

[16]  Hisao Ishibuchi,et al.  Selecting a small number of non-dominated solutions to be presented to the decision maker , 2014, 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[17]  Hartmut Schmeck,et al.  A theoretical analysis of volume based Pareto front approximations , 2014, GECCO.

[18]  Joshua D. Knowles,et al.  Bounded archiving using the lebesgue measure , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[19]  Carlos M. Fonseca,et al.  Greedy Hypervolume Subset Selection in Low Dimensions , 2016, Evolutionary Computation.

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

[21]  Ye Tian,et al.  A Decision Variable Clustering-Based Evolutionary Algorithm for Large-Scale Many-Objective Optimization , 2018, IEEE Transactions on Evolutionary Computation.

[22]  Kaisa Miettinen,et al.  A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization , 2018, IEEE Transactions on Evolutionary Computation.

[23]  Nicola Beume,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Gradient-based / Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric , 2007 .

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

[25]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

[27]  Johannes Bader,et al.  Hypervolume-based search for multiobjective optimization: Theory and methods , 2010 .

[28]  Nicola Beume,et al.  Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization , 2007, EMO.

[29]  Kalyanmoy Deb,et al.  A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives , 2016, IEEE Transactions on Evolutionary Computation.

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

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

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

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

[34]  Frank Neumann,et al.  Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point , 2013, Evolutionary Computation.

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

[36]  Bo Zhang,et al.  Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers , 2016, IEEE Transactions on Evolutionary Computation.

[37]  Carlos M. Fonseca,et al.  Greedy Hypervolume Subset Selection in the Three-Objective Case , 2015, GECCO.

[38]  Hisao Ishibuchi,et al.  Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.

[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]  Hisao Ishibuchi,et al.  Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems , 2017, FOGA '17.

[41]  Nicola Beume,et al.  An EMO Algorithm Using the Hypervolume Measure as Selection Criterion , 2005, EMO.

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

[43]  Hiroyuki Sato,et al.  Inverted PBI in MOEA/D and its impact on the search performance on multi and many-objective optimization , 2014, GECCO.