Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with Boolean inputs.

S Droste1, T Jansen, I Wegener

  • 1FB Informatik, Univ. Dortmund, Germany. droste@ls2.cs.uni-dortmund.de

Evolutionary Computation
|February 18, 1999
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Correction to: ARoCuS Web application promotes standardized treatment and documentation of rotator cuff tears.

Musculoskeletal surgery·2021
Same author

Stress modulation as a means to improve yeasts for lignocellulose bioconversion.

Applied microbiology and biotechnology·2021
Same author

[New onset obsessive compulsive disorder due to the COVID-19 pandemic, a case report].

Tijdschrift voor psychiatrie·2020
Same author

Managing COVID-19 within and across health systems: why we need performance intelligence to coordinate a global response.

Health research policy and systems·2020
Same author

Attitudes of Dutch intensive care unit clinicians towards oxygen therapy.

The Netherlands journal of medicine·2020
Same author

ARoCuS Web application promotes standardized treatment and documentation of rotator cuff tears.

Musculoskeletal surgery·2020
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

This study rigorously analyzes the (1 + 1) evolutionary algorithm for optimization problems. It proves the expected runtime for separable Boolean functions is theta(n ln n) using novel theoretical methods.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Optimization

Background:

  • Evolutionary algorithms (EAs) are effective heuristic randomized methods for diverse optimization tasks.
  • Previous analyses often lacked rigorous theoretical underpinnings for specific EA variants.

Purpose of the Study:

  • To provide a rigorous theoretical complexity analysis of the (1 + 1) evolutionary algorithm.
  • To investigate the impact of mutation rates and crossover operators on performance.

Main Methods:

  • Theoretical complexity analysis.
  • Analysis of separable functions with Boolean inputs.
  • Comparison of different mutation rates and investigation of crossover operator.

Main Results:

Related Experiment Videos

  • The expected run time of the (1 + 1) evolutionary algorithm for separable functions with n variables is theta(n ln n).
  • The study establishes rigorous proof methodologies for EA complexity.

Conclusions:

  • The theoretical analysis provides a robust understanding of the (1 + 1) EA's performance on specific problem classes.
  • The developed proof techniques advance the theoretical foundations of evolutionary computation.