Theory of parameter control for discrete black-box optimization: Provable performance gains through dynamic parameter choices
Parameter control is aimed at realizing performance gains through a dynamic choice of the
parameters which determine the behavior of the underlying optimization algorithm. In the …
parameters which determine the behavior of the underlying optimization algorithm. In the …
A new taxonomy of global optimization algorithms
Surrogate-based optimization, nature-inspired metaheuristics, and hybrid combinations
have become state of the art in algorithm design for solving real-world optimization …
have become state of the art in algorithm design for solving real-world optimization …
Probabilistic tools for the analysis of randomized optimization heuristics
B Doerr - … of evolutionary computation: Recent developments in …, 2020 - Springer
This chapter collects several probabilistic tools that have proven to be useful in the analysis
of randomized search heuristics. This includes classic material such as the Markov …
of randomized search heuristics. This includes classic material such as the Markov …
A proof that using crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
Evolutionary algorithms are popular algorithms for multiobjective optimisation (also called
Pareto optimisation) as they use a population to store trade-offs between different objectives …
Pareto optimisation) as they use a population to store trade-offs between different objectives …
Benchmarking discrete optimization heuristics with IOHprofiler
Automated benchmarking environments aim to support researchers in understanding how
different algorithms perform on different types of optimization problems. Such comparisons …
different algorithms perform on different types of optimization problems. Such comparisons …
Multi robot distance based formation using Parallel Genetic Algorithm
A López-González, JAM Campaña, EGH Martínez… - Applied Soft …, 2020 - Elsevier
In this paper an alternative method to achieve distance based formation is presented. The
method uses Genetic Algorithms to find a suitable solution based on angle and distance …
method uses Genetic Algorithms to find a suitable solution based on angle and distance …
Drift analysis
J Lengler - … of evolutionary computation: Recent developments in …, 2020 - Springer
Drift Analysis Page 1 Chapter 2 Drift Analysis Johannes Lengler Abstract Drift analysis is one
of the major tools for analysing evolutionary algorithms and nature-inspired search heuristics …
of the major tools for analysing evolutionary algorithms and nature-inspired search heuristics …
The (1+λ) evolutionary algorithm with self-adjusting mutation rate
We propose a new way to self-adjust the mutation rate in population-based evolutionary
algorithms. Roughly speaking, it consists of creating half the offspring with a mutation rate …
algorithms. Roughly speaking, it consists of creating half the offspring with a mutation rate …
Runtime analysis for self-adaptive mutation rates
We propose and analyze a self-adaptive version of the (1, λ) evolutionary algorithm in which
the current mutation rate is part of the individual and thus also subject to mutation. A rigorous …
the current mutation rate is part of the individual and thus also subject to mutation. A rigorous …
Analyzing randomized search heuristics via stochastic domination
B Doerr - Theoretical Computer Science, 2019 - Elsevier
Apart from few exceptions, the mathematical runtime analysis of evolutionary algorithms is
mostly concerned with expected runtimes, occasionally augmented by tail bounds. In this …
mostly concerned with expected runtimes, occasionally augmented by tail bounds. In this …