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

Schema theory for genetic programming with one-point crossover and point mutation.

R Poli1, W B Langdon

  • 1School of Computer Science, University of Birmingham, UK. R.Poli@cs.bham.ac.uk

Evolutionary Computation
|February 18, 1999
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

Rhodium nanoparticles stabilized by ferrocenyl-phosphine ligands: synthesis and catalytic styrene hydrogenation.

Dalton transactions (Cambridge, England : 2003)·2019
Same author

Enhanced recovery protocol in esophagectomy, is it really worth it? A cost analysis related to team experience and protocol compliance.

Diseases of the esophagus : official journal of the International Society for Diseases of the Esophagus·2018
Same author

Crosstalk Reduction in Epimysial EMG Recordings from Transhumeral Amputees with Principal Component Analysis.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2018
Same author

Genetically improved BarraCUDA.

BioData mining·2017
Same author

The practice of consultation psychiatry in Italy: A multi-centre study.

Journal of psychosomatic research·2017
Same author

Performance of genetic programming optimised Bowtie2 on genome comparison and analytic testing (GCAT) benchmarks.

BioData mining·2015
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 introduces a simpler schema definition for genetic programming (GP), enhancing the genetic schema theorem. The improved theorem better describes schema propagation in GP, aligning with genetic algorithms (GAs).

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Evolutionary Computation

Background:

  • The theory of schemata is crucial in genetic programming (GP) for understanding evolutionary processes.
  • Existing schema definitions in GP have limitations regarding their strengths and weaknesses.
  • The original schema concept in genetic algorithms (GAs) provides a foundational understanding.

Purpose of the Study:

  • To propose a simplified and more intuitive definition of schemata for GP.
  • To develop an improved schema theorem for GP that accurately models schema propagation.
  • To establish a theoretical link between schema evolution in GP and GAs.

Main Methods:

  • Reviewing existing results in GP schema theory.
  • Introducing a new, simpler schema definition for GP.

Related Experiment Videos

  • Implementing one-point crossover and point mutation operators.
  • Deriving a new schema theorem for GP based on the revised schema definition.

    • Main Results:

    • A novel, simpler schema definition for GP is presented, closely resembling the GA concept.
    • An improved schema theorem for GP is derived, detailing schema propagation across generations.
    • The new GP schema theorem is shown to be a natural counterpart to the GA schema theorem.
    • Asymptotic convergence of the GP schema theorem to the GA schema theorem is demonstrated.

    Conclusions:

    • The proposed simpler schema definition facilitates a more effective analysis of GP.
    • The improved schema theorem offers a clearer understanding of evolutionary dynamics in GP.
    • This work bridges theoretical understanding between GP and GAs, advancing evolutionary computation.
    • The findings pave the way for more efficient and predictable GP systems.