Scaling Up Cartesian Genetic Programming through Preferential Selection of Larger Solutions

by   Nicola Milano, et al.

We demonstrate how efficiency of Cartesian Genetic Programming method can be scaled up through the preferential selection of phenotypically larger solutions, i.e. through the preferential selection of larger solutions among equally good solutions. The advantage of the preferential selection of larger solutions is validated on the six, seven and eight-bit parity problems, on a dynamically varying problem involving the classification of binary patterns, and on the Paige regression problem. In all cases, the preferential selection of larger solutions provides an advantage in term of the performance of the evolved solutions and in term of speed, the number of evaluations required to evolve optimal or high-quality solutions. The advantage provided by the preferential selection of larger solutions can be further extended by self-adapting the mutation rate through the one-fifth success rule. Finally, for problems like the Paige regression in which neutrality plays a minor role, the advantage of the preferential selection of larger solutions can be extended by preferring larger solutions also among quasi-neutral alternative candidate solutions, i.e. solutions achieving slightly different performance.


Self-adaptation of Genetic Operators Through Genetic Programming Techniques

Here we propose an evolutionary algorithm that self modifies its operato...

Evolving Shepherding Behavior with Genetic Programming Algorithms

We apply genetic programming techniques to the `shepherding' problem, in...

All You Need Is Sex for Diversity

Maintaining genetic diversity as a means to avoid premature convergence ...

On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection

Genetic programming is a powerful heuristic search technique that is use...

Batch Tournament Selection for Genetic Programming

Lexicase selection achieves very good solution quality by introducing or...

Lexicase Selection at Scale

Lexicase selection is a semantic-aware parent selection method, which as...

Investment vs. reward in a competitive knapsack problem

Natural selection drives species to develop brains, with sizes that incr...

Please sign up or login with your details

Forgot password? Click here to reset