Berghammer, R.Friedrich, T.Neumann, F.Pelikan, M.Branke, J.2011-08-292011-08-292010Proceedings of the 12th annual conference on Genetic and evolutionary computation (GECCO'10), held in Portland, Oregon, USA 2010: pp. 495-5029781450300728http://hdl.handle.net/2440/65689Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made explicit in a recent paper by Zitzler et al. [13]. We take an order-theoretic view on this task and examine how the use of indicator functions can help to direct the search towards Pareto optimal sets. Thereby, we point out that evolutionary algorithms for multi-objective optimization working on the dominance relation of search points have to deal with a cyclic behavior that may lead to worsenings with respect to the Pareto-dominance relation defined on sets. Later on, we point out in which situations well-known binary and unary indicators can help to avoid this cyclic behavior.enCopyright 2010 ACMMultiobjective OptimizationPerformance MeasuresHypervolume IndicatorCyclesConference paper002011056010.1145/1830483.18305742-s2.0-7795586687728815Neumann, F. [0000-0002-2721-3618]