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

Optimum tracking with evolution strategies.

Dirk V Arnold1, Hans-Georg Beyer

  • 1Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia, Canada B3H 1W5. dirk@cs.dal.ca

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

Convergence Properties of the (<i>μ</i>/<i>μ<sub>I</sub></i>, <i>λ</i>)-ES on the Rastrigin Function.

Proceedings of the ... ACM SIGEVO Conference on Foundations of Genetic Algorithms. Workshop on Foundations of Genetic Algorithms·2024
Same author

Progress Rate Analysis of Evolution Strategies on the Rastrigin Function: First Results.

Parallel problem solving from nature : ... PPSN ... proceedings. International Conference on Parallel Problem Solving from Nature·2024
Same author

On a Population Sizing Model for Evolution Strategies Optimizing the Highly Multimodal Rastrigin Function.

Genetic and Evolutionary Computation Conference : [proceedings]. Genetic and Evolutionary Computation Conference·2024
Same author

Progress analysis of a multi-recombinative evolution strategy on the highly multimodal Rastrigin function.

Theoretical computer science·2024
Same author

Active Sets for Explicitly Constrained Evolutionary Optimization.

Evolutionary computation·2022
Same author

Errata: Convergence Analysis of Evolutionary Algorithms That Are Based on the Paradigm of Information Geometry.

Evolutionary computation·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 analyzes evolutionary algorithms for dynamic optimization. Cumulative step length adaptation performs suboptimally when the target moves linearly, unlike in random movement scenarios.

Area of Science:

  • Computational Intelligence
  • Optimization Theory
  • Evolutionary Computation

Background:

  • Dynamic optimization problems (DOPs) require algorithms that adapt to changing objectives.
  • Evolutionary algorithms (EAs) are often used for DOPs, but their performance depends on strategy parameters and operators.
  • Understanding EA behavior in simplified dynamic environments aids in designing better algorithms.

Purpose of the Study:

  • To investigate the tracking performance of a multiparent evolution strategy with cumulative step length adaptation.
  • To analyze the strategy's behavior in a specific dynamic environment: a linearly moving target.
  • To derive scaling laws for better understanding and prediction of the strategy's performance.

Main Methods:

  • Mathematical analysis of a multiparent evolution strategy.

Related Experiment Videos

  • Simulation in an idealized environment with a linearly moving target.
  • Derivation of scaling laws to describe strategy behavior.

    • Main Results:

    • Accurate scaling laws were derived, enhancing the understanding of the strategy's performance.
    • Cumulative step length adaptation was found to be suboptimal for linearly moving targets.
    • This contrasts with previous findings for randomly moving targets, where optimal step lengths were achieved.

    Conclusions:

    • Cumulative step length adaptation is not universally optimal for all types of target movement in dynamic optimization.
    • The findings suggest that specific parameter choices, like population size, may need re-evaluation for linear target movement.
    • Further research into EA parameter tuning for different dynamic environments is warranted.