Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
From MaRDI portal
Runtime analysis of the \((1+1)\) evolutionary algorithm on strings over finite alphabets
Recommendations
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
- On the analysis of the \((1+1)\) evolutionary algorithm
- Multiplicative drift analysis
- On the expected runtime and the success probability of evolutionary algorithms (Invited presentation)
- Drift analysis and evolutionary algorithms revisited
Cited in
(6)- Static and self-adjusting mutation strengths for multi-valued decision variables
- Extending selection learning toward fixed-length d-ary strings
- Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem
- Estimation-of-distribution algorithms for multi-valued decision variables
- Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space
- Runtime analysis of the (1+1) EA on computing unique input output sequences
This page was built for publication: Runtime analysis of the \((1+1)\) evolutionary algorithm on strings over finite alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276091)