Full metadata record
DC FieldValueLanguage
dc.contributor.authorFriedrich, Tobiasde
dc.contributor.authorHoroba, Christiande
dc.contributor.authorNeumann, Frankde
dc.date.accessioned2009-05-12T16:02:08Z-
dc.date.available2009-05-12T16:02:08Z-
dc.date.issued2008-07de
dc.identifier.urihttp://hdl.handle.net/2003/26158-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-9030-
dc.description.abstractIt 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 in [Laumanns, Thiele, Zitzler, IEEE TEC 2004]. This mechanism tries to balance the number of off-spring 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. We also indicate drawbacks for the use of fairness by presenting instances, where the optimization process is slowed down drastically.en
dc.language.isoende
dc.relation.ispartofseriesReihe CI; 251-08de
dc.subject.ddc004de
dc.titleRuntime analyses for using fairness in evolutionary multi-objective optimizationen
dc.typeTextde
dc.type.publicationtypereportde
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
25108.pdfDNB312.58 kBAdobe PDFView/Open


This item is protected by original copyright



Items in Eldorado are protected by copyright, with all rights reserved, unless otherwise indicated.