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 step forward in studying the compact genetic algorithm.

Reza Rastegar1, Arash Hariri

  • 1Department of Mathematics, Southern Illinois University, Carbondale, IL 62901, USA. rrastegar@ieee.org

Evolutionary Computation
|August 15, 2006
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

Extinction scenarios in evolutionary processes: a multinomial Wright-Fisher approach.

Journal of mathematical biology·2023
Same author

SHIFTING POWERS IN SPIVEY'S BELL NUMBER FORMULA.

Quaestiones mathematicae : journal of the South African Mathematical Society·2022
Same author

AVALANCHES IN A SHORT-MEMORY EXCITABLE NETWORK.

Advances in applied probability·2021
Same author

Horizontal visibility graph of a random restricted growth sequence.

Advances in applied mathematics·2021
Same author

Staircase patterns in words: subsequences, subwords, and separation number.

European journal of combinatorics = Journal europeen de combinatoire = Europaische Zeitschrift fur Kombinatorik·2020
Same author

Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations.

SIAM journal on discrete mathematics·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

The compact Genetic Algorithm (cGA), a memory-efficient optimization method, is proven to converge to local optima. This makes cGA suitable for applications with limited memory resources.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Optimization Algorithms

Background:

  • The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm.
  • cGA utilizes a probabilistic model for offspring generation, differing from traditional genetic operators.
  • Its low memory footprint makes it suitable for memory-constrained environments.

Purpose of the Study:

  • To establish a theoretical framework for analyzing the convergence properties of cGA.
  • To model cGA behavior using a Markov process and Ordinary Differential Equations (ODEs).
  • To demonstrate cGA's convergence to local optima.

Main Methods:

  • Modeling the compact Genetic Algorithm (cGA) as a Markov process.
  • Approximating cGA dynamics with an Ordinary Differential Equation (ODE).

Related Experiment Videos

  • Analyzing the convergence behavior of the derived ODE.

    • Main Results:

    • The study proves that the ODE model converges to local optima.
    • The analysis shows that the ODE model remains at local optima once reached.
    • Theoretical framework confirms cGA's convergence properties.

    Conclusions:

    • The compact Genetic Algorithm (cGA) is theoretically proven to converge to local optima.
    • cGA's convergence behavior is well-defined within the established Markov process and ODE framework.
    • The findings support the use of cGA in optimization tasks, especially in memory-limited scenarios.