Theory of Evolutionary Computation

DOI10.1007/978-3-030-29414-4zbMath1429.68004OpenAlexW4240139199MaRDI QIDQ5241813

No author found.

Publication date: 1 November 2019

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-29414-4

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ 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 “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Runtime analysis for self-adaptive mutation rates ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ Reversible random walks on dynamic graphs ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs ⋮ 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 ⋮ The average distance and the diameter of dense random regular graphs ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations ⋮ Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys ⋮ 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 ⋮ Stagnation detection meets fast mutation ⋮ Mutation Rate Control in the $$(1+\lambda )$$ Evolutionary Algorithm with a Self-adjusting Lower Bound

This page was built for publication: Theory of Evolutionary Computation