Improving the Search by Encoding Multiple Solutions in a Chromosome

10/13/2021
by   Mihai Oltean, et al.
0

We investigate the possibility of encoding multiple solutions of a problem in a single chromosome. The best solution encoded in an individual will represent (will provide the fitness of) that individual. In order to obtain some benefits the chromosome decoding process must have the same complexity as in the case of a single solution in a chromosome. Three Genetic Programming techniques are analyzed for this purpose: Multi Expression Programming, Linear Genetic Programming, and Infix Form Genetic Programming. Numerical experiments show that encoding multiple solutions in a chromosome greatly improves the search process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2021

Evolving Digital Circuits for the Knapsack Problem

Multi Expression Programming (MEP) is a Genetic Programming variant that...
research
04/06/2019

A Novel Continuous Representation of Genetic Programmings using Recurrent Neural Networks for Symbolic Regression

Neuro-encoded expression programming that aims to offer a novel continuo...
research
09/29/2021

Multi Expression Programming – an in-depth description

Multi Expression Programming (MEP) is a Genetic Programming variant that...
research
02/02/2022

Temporal Heterogeneity Improves Speed and Convergence in Genetic Algorithms

Genetic algorithms have been used in recent decades to solve a broad var...
research
02/08/2021

Neurogenetic Programming Framework for Explainable Reinforcement Learning

Automatic programming, the task of generating computer programs complian...
research
11/15/2022

Phenotype Search Trajectory Networks for Linear Genetic Programming

Genotype-to-phenotype mappings translate genotypic variations such as mu...
research
02/07/2017

Multitask Evolution with Cartesian Genetic Programming

We introduce a genetic programming method for solving multiple Boolean c...

Please sign up or login with your details

Forgot password? Click here to reset