Self-adaptation of Genetic Operators Through Genetic Programming Techniques

Here we propose an evolutionary algorithm that self modifies its operators at the same time that candidate solutions are evolved. This tackles convergence and lack of diversity issues, leading to better solutions. Operators are represented as trees and are evolved using genetic programming (GP) techniques. The proposed approach is tested with real benchmark functions and an analysis of operator evolution is provided.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2013

Modified Soft Brood Crossover in Genetic Programming

Premature convergence is one of the important issues while using Genetic...
research
10/09/2018

Positional Cartesian Genetic Programming

Cartesian Genetic Programming (CGP) has many modifications across a vari...
research
11/11/2018

Computational Complexity Analysis of Genetic Programming

Genetic Programming (GP) is an evolutionary computation technique to sol...
research
05/03/2020

Obtaining Basic Algebra Formulas with Genetic Programming and Functional Rewriting

In this paper, we develop a set of genetic programming operators and an ...
research
01/20/2017

Using LLVM-based JIT Compilation in Genetic Programming

The paper describes an approach to implementing genetic programming, whi...
research
10/22/2018

Scaling Up Cartesian Genetic Programming through Preferential Selection of Larger Solutions

We demonstrate how efficiency of Cartesian Genetic Programming method ca...
research
10/02/2019

GP4P4: Enabling Self-Programming Networks

Recent advances in programmable switches have enabled network operators ...

Please sign up or login with your details

Forgot password? Click here to reset