Long-Term Evolution of Genetic Programming Populations

03/24/2017
by   W. B. Langdon, et al.
0

We evolve binary mux-6 trees for up to 100000 generations evolving some programs with more than a hundred million nodes. Our unbounded Long-Term Evolution Experiment LTEE GP appears not to evolve building blocks but does suggests a limit to bloat. We do see periods of tens even hundreds of generations where the population is 100 percent functionally converged. The distribution of tree sizes is not as predicted by theory.

READ FULL TEXT

page 1

page 13

research
02/25/2019

Faster Genetic Programming GPquick via multicore and Advanced Vector Extensions

We evolve floating point Sextic polynomial populations of genetic progra...
research
01/30/2019

Code Farming: A Process for Creating Generic Computational Building Blocks

Motivated by a desire to improve on the current state of the art in gene...
research
09/18/2019

Long-Term Progress and Behavior Complexification in Competitive Co-Evolution

The possibility to use competitive evolutionary algorithms to generate l...
research
12/01/2021

Evolving Open Complexity

Information theoretic analysis of large evolved programs produced by run...
research
01/13/2020

Fast Generation of Big Random Binary Trees

random_tree() is a linear time and space C++ implementation able to crea...
research
03/27/2018

Co-evolving Real-Time Strategy Game Micro

We investigate competitive co-evolution of unit micromanagement in real-...
research
08/08/2022

Origami-based Zygote structure enables pluripotent shape-transforming deployable structure

We propose an algorithmic framework of a pluripotent structure evolving ...

Please sign up or login with your details

Forgot password? Click here to reset