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

Speeding up evolutionary algorithms through asymmetric mutation operators.

Benjamin Doerr1, Nils Hebbinghaus, Frank Neumann

  • 1Max-Planck-Institut füur Informatik, Saarbrüucken, 66123, Germany.

Evolutionary Computation
|November 21, 2007
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

Autoantibodies to IL-1Ra and PGRN in severe COVID-19 are associated with inflammation-induced hyperphosphorylated antigen isoforms.

Nature communications·2026
Same author

Plasmacytic markers as immunotherapeutic targets for primary CD20-negative aggressive B-cell lymphomas.

British journal of haematology·2026
Same author

Reprogramming of stroma-derived chemokine networks drives the loss of tissue organization in nodal B cell lymphoma.

Nature cancer·2026
Same author

Impact of Perforin 1 A91V germ line background in patients with aggressive B-NHL treated with R-CHOP.

Blood advances·2026
Same author

Axicabtagene ciloleucel in combination with rituximab for refractory large B cell lymphoma: the phase 2, single-arm ZUMA-14 trial.

Nature cancer·2026
Same author

Impact of Perforin 1 A91V germ line background in patients with aggressive B-NHL treated with R-CHOP.

Blood advances·2025
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 theoretically examines how asymmetric mutation operators in evolutionary algorithms accelerate problem-solving. The research demonstrates these operators significantly reduce runtime, especially for the Eulerian cycle problem.

Area of Science:

  • Computer Science
  • Algorithm Analysis

Background:

  • Evolutionary algorithms (EAs) are powerful optimization tools.
  • Specific variation operators demonstrably impact EA performance.
  • Asymmetric operators are observed to be faster in practice.

Purpose of the Study:

  • To theoretically analyze the runtime behavior of evolutionary algorithms with asymmetric mutation operators.
  • To investigate the impact of asymmetric mutation on solving the Eulerian cycle problem.
  • To provide theoretical bounds and insights into performance improvements.

Main Methods:

  • Theoretical analysis of evolutionary algorithms.
  • Focus on asymmetric mutation operators.
  • Runtime analysis applied to the Eulerian cycle problem.

Related Experiment Videos

  • Derivation of upper and lower bounds for algorithm runtime.

    • Main Results:

    • Asymmetric mutation operators yield significantly smaller runtime bounds for the Eulerian cycle problem compared to general operators.
    • The structure of plateaus, a common challenge in EAs, is altered by asymmetric operators, facilitating faster improvements.
    • A lower bound for the general case indicates a linear speedup factor due to the asymmetric operator.

    Conclusions:

    • Asymmetric mutation operators offer a substantial theoretical advantage in evolutionary algorithm runtime.
    • The findings provide a theoretical basis for the practical success of certain variation operators in EAs.
    • This research contributes to a deeper understanding of EA optimization dynamics and operator design.