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

Self-adaptive genetic algorithms with simulated binary crossover.

K Deb1, H G Beyer

  • 1Kanpur Genetic Algorithms Laboratory, Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208 016, India. deb@iitk.ac.in

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 author

Undergraduate Medical Student's Orientation on Patient's Right in Healthcare Services.

Mymensingh medical journal : MMJ·2026
Same author

Autopsy at Central Park Menagerie.

The Journal of comparative medicine and surgery·2022
Same author

The Relation of the Depressor Nerve to the Vasomotor Centre.

Journal. Boston Society of Medical Sciences·2009
Same author

THE VALUE TO PHYSIOLOGY OF ANTHROPOMETRIC TESTS AND MEASUREMENTS IN THE FORM OF STATISTICS AND THEIR IMPORTANCE TO EDUCATION.

Journal. Boston Society of Medical Sciences·2009
Same author

The further Differentiation of Flagellar and Somatic Agglutinins.

The Journal of medical research·2009
Same author

THE INFLUENCE OF EXERCISE ON GROWTH.

The Journal of experimental medicine·2009
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 demonstrates that real-parameter genetic algorithms (GAs) exhibit self-adaptation without mutation, similar to evolution strategies (ES). This finding highlights the potential for further research into self-adaptive GAs for function optimization.

Area of Science:

  • Computer Science, Artificial Intelligence
  • Computational Theory

Background:

  • Self-adaptation is crucial in natural evolution and has been studied in evolutionary computation, primarily within evolution strategies (ES) and evolutionary programming (EP).
  • Previous research has largely focused on ES and EP for self-adaptive function optimization, with less attention on genetic algorithms (GAs).

Purpose of the Study:

  • To demonstrate the self-adaptive capabilities of real-parameter genetic algorithms (GAs).
  • To explore the connection between self-adaptive ES and GAs employing a simulated binary crossover (SBX) operator.
  • To evaluate the performance of self-adaptive GAs on standard test problems used in ES research.

Main Methods:

  • Utilized a real-parameter genetic algorithm (GA) framework.
  • Employed a simulated binary crossover (SBX) operator as the primary mechanism for adaptation.

Related Experiment Videos

  • Did not incorporate any mutation operators to isolate the effect of SBX on self-adaptation.
  • Tested the algorithm on benchmark functions commonly used in evolution strategy (ES) literature.

    • Main Results:

    • Real-parameter genetic algorithms (GAs) with the SBX operator demonstrate significant self-adaptive behavior.
    • The study identified a remarkable similarity in the working principles between self-adaptive ES and GAs using SBX.
    • The self-adaptive GA performed effectively on various test problems, showcasing its optimization capabilities.

    Conclusions:

    • Real-parameter genetic algorithms (GAs) possess inherent self-adaptive features when utilizing the SBX operator, even without mutation.
    • The functional similarity between self-adaptive ES and SBX-based GAs suggests a unified understanding of self-adaptation in evolutionary computation.
    • Further investigation into self-adaptive GAs is warranted due to their demonstrated effectiveness and theoretical connections to established self-adaptive methods.