# Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators

9 Apr 2020George T. HallPietro Simone OlivetoDirk Sudholt

Recently it has been proved that a simple algorithm configurator called ParamRLS can efficiently identify the optimal neighbourhood size to be used by stochastic local search to optimise two standard benchmark problem classes. In this paper we analyse the performance of algorithm configurators for tuning the more sophisticated global mutation operator used in standard evolutionary algorithms, which flips each of the $n$ bits independently with probability $\chi/n$ and the best value for $\chi$ has to be identified... (read more)

PDF Abstract

No code implementations yet. Submit your code now