Evolving Benchmark Functions to Compare Evolutionary Algorithms via Genetic Programming
<|reference_start|>Evolving 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 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.<|reference_end|>
@article{he2024evolving,
    title={Evolving Benchmark Functions to Compare Evolutionary Algorithms via
  Genetic Programming},
    author={Yifan He and Claus Aranha},
    journal={arXiv preprint arXiv:2403.14146},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.14146},
    primaryClass={cs.NE cs.AI}
}