Evolving Evolutionary Algorithms using Linear Genetic Programming
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.
Code (0)
등록된 구현이 없습니다.
Tasks
BenchmarkingEvolutionary AlgorithmsTraveling Salesman ProblemSimilar Papers 제목 키워드 기반
A Systematic Study on the Design of Odd-Sized Highly Nonlinear Boolean Functions via Evolutionary Algorithms
This paper focuses on the problem of evolving Boolean functions of odd sizes with high nonlinearity, a property of cryptographic relevance. Despite its simple formulation, this problem turns out to be remarkably difficul…
Evolutionary AlgorithmsEvolving Evolutionary Algorithms with Patterns
A new model for evolving Evolutionary Algorithms (EAs) is proposed in this paper. The model is based on the Multi Expression Programming (MEP) technique. Each MEP chromosome encodes an evolutionary pattern that is repeat…
BenchmarkingEvolutionary AlgorithmsEvolving Benchmark Functions to Compare Evolutionary Algorithms via Genetic Programming
In this study, we use Genetic Programming (GP) to compose new optimization benchmark functions. Optimization benchmarks have the important role of showing the differences between evolutionary algorithms, making it possib…
Evolutionary AlgorithmsEvolving Code with A Large Language Model
Algorithms that use Large Language Models (LLMs) to evolve code arrived on the Genetic Programming (GP) scene very recently. We present LLM GP, a formalized LLM-based evolutionary algorithm designed to evolve code. Like …
Language ModelingLanguage ModellingLarge Language ModelmodelDevolutionary genetic algorithms with application to the minimum labeling Steiner tree problem
This paper characterizes and discusses devolutionary genetic algorithms and evaluates their performances in solving the minimum labeling Steiner tree (MLST) problem. We define devolutionary algorithms as the process of r…
Combinatorial OptimizationEvolutionary AlgorithmsSteiner Tree Problemvalid