Fitness levels with tail bounds for the analysis of randomized search heuristics

DOI10.1016/j.ipl.2013.09.013zbMath1329.68281DBLPjournals/ipl/Witt14OpenAlexW2083026540WikidataQ57200587 ScholiaQ57200587MaRDI QIDQ2350596

Carsten Witt

Publication date: 25 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.09.013

zbMATH Keywords

randomized algorithmsrunning time analysisrandomized search heuristicstail boundsfitness-level method

Mathematics Subject Classification ID

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

Related Items (10)

Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ The impact of random initialization on the runtime of randomized search heuristics ⋮ MMAS versus population-based EA on a family of dynamic fitness functions ⋮ Fixed-target runtime analysis ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Analysis of speedups in parallel evolutionary algorithms and \((1 + \lambda)\) EAs for combinatorial optimization ⋮ Lower bounds from fitness levels made easy ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions

Cites Work

• The use of tail inequalities on the probable computational time of randomized search heuristics
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fitness levels with tail bounds for the analysis of randomized search heuristics