GECCO 2012 tutorial on evolutionary multiobjective optimization

Many optimization problems are multiobjective in nature in the sense that multiple, conflicting criteria need to be optimized simultaneously. Due to the conflict between objectives, usually, no single optimal solution exists. Instead, the optimum corresponds to a set of so-called Pareto-optimal solutions for which no other solution has better function values in all objectives. Evolutionary Multiobjective Optimization (EMO) algorithms are widely used in practice for solving multiobjective optimization problems due to several reasons. As randomized blackbox algorithms, EMO approaches allow to tackle problems with nonlinear, nondifferentiable, or noisy objective functions. As set-based algorithms, they allow to compute or approximate the full set of Pareto-optimal solutions in one algorithm run---opposed to classical solution-based techniques from the multicriteria decision making (MCDM) field. Using EMO approaches in practice has two other advantages: they allow to learn about a problem formulation, for example, by automatically revealing common design principles among (Pareto-optimal) solutions (innovization) and it has been shown that certain single-objective problems become easier to solve with randomized search heuristics if the problem is reformulated as a multiobjective one (multiobjectivization). This tutorial aims at giving a broad introduction to the EMO field and at presenting some of its recent research results in more detail. More specifically, we are going to (i) introduce the basic principles of EMO algorithms in comparison to classical solution-based approaches, (ii) show a few practical examples which motivate the use of EMO in terms of the mentioned innovization and multiobjectivization principles, and (iii) present a general overview of state-of-the-art algorithms and techniques. Moreover, we will present some of the most important research results in areas such as indicator-based EMO, preference articulation, and performance assessment. Though classified as introductory, this tutorial is intended for both novices and regular users of EMO. Those without any knowledge will learn about the foundations of multiobjective optimization and the basic working principles of state-of-the-art EMO algorithms. Open questions, presented throughout the tutorial, can serve for all participants as a starting point for future research and/or discussions during the conference.

[1]  R. Weiner Lecture Notes in Economics and Mathematical Systems , 1985 .

[2]  Kalyanmoy Deb,et al.  Integrating User Preferences into Evolutionary Multi-Objective Optimization , 2005 .

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

[4]  Subhash Suri,et al.  On Klee's measure problem for grounded boxes , 2012, SoCG '12.

[5]  Kalyanmoy Deb,et al.  Evolutionary multiobjective optimization , 2007, GECCO '07.

[6]  M. Jensen Helper-Objectives: Using Multi-Objective Evolutionary Algorithms for Single-Objective Optimisation , 2004 .

[7]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[8]  Frank Neumann,et al.  On the Effects of Adding Objectives to Plateau Functions , 2009, IEEE Transactions on Evolutionary Computation.

[9]  Marco Laumanns,et al.  Multiobjective Groundwater Management Using Evolutionary Algorithms , 2009, IEEE Transactions on Evolutionary Computation.

[10]  Eckart Zitzler,et al.  Pattern identification in pareto-set approximations , 2008, GECCO '08.

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

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

[13]  Aravind Srinivasan,et al.  Innovization: innovating design principles through optimization , 2006, GECCO.

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

[15]  Mikkel T. Jensen,et al.  Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation , 2004, J. Math. Model. Algorithms.

[16]  Carlos A. Coello Coello,et al.  Handling preferences in evolutionary multiobjective optimization: a survey , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

[18]  Eckart Zitzler,et al.  Module Identification from Heterogeneous Biological Data Using Multiobjective Evolutionary Algorithms , 2006, PPSN.

[19]  David Greiner,et al.  Improving Computational Mechanics Optimum Design Using Helper Objectives: An Application in Frame Bar Structures , 2007, EMO.

[20]  Paolo Serafini,et al.  Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .

[21]  B. Naujoks,et al.  Non‐monotonicity of Observed Hypervolume in 1‐Greedy S‐Metric Selection , 2013 .

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

[23]  Tobias Friedrich,et al.  Approximating the least hypervolume contributor: NP-hard in general, but fast in practice , 2008, Theor. Comput. Sci..

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

[25]  Daisuke Sasaki,et al.  Visualization and Data Mining of Pareto Solutions Using Self-Organizing Map , 2003, EMO.

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

[27]  Joshua D. Knowles,et al.  Investigations into the Effect of Multiobjectivization in Protein Structure Prediction , 2008, PPSN.

[28]  Carlos M. Fonseca,et al.  On the Computation of the Empirical Attainment Function , 2011, EMO.

[29]  Lothar Thiele,et al.  Chapter 4 – Design Space Exploration of Network Processor Architectures , 2003 .

[30]  Tobias Friedrich,et al.  Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice , 2009, EMO.

[31]  Sébastien Vérel,et al.  Set-based multiobjective fitness landscapes: a preliminary study , 2011, GECCO '11.

[32]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation , 1998, IEEE Trans. Syst. Man Cybern. Part A.

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

[34]  Christian Igel,et al.  Improved step size adaptation for the MO-CMA-ES , 2010, GECCO '10.

[35]  Kalyanmoy Deb,et al.  Light beam search based multi-objective optimization using evolutionary algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.

[36]  Anne Auger,et al.  Articulating user preferences in many-objective problems by sampling the weighted hypervolume , 2009, GECCO.

[37]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

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

[39]  Joshua D. Knowles,et al.  Multiobjectivization by Decomposition of Scalar Cost Functions , 2008, PPSN.

[40]  Tobias Friedrich,et al.  The logarithmic hypervolume indicator , 2011, FOGA '11.

[41]  Jürgen Branke,et al.  Consideration of Partial User Preferences in Evolutionary Multiobjective Optimization , 2008, Multiobjective Optimization.

[42]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[43]  Eckart Zitzler,et al.  On Using Populations of Sets in Multiobjective Optimization , 2009, EMO.