Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization

  • Authors:
  • Tobias Friedrich;Christian Horoba;Frank Neumann

  • Affiliations:
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany;Fakultät für Informatik, LS 2, TU Dortmund, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany

  • Venue:
  • Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is widely assumed that evolutionary algorithms for multi-objective optimization problems should use certain mechanisms to achieve a good spread over the Pareto front. In this paper, we examine such mechanisms from a theoretical point of view and analyze simple algorithms incorporating the concept of fairness introduced by Laumanns et al.[7]. This mechanism tries to balance the number of offspring of all individuals in the current population. We rigorously analyze the runtime behavior of different fairness mechanisms and present showcase examples to point out situations where the right mechanism can speed up the optimization process significantly.