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

Modeling and convergence analysis of distributed coevolutionary algorithms.

Raj Subbu1, Arthur C Sanderson

  • 1Electronics Agile Manufacturing Research Institute, Rensselaer Polytechnic Institute, Troy, NY 12180, USA. subbu@research.ge.com

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society
|September 21, 2004
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

Timing of surgery for complete proximal hamstring avulsion injuries: successful clinical outcomes at 6 weeks, 6 months, and after 6 months of injury.

The American journal of sports medicine·2014
Same author

Bladder cancer SNP panel predicts susceptibility and survival.

Human genetics·2009
See all related articles

This study introduces distributed coevolutionary algorithms for optimization, enabling faster convergence. These algorithms show promise for complex problems, especially in networked environments with communication delays.

Area of Science:

  • Optimization Algorithms
  • Distributed Computing
  • Computational Intelligence

Background:

  • Optimization problems often involve complex, high-dimensional search spaces.
  • Centralized evolutionary algorithms can face scalability challenges.
  • Distributed approaches offer potential for improved performance and scalability.

Purpose of the Study:

  • To develop a theoretical foundation for distributed coevolutionary algorithms.
  • To analyze the convergence properties of these algorithms.
  • To evaluate their performance in networked environments.

Main Methods:

  • Modeling distributed coevolutionary algorithms based on centralized evolutionary algorithms.
  • Analyzing convergence and convergence rates for objective functions.

Related Experiment Videos

  • Simulating performance in a distributed environment with communication delays.

    • Main Results:

    • Established a theoretical basis for distributed coevolutionary algorithms.
    • Demonstrated potential for geometrical convergence rates for certain objective functions.
    • Evaluated performance advantages in distributed settings with communication constraints.

    Conclusions:

    • Distributed coevolutionary algorithms provide a robust framework for optimization.
    • These algorithms offer performance benefits over centralized methods in networked systems.
    • Theoretical analysis supports their efficiency and convergence properties.