Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/65689
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Set-based multi-objective optimization, indicators, and deteriorative cycles |
Author: | Berghammer, R. Friedrich, T. Neumann, F. |
Citation: | Proceedings of the 12th annual conference on Genetic and evolutionary computation (GECCO'10), held in Portland, Oregon, USA 2010: pp. 495-502 |
Publisher: | ACM Press |
Publisher Place: | New York |
Issue Date: | 2010 |
ISBN: | 9781450300728 |
Conference Name: | Genetic and Evolutionary Computation Conference (12th : 2010 : Portland, Oregon) |
Editor: | Pelikan, M. Branke, J. |
Statement of Responsibility: | Rudolf Berghammer, Tobias Friedrich and Frank Neumann |
Abstract: | Evolutionary 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. |
Keywords: | Multiobjective Optimization Performance Measures Hypervolume Indicator Cycles |
Rights: | Copyright 2010 ACM |
DOI: | 10.1145/1830483.1830574 |
Published version: | http://dx.doi.org/10.1145/1830483.1830574 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.