Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Journal of Global Optimization
Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study
Proceedings of the Second European Workshop on Genetic Programming
General schema theory for genetic programming with subtree-swapping crossover: part I
Evolutionary Computation
AntTAG: a new method to compose computer programs using colonies of ants
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Random lines: a novel population set-based evolutionary global optimization algorithm
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
A continuous approach to geneticprogramming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
| Hi-index | 0.00 |
In recent years a new evolutionary algorithm for optimization in continuos spaces called Differential Evolution (DE) has developed. DE turns out to need only few evaluation steps to minimize a function. This makes it an interesting candidate for problem domains with high computational costs as for instance in the automatic generation of programs. In this paper a DE-based tree discovering algorithm called Tree based Differential Evolution (TreeDE) is presented. TreeDE maps full trees to vectors and represents discrete symbols by points in a real-valued vector space providing this way all arithmetical operations needed for the different DE schemes. Because TreeDE inherits the 'speed property' of DE, it needs only few evaluations to find suitable trees which produce comparable and better results as other methods.