A continuous approach to geneticprogramming

Authors:
Cyril Fonlupt;Denis Robilliard
Affiliations:
LISIC, ULCO, Univ Lille Nord de France, Calais Cedex, France;LISIC, ULCO, Univ Lille Nord de France, Calais Cedex, France
Venue:
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Year:
2011

Citing 5
Cited 0

Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!

Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Is The Perfect The Enemy Of The Good?

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Linear Genetic Programming (Genetic and Evolutionary Computation)

Linear Genetic Programming (Genetic and Evolutionary Computation)
Tree Based Differential Evolution

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Differential Evolution (DE) is an evolutionary heuristic for continuous optimization problems. In DE, solutions are coded as vectors of floats that evolve by crossover with a combination of best and random individuals from the current generation. Experiments to apply DE to automatic programming were made recently by Veenhuis, coding full program trees as vectors of floats (Tree Based Differential Evolution or TreeDE). In this paper, we use DE to evolve linear sequences of imperative instructions, which we call Linear Differential Evolutionary Programming (LDEP). Unlike TreeDE, our heuristic provides constant management for regression problems and lessens the tree-depth constraint on the architecture of solutions. Comparisons with TreeDE and GP show that LDEP is appropriate to automatic programming.