Making Hard(er) Benchmark Functions: Genetic Programming

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

TreeEvolver, a genetic programming algorithm, is used to make continuous mathematical functions that give rise to 3D landscapes. These are then empirically tested for hardness by a simple evolutionary algorithm, after which TreeEvolver mutates the functions in an effort to increase the hardness of the corresponding landscapes. Results are wildly diverse, but show that traditional continuous benchmark functions such as Branin, Easom and Martin-Gaddy might not be hard at all, and much harder objective landscapes exist.

Original languageEnglish
Title of host publicationProceedings of the 26th International Conference on Enterprise Information Systems
Subtitle of host publicationVolume 1: ICEIS
EditorsJoaquim Filipe, Michal Smialek, Alexander Brodsky, Slimane Hammoudi
PublisherScience and Technology Publications, Lda
Pages567-578
Number of pages12
Volume1
ISBN (Electronic)9789897586927
DOIs
Publication statusPublished - 2024
Event26th International Conference on Enterprise Information Systems, ICEIS 2024 - Angers, France
Duration: 28 Apr 202430 Apr 2024

Publication series

NameInternational Conference on Enterprise Information Systems, ICEIS - Proceedings
ISSN (Electronic)2184-4992

Conference

Conference26th International Conference on Enterprise Information Systems, ICEIS 2024
Country/TerritoryFrance
CityAngers
Period28/04/2430/04/24

Bibliographical note

Publisher Copyright:
Copyright © 2024 by SCITEPRESS – Science and Technology Publications, Lda.

Keywords

  • Evolutionary Algorithms
  • Fitness Landscapes
  • Genetic Programming

Fingerprint

Dive into the research topics of 'Making Hard(er) Benchmark Functions: Genetic Programming'. Together they form a unique fingerprint.

Cite this