(1+1) EA on Generalized Dynamic OneMax

article

A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive

scientific article published on 08 July 2024

A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization

scientific article published on 07 December 2016

A few ants are enough

article published in 2010

A method to derive fixed budget results from expected optimisation times

Analyses of simple hybrid algorithms for the vertex cover problem

scientific article published in January 2009

Analysis of an iterated local search algorithm for vertex cover in sparse random graphs

Analysis of different MMAS ACO algorithms on unimodal functions and plateaus

article

Analysis of diversity-preserving mechanisms for global exploration

scientific article published in January 2009

Ant Colony Optimization and the Minimum Spanning Tree Problem

Ant Colony Optimization and the minimum spanning tree problem

Approximating covering problems by randomized search heuristics using multi-objective models

scientific article published on 28 June 2010

Approximating covering problems by randomized search heuristics using multi-objective models

Bioinspired computation in combinatorial optimization

Bioinspired computation in combinatorial optimization

Bioinspired computation in combinatorial optimization

Black-Box Search by Unbiased Variation

Black-box search by unbiased variation

Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

Detecting structural breaks in time series via genetic algorithms

Domino convergence

Edge-Matching Problems with Rotations

Evolutionary algorithms for the detection of structural breaks in time series

Fitness levels with tail bounds for the analysis of randomized search heuristics

article

Greedy Local Search and Vertex Cover in Sparse Random Graphs

Guest Editorial: Theory of Evolutionary Computation

How Well Does the Metropolis Algorithm Cope With Local Optima?

scientific article published on 12 July 2023

Improved runtime analysis of the simple genetic algorithm

article

Improved time complexity analysis of the Simple Genetic Algorithm

article

Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax

MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions

MMAS vs. population-based EA on a family of dynamic fitness functions

article

Medium step sizes are harmful for the compact genetic algorithm

scholarly article published 2018

On improving approximate solutions by evolutionary algorithms

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

article by INGO WEGENER & Carsten Witt published January 2005 in Combinatorics, Probability and Computing

On the Utility of Island Models in Dynamic Optimization

On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions

On the analysis of the simple genetic algorithm

On the runtime analysis of the 1-ANT ACO algorithm

On the runtime analysis of the Simple Genetic Algorithm

article

Optimal Mutation Rates for the (1+ $$\lambda $$ λ ) EA on OneMax Through Asymptotically Tight Drift Analysis

Optimal Mutation Rates for the (1+λ) EA on OneMax

Population Size vs. Mutation Strength for the (1+λ) EA on OneMax

Population size versus runtime of a simple evolutionary algorithm

article by Carsten Witt published August 2008 in Theoretical Computer Science

Population size vs. runtime of a simple EA

Quasirandom evolutionary algorithms

scholarly article published 2010

Revised analysis of the (1+1) ea for the minimum spanning tree problem

Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search

Rigorous Runtime Analysis of Swarm Intelligence Algorithms – An Overview

scholarly article by Carsten Witt published 2009 in Studies in Computational Intelligence

Runtime Analysis of a Simple Ant Colony Optimization Algorithm

article

Runtime Analysis of a Simple Ant Colony Optimization Algorithm

article by Frank Neumann & Carsten Witt published 2006 in Lecture Notes in Computer Science

Runtime analysis for self-adaptive mutation rates

Runtime analysis of a binary particle swarm optimizer

Runtime analysis of ant colony optimization on dynamic shortest path problems

Runtime analysis of ant colony optimization on dynamic shortest path problems

Runtime analysis of the 1-ANT ant colony optimizer

Sharp bounds by probability-generating functions and variable drift

article

Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation

Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation

The (1+λ) evolutionary algorithm with self-adjusting mutation rate

The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization

The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization

scientific article published on 20 September 2017

The Interplay of Population Size and Mutation Probability in the ( $$1+\lambda $$ 1 + λ ) EA on OneMax

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

Theoretical analysis of fitness-proportional selection

article

Theoretical analysis of two ACO approaches for the traveling salesman problem

article

Theory of Randomized Search Heuristics

Theory of estimation-of-distribution algorithms

scholarly article published 2018

Theory of randomised search heuristics in combinatorial optimisation

Theory of randomized search heuristics in combinatorial optimization

Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

Update Strength in EDAs and ACO

article published in 2016

Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax

Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax

When do evolutionary algorithms optimize separable functions in parallel?

scholarly article published 2013

Why standard particle swarm optimisers elude a theoretical runtime analysis

article