Convergence of set-based multi-objective optimization, indicators and deteriorative cycles

  • Authors:

  • Rudolf Berghammer;Tobias Friedrich;Frank Neumann

  • Affiliations:

  • Institut für Informatik, Christian-Albrechts-Universität zu Kiel, 24098 Kiel, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, 07743 Jena, Germany;School of Computer Science, The University of Adelaide, Adelaide, SA 5005, Australia

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2012

Quantified Score

Hi-index 5.23

Visualization

Abstract

Multi-objective optimization deals with the task of computing a set of solutions that represents possible trade-offs with respect to a given set of objective functions. Set-based approaches such as evolutionary algorithms are very popular for solving multi-objective optimization problems. Convergence of set-based approaches for multi-objective optimization is essential for their success. We take an order-theoretic view on the convergence of set-based multi-objective optimization and examine how the use of indicator functions can help to direct the search towards Pareto optimal sets. In doing so, we point out that set-based multi-objective optimization working on the dominance relation of search points has to deal with a cyclic behavior that may lead to worsening with respect to the Pareto-dominance relation defined on sets. Later on, we show in which situations well-known binary and unary indicators can help to avoid this cyclic behavior and therefore guarantee convergence of the algorithm. We also study the impact of deteriorative cycles on the runtime behavior and give an example in which they provably slow down the optimization process.