Illustration of fairness in evolutionary multi-objective optimization

DOI10.1016/j.tcs.2010.09.023zbMath1211.90209OpenAlexW2003869546MaRDI QIDQ633692

Tobias Friedrich, Frank Neumann, Christian Thyssen

Publication date: 29 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.023

zbMATH Keywords

fairnessmulti-objective optimizationevolutionary algorithmstheoryrunning time analysis

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation ⋮ Runtime analysis of a multi-objective evolutionary algorithm for obtaining finite approximations of Pareto fronts

Uses Software

• SPEA2

Cites Work

• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• Minimum spanning trees made easier via multi-objective optimization
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• On the analysis of the \((1+1)\) evolutionary algorithm
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
• Theory of the hypervolume indicator
• Don't be greedy when calculating hypervolume contributions

This page was built for publication: Illustration of fairness in evolutionary multi-objective optimization