Optimal µ-Distributions for the Hypervolume Indicator for Problems with Linear Bi-objective Fronts: Exact and Exhaustive Results

To simultaneously optimize multiple objective functions, several evolutionary multiobjective optimization (EMO) algorithms have been proposed. Nowadays, often set quality indicators are used when comparing the performance of those algorithms or when selecting "good" solutions during the algorithm run. Hence, characterizing the solution sets that maximize a certain indicator is crucial--complying with the optimization goal of many indicator-based EMO algorithms. If these optimal solution sets are upper bounded in size, e.g., by the population size µ, we call them optimal µ-distributions. Recently, optimal µ-distributions for the well-known hypervolume indicator have been theoretically analyzed, in particular, for bi-objective problems with a linear Pareto front. Although the exact optimal µ-distributions have been characterized in this case, not all possible choices of the hypervolume's reference point have been investigated. In this paper, we revisit the previous results and rigorously characterize the optimal µ-distributions also for all other reference point choices. In this sense, our characterization is now exhaustive as the result holds for any linear Pareto front and for any choice of the reference point and the optimal µ-distributions turn out to be always unique in those cases. We also prove a tight lower bound (depending on µ) such that choosing the reference point above this bound ensures the extremes of the Pareto front to be always included in optimal µ-distributions.

[1]  Raymond Ros,et al.  Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup , 2009 .

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

[3]  Lothar Thiele,et al.  On Set-Based Multiobjective Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[4]  M. Fleischer,et al.  The Measure of Pareto Optima , 2003, EMO.

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

[6]  Anne Auger,et al.  Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences , 2009, GECCO.

[7]  L. Jain,et al.  Evolutionary multiobjective optimization : theoretical advances and applications , 2005 .

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

[9]  Frank Neumann,et al.  Multiplicative approximations and the hypervolume indicator , 2009, GECCO.

[10]  Mark Fleischer,et al.  The measure of pareto optima: Applications to multi-objective metaheuristics , 2003 .

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

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

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

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

[15]  Eckart Zitzler,et al.  Indicator-Based Selection in Multiobjective Search , 2004, PPSN.

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

[17]  Christian Blum,et al.  Hybrid Metaheuristics , 2010, Artificial Intelligence: Foundations, Theory, and Algorithms.

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

[19]  Nicola Beume,et al.  On the Complexity of Computing the Hypervolume Indicator , 2009, IEEE Transactions on Evolutionary Computation.

[20]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

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

[22]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

[23]  Stefan Roth,et al.  Covariance Matrix Adaptation for Multi-objective Optimization , 2007, Evolutionary Computation.

[24]  Tobias Friedrich,et al.  The maximum hypervolume set yields near-optimal approximation , 2010, GECCO '10.