Drift analysis and average time complexity of evolutionary algorithms

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Artificial Intelligence

• Publication date

  2001-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0004-3702(01)00058-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Mean of the Second Largest Eigenvalue on the Convergence Rate of Genetic Algorithms

  2001cited by this paper
• Theory of Evolutionary Algorithms: A Bird's Eye View

  1999cited by this paper
• THE COMPUTATIONAL TIME OF GENETIC ALGORITHMS FOR FULLY DECEPTIVE PROBLEM

  1999cited by this paper
• Statistical Dynamics of the Royal Road Genetic Algorithm

  1999cited by this paper
• On the Convergence Rates of Genetic Algorithms

  1999cited by this paper
• A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs

  1998influential reference
• A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs

  1998cited by this paper
• Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon

  1998influential reference
• Genetic Algorithms + Data Structures = Evolution Programs

  1996cited by this paper
• How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time

  1996cited by this paper
• Evolution and optimum seeking

  1995cited by this paper
• An evolutionary approach to combinatorial optimization problems

  1994cited by this paper
• Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence

  1992cited by this paper
• System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling

  1991cited by this paper
• Genetic Algorithms in Search

  1989cited by this paper
• The time complexity of maximum matching by simulated annealing

  1988cited by this paper
• Genetic Algorithms in Search Optimization and Machine Learning

  1988cited by this paper
• Hitting-time and occupation-time bounds implied by drift analysis with applications

  1982influential reference
• Criteria for classifying general Markov chains

  1976cited by this paper
• Discrete Parameter Martingales

  1975cited by this paper
• Complexity of Computer Computations

  1972cited by this paper
• Reducibility Among Combinatorial Problems

  1972cited by this paper

• On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds

  2026cites this paper
• Task-free Adaptive Meta Black-box Optimization

  2026cites this paper
• Calibration and intelligent optimization for DEM numerical parameters in heterogeneous rock mass

  2025cites this paper
• Runtime Analysis in Non-Elitist Evolutionary Algorithms via Population Distribution

  2025cites this paper
• Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithms on Smooth Functions

  2025cites this paper
• Running-time Analysis of ($\mu+\lambda$) Evolutionary Combinatorial Optimization Based on Multiple-gain Estimation

  2025cites this paper
• Complex preference analysis: a score-based evaluation strategy for ranking and comparison of the evolutionary algorithms

  2025cites this paper
• Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithm on Stochastic Smooth Functions

  2025cites this paper
• Optimality Versus Generality: Performance Assessment of Meta-Heuristics in Educational Timetabling

  2025cites this paper
• Stable Convergence and Global Convergence of Evolutionary Computation and Their Mutual Exclusivity Proof

  2025cites this paper
• Estimation of Hitting Time by Hitting Probability for Elitist Evolutionary Algorithms

  2025cites this paper
• Convergence analysis for a class of continuous single-step meta-heuristic algorithms based on Harris chain

  2025cites this paper
• Estimate Hitting Time by Hitting Probability for Elitist Evolutionary Algorithms

  2025cites this paper
• Fairness Designs for Load Balancing Optimization in Satellite-Cell-Free Massive MIMO Systems

  2025cites this paper
• A Simple and Comprehensive Method Based on Measure Comparison for Global Convergence Analysis in Evolutionary Computation

  2025cites this paper
• Unlocking New Potentials in Evolutionary Computation with Complex Network Insights: A Brief Survey

  2025cites this paper
• Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution

  2025cites this paper
• A New Scope and Domain Measure Comparison Method for Global Convergence Analysis in Evolutionary Computation

  2025influential citation
• Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model

  2025cites this paper
• AI and Evolutionary Computation for Intelligent Aviation Health Monitoring

  2025cites this paper
• Overcoming Binary Adversarial Optimisation with Competitive Coevolution

  2024cites this paper
• Genetic algorithm-based selection of optimal Monte Carlo simulations

  2024cites this paper
• Parameterised approximation of the fixation probability of the dominant mutation in the multi-type Moran process

  2024cites this paper
• Hyper-Heuristics Can Profit From Global Variation Operators

  2024cites this paper
• Running-Time Analysis of Brain Storm Optimization Based on Average Gain Model

  2024cites this paper
• Artificial evolutionary intelligence (AEI): evolutionary computation evolves with large language models

  2024cites this paper
• Benchmarking Analysis of Evolutionary Neural Architecture Search

  2024cites this paper
• The Runtime of Randomized Local Search on the generalized Needle problem

  2024cites this paper
• Lot Sizing and Scheduling Problem in Distributed Heterogeneous Hybrid Flow Shop and Learning-Driven Iterated Local Search Algorithm

  2024cites this paper
• Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem

  2024cites this paper
• Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms

  2024cites this paper
• Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization

  2024cites this paper
• A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive

  2024cites this paper
• A First Step Towards Runtime Analysis of Evolutionary Neural Architecture Search

  2024cites this paper
• A TCPN Automatically Modeling Method for Java Parallel Programs Oriented to Performance Analysis

  2024cites this paper
• Evolutionary Computation: Theories, Techniques, and Applications

  2024cites this paper
• Enhanced swarm intelligence optimization: Inspired by cellular coordination in immune systems

  2024cites this paper
• The first hitting time analysis of evolutionary algorithms based on renewal process

  2024cites this paper
• Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network

  2024cites this paper
• Is CC-(1+1) EA More Efficient than (1+1) EA on Separable and Inseparable Problems?

  2023cites this paper
• Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms

  2023influential citation
• Evolutionary Algorithms for Parameter Optimization—Thirty Years Later

  2023cites this paper
• Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation

  2023cites this paper
• Fixation times on directed graphs

  2023cites this paper
• Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms

  2023cites this paper
• A Gentle Introduction to Theory (for Non-Theoreticians)

  2023cites this paper
• Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus

  2023cites this paper
• Runtime analysis of some hybrid algorithms

  2023cites this paper
• How Well Does the Metropolis Algorithm Cope With Local Optima?

  2023influential citation
• Runtime Analysis of the SMS-EMOA for Many-Objective Optimization

  2023cites this paper
• Fast Estimations of Hitting Time of Elitist Evolutionary Algorithms from Fitness Levels

  2023cites this paper
• On asymptotic convergence rate of random search

  2023cites this paper
• Runtime Analyses of Multi-Objective Evolutionary Algorithms in the Presence of Noise

  2023cites this paper
• Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax with General Weights

  2023cites this paper
• Run Time Analysis for Random Local Search on Generalized Majority Functions

  2022cites this paper
• Prasatul Matrix: A Direct Comparison Approach for Analyzing Evolutionary Optimization Algorithms

  2022cites this paper
• Towards Theoretically Grounded Evolutionary Learning

  2022cites this paper
• Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes

  2022cites this paper
• A Self-adaptive Neuroevolution Approach to Constructing Deep Neural Network Architectures Across Different Types

  2022cites this paper
• Analysis of the survival time of the SIS and SIRS process on stars and cliques

  2022cites this paper
• Runtime analysis of convex evolutionary search algorithm with standard crossover

  2022cites this paper
• Theoretical analysis of garden balsam optimization algorithm

  2022cites this paper
• Runtime Analysis for Permutation-based Evolutionary Algorithms

  2022cites this paper
• An adaptive registration algorithm for zebrafish larval brain images

  2022cites this paper
• A gentle introduction to theory (for non-theoreticians)

  2022cites this paper
• Invasion Dynamics in the Biased Voter Process

  2022cites this paper
• University of Birmingham Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys

  2021cites this paper
• Hyper heuristic particle swarm optimization method for medical images segmentation

  2021cites this paper
• Short-Term Hydrothermal Scheduling With Solar and Wind Farms Using Second-Order Cone Optimization With Chance-Box Constraints

  2021cites this paper
• Derivative-free reinforcement learning: a review

  2021cites this paper
• A gentle introduction to theory (for non-theoreticians)

  2021cites this paper
• Lower bounds from fitness levels made easy

  2021cites this paper
• Error analysis of elitist randomized search heuristics

  2021cites this paper
• Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys

  2021cites this paper
• Choosing the Right Algorithm With Hints From Complexity Theory

  2021cites this paper
• Runtime analysis of population-based evolutionary algorithms

  2021cites this paper
• A Comparative Study of Common Nature-Inspired Algorithms for Continuous Function Optimization

  2021cites this paper
• Materialized view selection applying differential evolution algorithm combined with ensembled constraint handling techniques

  2021cites this paper
• Global optimization with one-class classification-assisted selection

  2021cites this paper
• Understanding Computation Time: A Critical Discussion of Time as a Computational Performance Metric

  2021cites this paper
• Markov chain analysis of evolutionary algorithms on OneMax function - From coupon collector's problem to (1 + 1) EA

  2020cites this paper
• Fixed-Target Runtime Analysis ∗

  2020cites this paper
• Binary Relation Learning and Classifying for Preselection in Evolutionary Algorithms

  2020cites this paper
• Analysis of the performance of algorithm configurators for search heuristics with global mutation operators

  2020cites this paper
• Exponential Upper Bounds for the Runtime of Randomized Search Heuristics

  2020influential citation
• University of Birmingham Tail bounds on hitting times of randomized search heuristics using variable drift analysis

  2020cites this paper
• Fixed-Target Runtime Analysis

  2020cites this paper
• Solving feature selection problems by combining mutation and crossover operations with the monarch butterfly optimization algorithm

  2020cites this paper
• Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift

  2020cites this paper
• Boosting evolutionary optimization via fuzzy-classification-assisted selection

  2020cites this paper
• A Survey of Online Data-Driven Proactive 5G Network Optimisation Using Machine Learning

  2020cites this paper
• Solving the protein folding problem in hydrophobic-polar model using deep reinforcement learning

  2020cites this paper
• An empirical estimation for time and memory algorithm complexities: newly developed R package

  2020cites this paper
• How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics

  2020cites this paper
• Theory of Evolutionary Computation: Recent Developments in Discrete Optimization

  2020cites this paper
• Error Analysis of Elitist Random Search Heuristics.

  2020cites this paper
• Mixed-Framework-Based Energy Optimization of Chemi-Mechanical Pulping

  2020cites this paper
• A gentle introduction to theory (for non-theoreticians)

  2020cites this paper
• Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2020

  2020cites this paper
• First Steps Toward a Runtime Analysis When Starting With a Good Solution

  2020cites this paper