Working principles of binary differential evolution

DOI10.1016/j.tcs.2019.08.025zbMath1436.68409arXiv1812.03513OpenAlexW2949361183MaRDI QIDQ2007720

Weijie Zheng, Benjamin Doerr

Publication date: 22 November 2019

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

Full work available at URL: https://arxiv.org/abs/1812.03513

zbMATH Keywords

differential evolutionrun-time analysisworking principles of evolutionary computing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The runtime of the compact genetic algorithm on jump functions

Cites Work

• Unnamed Item
• Robustness of populations in stochastic environments
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• From black-box complexity to designing new genetic algorithms
• Ranking-based black-box complexity
• Runtime analysis of the 1-ANT ant colony optimizer
• A rigorous analysis of the compact genetic algorithm for linear functions
• Runtime analysis of a simple ant colony optimization algorithm
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• On the analysis of the \((1+1)\) evolutionary algorithm
• An elementary analysis of the probability that a binomial random variable exceeds its expectation
• Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
• Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
• The query complexity of a permutation-based variant of mastermind
• Adaptive drift analysis
• Multiplicative drift analysis
• Performance analysis of randomised search heuristics operating with a fixed budget
• Analyzing randomized search heuristics via stochastic domination
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Tight lower bound on the probability of a binomial exceeding its expectation
• First steps to the runtime complexity analysis of ant colony optimization
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones
• Simple max-min ant systems and the optimization of linear pseudo-boolean functions
• Differential Evolution for Binary Encoding
• Drift analysis and average time complexity of evolutionary algorithms