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

Theoretical analysis of mutation-adaptive evolutionary algorithms.

A Agapie1

  • 1Laboratory of Computational Intelligence, Institute for Microtechnologies, Bucharest, P.O. Box 38-160, 72225, Romania. agapie@rdslink.ro

Evolutionary Computation
|May 31, 2001
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 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

Adaptive evolutionary algorithms need advanced modeling beyond current populations. This study introduces random systems with complete connections to analyze algorithm convergence, improving upon traditional methods for better evolutionary computation.

Area of Science:

  • Computer Science, Artificial Intelligence
  • Computational Theory

Background:

  • Adaptive evolutionary algorithms necessitate sophisticated modeling beyond static parameters.
  • Current adaptation rules often rely on limited historical data (e.g., success rates or convergence).

Purpose of the Study:

  • To introduce a novel modeling paradigm for adaptive evolutionary algorithms using random systems with complete connections.
  • To analyze the convergence properties of mutation-adaptive algorithms under this new framework.

Main Methods:

  • Utilizing random systems with complete connections to model algorithm history.
  • Analyzing the convergence of specific mutation-adaptive algorithms: binary genetic algorithm, 1/5 success rule evolution strategy, and (1+1) evolutionary algorithm (continuous and dynamic variants).

Related Experiment Videos

Main Results:

  • The study provides a theoretical framework for analyzing adaptive evolutionary algorithms with complete history.
  • Convergence analysis is performed for several key adaptive algorithms.

Conclusions:

  • Random systems with complete connections offer a more comprehensive approach to modeling adaptive evolutionary algorithms.
  • This paradigm shift enhances the understanding and analysis of algorithm convergence in evolutionary computation.