Evolving Evolutionary Algorithms using Linear Genetic Programming

08/21/2021
by   Mihai Oltean, et al.
0

A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem, and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.

READ FULL TEXT
research
10/10/2021

Evolving Evolutionary Algorithms with Patterns

A new model for evolving Evolutionary Algorithms (EAs) is proposed in th...
research
06/01/2011

Evolutionary Algorithms for Reinforcement Learning

There are two distinct approaches to solving reinforcement learning prob...
research
01/19/2021

A synthetic biology approach for the design of genetic algorithms with bacterial agents

Bacteria have been a source of inspiration for the design of evolutionar...
research
09/22/2020

Multi-threaded Memory Efficient Crossover in C++ for Generational Genetic Programming

C++ code snippets from a multi-core parallel memory-efficient crossover ...
research
04/05/2023

Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms

Problems with solutions represented by permutations are very prominent i...
research
02/19/2022

Simple Genetic Operators are Universal Approximators of Probability Distributions (and other Advantages of Expressive Encodings)

This paper characterizes the inherent power of evolutionary algorithms. ...
research
02/20/2004

A philosophical essay on life and its connections with genetic algorithms

This paper makes a number of connections between life and various facets...

Please sign up or login with your details

Forgot password? Click here to reset