Plateaus can be harder in multi-objective optimization

DOI10.1016/J.TCS.2009.06.020MaRDI QIDQ847662zbMATH OpenOpenAlexFDO

Authors Tobias Friedrich, Nils Hebbinghaus, F. Neumann

Publication date 19 February 2010

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

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

zbMATH Keywords

evolutionary algorithmsmulti-objective optimizationruntime analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Comparison of simple diversity mechanisms on plateau functions
• On non-elitist evolutionary algorithms optimizing fitness functions with a plateau
• Population size matters: rigorous runtime results for maximizing the hypervolume indicator
• Theoretical aspects of evolutionary multiobjective optimization
• scientific article; zbMATH DE number 1975094

Cites work

• Comparison of simple diversity mechanisms on plateau functions
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
• scientific article; zbMATH DE number 1962832 (Why is no real title available?)
• scientific article; zbMATH DE number 2046100 (Why is no real title available?)
• Minimum spanning trees made easier via multi-objective optimization
• Multi-objective optimization using evolutionary algorithms
• Multicriteria Optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• Random orders
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• STACS 2005
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(7)

• Comparison of simple diversity mechanisms on plateau functions
• Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization
• On non-elitist evolutionary algorithms optimizing fitness functions with a plateau
• Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front
• Fourier analysis meets runtime analysis: precise runtimes on plateaus
• Stochastic population update can provably be helpful in multi-objective evolutionary algorithms
• Convergence of set-based multi-objective optimization, indicators and deteriorative cycles

Describes a project that uses

Uses Software

• SPEA2

This page was built for publication: Plateaus can be harder in multi-objective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847662)