Continuous Long-Term Evolution of Genetic Programming

William B. Langdon, Wolfgang Banzhaf

Published: 2019, Last Modified: 28 Feb 2026ALIFE 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We evolve floating point Sextic polynomial populations of genetic programming binary trees for up to a million generations. Programs with almost 400 000 000 instructions are created by crossover. To support unbounded Long-Term Evolution Experiment LTEE GP we use both SIMD parallel AVX 512 bit instructions and 48 threads to yield performance of up to 149 billion GP operations per second, 149 giga GPops, on a single Intel Xeon Gold 6126 2.60 GHz server.
Loading