Related Experiment Video
Updated: Aug 16, 2026

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
Published on: October 14, 2017
Evolving evolutionary algorithms using linear genetic programming
1Department of Computer Science, Babeş-Bolyai University, Kogalniceanu 1, Cluj-Napoca 3400, Romania. moltean@cs.ubbcluj.ro
Abstract:
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.
Related Concept Videos
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Genetic Drift
Evolutionary Relationships through Genome Comparisons
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Genetic Variation
Genes exist in different versions called alleles, which...
