Evolutionary Algorithms (EA) are search methods working iteratively on a population of potential solutions that are randomly selected and modified. Genetic Programming (GP) is an EA that allows automatic search for programs, usually represented as syntax trees (TGP) or linear sequences (LGP). Two mechanisms perform the random variations needed...
-
November 19, 2004 (v1)PublicationUploaded on: February 28, 2023
-
2006 (v1)Conference paper
Initially, Artificial Evolution focuses on Evolutionary Algorithms handling solutions coded in fixed length structures. In this context, the role of crossover is clearly the mixing of information between solutions. The development of Evolutionary Algorithms operating on structures with variable length, of which genetic programming is one of the...
Uploaded on: February 28, 2023 -
2006 (v1)Conference paper
Most of the Evolutionary Algorithms handling variable-sized structures, like Genetic Programming, tend to produce too long solutions and the recombination operator used is often considered to be partly responsible of this phenomenon, called bloat. The Maximum Homologous Crossover (MHC) preserves similar structures from parents by aligning them...
Uploaded on: February 28, 2023 -
2000 (v1)Conference paper
International audience
Uploaded on: February 28, 2023 -
2003 (v1)Conference paper
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar structures from parents, by aligning them according to their homology, thanks to an algorithm used in Bio-Informatics. To highlight disruptive effects of crossover...
Uploaded on: February 28, 2023 -
April 13, 2007 (v1)Conference paper
This paper addresses the resolution, by Genetic Programming (GP) methods, of ambiguous inverse problems, where for a single input, many outputs can be expected. We propose two approaches to tackle this kind of many-to-one inversion problems, each of them based on the estimation, by a team of predictors, of a probability density of the expected...
Uploaded on: February 28, 2023 -
2005 (v1)Conference paper
Genetic Programming (GP) has been shown to be a good method of predicting functions that solve inverse problems. In this context, a solution given by GP generally consists of a sole predictor. In contrast, Stack-based GP systems manipulate structures containing several predictors, which can be considered as teams of predictors. Work in Machine...
Uploaded on: February 28, 2023 -
October 27, 2003 (v1)Conference paper
Although there are some real world applications where the use of variable length representation (VLR) in Evolutionary Algorithm is natural and suitable, an academic framework is lacking for such representations. In this work we propose a family of tunable fitness landscapes based on VLR of genotypes. The fitness landscapes we propose possess a...
Uploaded on: February 28, 2023