Optimizing linear functions with randomized search heuristics -- the robustness of mutation

DOI10.4230/LIPICS.STACS.2012.420MaRDI QIDQ2904781zbMATH OpenFDO

Authors Carsten Witt

Publication date 23 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2012.420

zbMATH Keywords

evolutionary algorithmslinear functionsrandomized search heuristicsrunning time analysis

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Recommendations

• Tight bounds on the optimization time of a randomized search heuristic on linear functions
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• Adaptive drift analysis
• Non-existence of linear universal drift functions
• The interplay of population size and mutation probability in the (1+ ) EA on OneMax

Cited in

(9)

• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• Performance analysis of randomised search heuristics operating with a fixed budget
• Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
• The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
• On easiest functions for mutation operators in bio-inspired optimisation
• Fixed Budget Performance of the (1+1) EA on Linear Functions
• Non-existence of linear universal drift functions
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Tight bounds on the optimization time of a randomized search heuristic on linear functions

This page was built for publication: Optimizing linear functions with randomized search heuristics -- the robustness of mutation

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