Evolving Evolutionary Algorithms using Multi Expression Programming

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

Finding the optimal parameter setting (i.e. the optimal population size, the optimal mutation probability, the optimal evolutionary model etc) for an Evolutionary Algorithm (EA) is a difficult task. Instead of evolving only the parameters of the algorithm we will evolve an entire EA capable of solving a particular problem. For this purpose the Multi Expression Programming (MEP) technique is used. Each MEP chromosome will encode multiple EAs. An nongenerational EA for function optimization is evolved in this paper. Numerical experiments show the effectiveness of this approach.

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
09/08/2015

Evolving TSP heuristics using Multi Expression Programming

Multi Expression Programming (MEP) is an evolutionary technique that may...
research
08/21/2021

Evolving winning strategies for Nim-like games

An evolutionary approach for computing the winning strategy for Nim-like...
research
08/21/2021

Searching for a practical evidence of the No Free Lunch theorems

According to the No Free Lunch (NFL) theorems all black-box algorithms p...
research
06/13/2017

Investigating the Parameter Space of Evolutionary Algorithms

The practice of evolutionary algorithms involves the tuning of many para...
research
05/15/2020

Evolving Antennas for Ultra-High Energy Neutrino Detection

Evolutionary algorithms borrow from biology the concepts of mutation and...
research
09/11/2017

Evolution of Convolutional Highway Networks

Convolutional highways are deep networks based on multiple stacked convo...

Please sign up or login with your details

Forgot password? Click here to reset