Theory of evolutionary computation. Recent developments in discrete optimization
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Analyzing evolutionary algorithms. The computer science perspective.
- scientific article; zbMATH DE number 1754585
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2065676
- Evolutionary optimization algorithms. Biologically inspired and population-based approaches to computer intelligence
Cited in
(78)- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- Does comma selection help to cope with local optima?
- Self-adjusting evolutionary algorithms for multimodal optimization
- Fast mutation in crossover-based algorithms
- Fixed-target runtime analysis
- The average distance and the diameter of dense random regular graphs
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- Exponential upper bounds for the runtime of randomized search heuristics
- A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes
- Runtime analysis of evolutionary algorithms via symmetry arguments
- Stagnation detection with randomized local search
- On negative dependence properties of Latin hypercube samples and scrambled nets
- Multiplicative up-drift
- The runtime of the compact genetic algorithm on jump functions
- Self-adjusting mutation rates with provably optimal success rules
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Runtime analysis for self-adaptive mutation rates
- A tight runtime analysis for the \((\mu + \lambda)\) EA
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
- Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Do additional target points speed up evolutionary algorithms?
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
- scientific article; zbMATH DE number 1754585 (Why is no real title available?)
- Mutation rate control in the \((1+\lambda)\) evolutionary algorithm with a self-adjusting lower bound
- The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
- scientific article; zbMATH DE number 7651160 (Why is no real title available?)
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Stagnation detection meets fast mutation
- Reversible random walks on dynamic graphs
- The design of (almost) disjunct matrices by evolutionary algorithms
- First Steps Towards a Runtime Analysis of Neuroevolution
- Runtime Analysis of a Co-Evolutionary Algorithm
- OneMax is not the easiest function for fitness improvements
- The cost of randomness in evolutionary algorithms: crossover can save random bits
- (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
- Bivariate estimation-of-distribution algorithms can find an exponential number of optima
- Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
- Lower bounds from fitness levels made easy
- Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution
- Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
- An extended jump functions benchmark for the analysis of randomized search heuristics
- Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
- Runtime analysis for permutation-based evolutionary algorithms
- Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
- Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
- Estimation-of-distribution algorithms for multi-valued decision variables
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- Nearest neighbor sampling of point sets using rays
- Parameter identification of multibody vehicle models using neural networks
- Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- Asynchronous opinion dynamics in social networks
- Stagnation detection in highly multimodal fitness landscapes
- Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions
- Runtime analysis of quality diversity algorithms
- Experimental and theoretical analysis of local search optimising OBDD variable orderings
- Quasi-majority functional voting on expander graphs
- A flexible evolutionary algorithm with dynamic mutation rate archive
- Chosen plaintext algebraic attacks on the ciphers from the Simon family
- Achieving tight \(O(4^k)\) runtime bounds on \(\textsc{Jump}_k\) by proving that genetic algorithms evolve near-maximal population diversity
- How fitness aggregation methods affect the performance of competitive CoEAs on bilinear problems
- Meta-learning of univariate estimation-of-distribution algorithms for pseudo-Boolean problems
- A runtime analysis of the multi-valued compact genetic algorithm on generalized \textsc{LeadingOnes}
- Analysis of the (1+1) EA on LeadingOnes with constraints
- ( + 1) vertex coloring in O(n) communication
- Fixed parameter multi-objective evolutionary algorithms for the W-separator problem
- The compact genetic algorithm struggles on cliff functions
- An analysis of load-balancing algorithms on edge-Markovian evolving graphs
- Tight runtime bounds for evolutionary algorithms on sorting and crossing minimisation for layered graph drawings
- A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial games
- Diversity-preserving exploitation of crossover
- A self-adjusting compact genetic algorithm
- Sharp Favard length of random Cantor sets
- Runtime analysis of evolutionary neural architecture search for binary classification
- Why dominance is not enough: lessons from practical evolutionary multi-objective algorithms
This page was built for publication: Theory of evolutionary computation. Recent developments in discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241813)
