Making Hard(Er) Bechmark Test Functions

Dante Niewenhuis, Daan van Den Berg

2022

Abstract

This paper is an exploration into the hardness and evolvability of default benchmark test functions. Some very well-known traditional two-dimensional continuous benchmark test functions are evolutionarily modified to challenge the performance of the plant propagation algorithm (PPA), a crossoverless evolutionary method. For each traditional benchmark function, only its scalar constant parameters are mutated, but the effect on PPA’s performance is nonetheless enormous, both measured in objective deficiency and in the success rate. Thereby, a traditional benchmark functions’ hardness can thereby indeed be evolutionarily increased, and an especially interesting observation is that the evolutionary processes seem to follow one of three specific patterns: global minimum narrowing, increase in ruggedness, or concave-to-convex inversion.

Download


Paper Citation


in Harvard Style

Niewenhuis D. and van Den Berg D. (2022). Making Hard(Er) Bechmark Test Functions. In Proceedings of the 14th International Joint Conference on Computational Intelligence - Volume 1: ECTA, ISBN 978-989-758-611-8, pages 29-38. DOI: 10.5220/0011405300003332


in Bibtex Style

@conference{ecta22,
author={Dante Niewenhuis and Daan van Den Berg},
title={Making Hard(Er) Bechmark Test Functions},
booktitle={Proceedings of the 14th International Joint Conference on Computational Intelligence - Volume 1: ECTA,},
year={2022},
pages={29-38},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011405300003332},
isbn={978-989-758-611-8},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 14th International Joint Conference on Computational Intelligence - Volume 1: ECTA,
TI - Making Hard(Er) Bechmark Test Functions
SN - 978-989-758-611-8
AU - Niewenhuis D.
AU - van Den Berg D.
PY - 2022
SP - 29
EP - 38
DO - 10.5220/0011405300003332