Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/72059
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFriedrich, T.-
dc.contributor.authorHoroba, C.-
dc.contributor.authorNeumann, F.-
dc.date.issued2011-
dc.identifier.citationTheoretical Computer Science, 2011; 412(17):1546-1556-
dc.identifier.issn0304-3975-
dc.identifier.issn1879-2294-
dc.identifier.urihttp://hdl.handle.net/2440/72059-
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. 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 illustrative 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. © 2010 Elsevier B.V. All rights reserved.-
dc.description.statementofresponsibilityTobias Friedrich, Christian Horoba and Frank Neumann-
dc.language.isoen-
dc.publisherElsevier Science BV-
dc.rights© 2010 Elsevier B.V. All rights reserved.-
dc.source.urihttp://dx.doi.org/10.1016/j.tcs.2010.09.023-
dc.titleIllustration of fairness in evolutionary multi-objective optimization-
dc.typeJournal article-
dc.identifier.doi10.1016/j.tcs.2010.09.023-
pubs.publication-statusPublished-
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]-
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.