Skip to Main Content
When we evaluate the search performance of an evolutionary computation (EC) technique, we usually apply it to typical benchmark functions and evaluate its performance in comparison to other techniques. In experiments on limited benchmark functions, it can be difficult to understand the features of each technique. In this paper, the search spaces that emphasize the performance difference of EC techniques are evolved by Cartesian genetic programming. We focus on a real-coded genetic algorithm, which is a type of genetic algorithm that has a real-valued vector as a chromosome. In particular, we generate search spaces using the performance difference of real-coded crossovers. In the experiments, we evolve the search spaces using the combination of three types of real-coded crossovers. As a result of our experiments, the search spaces that exhibit the largest performance difference of two crossovers are generated for all the combinations.