Articulating user preferences in many-objective problems by sampling the weighted hypervolume

The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical research topics can be emphasized with respect to hypervolume-based search: (i) the hypervolume indicator inherently introduces a specific preference and the question is how arbitrary user preferences can be incorporated; (ii) the exact calculation of the hypervolume indicator is expensive and efficient approaches to tackle many-objective problems are needed. In two previous studies, we addressed both issues independently: a study proposed the weighted hypervolume indicator with which user-defined preferences can be articulated; other studies exist that propose to estimate the hypervolume indicator by Monte-Carlo sampling. Here, we combine these two approaches for the first time and extend them, i.e., we present an approach of sampling the weighted hypervolume to incorporate user-defined preferences into the search for problems with many objectives. In particular, we propose weight distribution functions to stress extreme solutions and to define preferred regions of the objective space in terms of so-called preference points; sampling them allows to tackle problems with many objectives. Experiments on several test functions with up to 25 objectives show the usefulness of the approach in terms of decision making and search.

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

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

[3]  Tobias Friedrich,et al.  Approximating the volume of unions and intersections of high-dimensional geometric objects , 2008, Comput. Geom..

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

[5]  J. Branke,et al.  Guidance in evolutionary multi-objective optimization , 2001 .

[6]  L. Devroye Non-Uniform Random Variate Generation , 1986 .

[7]  W. Hoeffding Probability Inequalities for sums of Bounded Random Variables , 1963 .

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

[9]  H. Schwefel,et al.  Approximating the Pareto Set: Concepts, Diversity Issues, and Performance Assessment , 1999 .

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

[11]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

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

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

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

[15]  Kalyanmoy Deb,et al.  Reference point based multi-objective optimization using evolutionary algorithms , 2006, GECCO.

[16]  Matteo Nicolini,et al.  A Two-Level Evolutionary Approach to Multi-criterion Optimization of Water Supply Systems , 2005, EMO.

[17]  David J. Groggel,et al.  Practical Nonparametric Statistics , 2000, Technometrics.

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

[19]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

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

[21]  Luigi Barone,et al.  An evolution strategy with probabilistic mutation for multi-objective optimisation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[23]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[24]  R. Caflisch Monte Carlo and quasi-Monte Carlo methods , 1998, Acta Numerica.

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

[26]  Jonathan E. Fieldsend,et al.  Full Elite Sets for Multi-Objective Optimisation , 2002 .

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

[28]  Lily Rachmawati,et al.  Preference Incorporation in Multi-objective Evolutionary Algorithms: A Survey , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[29]  Lothar Thiele,et al.  SPAM: Set Preference Algorithm for Multiobjective Optimization , 2008, PPSN.