Evolving Benchmark Functions to Compare Evolutionary Algorithms via Genetic Programming

Yifan He, Claus Aranha
3/21/2024
cs.NEcs.AI

No official code found. Best implementation: Y1fanHE/cec2024 (0 stars, MIT, last commit 2024-10-21).

Abstract

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 possible for further analysis and comparisons. We show that the benchmarks generated by GP are able to differentiate algorithms better than human-made benchmark functions. The fitness measure of the GP is the Wasserstein distance of the solutions found by a pair of optimizers. Additionally, we use MAP-Elites to both enhance the search power of the GP and also illustrate how the difference between optimizers changes by various landscape features. Our approach provides a novel way to automate the design of benchmark functions and to compare evolutionary algorithms.

View on arXivView PDF

Code Implementations(1)

Y1fanHE/cec2024Community100%
MIT
00Mar 20, 20242 years agoMIT

Similar Papers

Cite this paper

@article{he2024evolving,
  title  = {Evolving Benchmark Functions to Compare Evolutionary Algorithms via Genetic Programming},
  author = {Yifan He and Claus Aranha},
  year   = {2024},
  eprint = {2403.14146},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.14146v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.14146.svg)](https://codeofpaper.com/paper/2403.14146)

Discussion