Analyzing evolutionary algorithms. The computer science perspective.
From MaRDI portal
Publication:610284
DOI10.1007/978-3-642-17339-4zbMath1282.68008OpenAlexW2499441210MaRDI QIDQ610284
Publication date: 8 December 2010
Published in: Natural Computing Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17339-4
Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items (47)
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax ⋮ Towards a runtime comparison of natural and artificial evolution ⋮ On easiest functions for mutation operators in bio-inspired optimisation ⋮ Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Runtime analysis of non-elitist populations: from classical optimisation to partial information ⋮ 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 ⋮ Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem ⋮ Runtime analysis for self-adaptive mutation rates ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints ⋮ When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms ⋮ Design and analysis of different alternating variable searches for search-based software testing ⋮ Improved time complexity analysis of the simple genetic algorithm ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ First Steps Towards a Runtime Analysis of Neuroevolution ⋮ The cost of randomness in evolutionary algorithms: crossover can save random bits ⋮ Choosing the right algorithm with hints from complexity theory ⋮ 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 ⋮ Runtime analysis for permutation-based evolutionary algorithms ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations ⋮ On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms ⋮ On the convergence of biogeography-based optimization for binary problems ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Solving problems with unknown solution length at almost no extra cost ⋮ Sorting by swaps with noisy comparisons ⋮ Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints ⋮ Runtime analysis of evolutionary algorithms via symmetry arguments ⋮ Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change ⋮ Runtime analysis of ant colony optimization on dynamic shortest path problems ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ Running time analysis of the (1+1)-EA for robust linear optimization ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem ⋮ On the effectiveness of immune inspired mutation operators in some discrete optimization problems ⋮ Fitness levels with tail bounds for the analysis of randomized search heuristics
This page was built for publication: Analyzing evolutionary algorithms. The computer science perspective.
