{'fraction_non_alphanumeric': 0.027522935779816515, 'fraction_numerical': 0.01310615989515072, 'mean_word_length': 4.576642335766423, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Maintaining the diversity of solutions by non-geometric binary crossover: a worst one-max solver competition case study

The worst one-max solver competition task in GECCO 2007 was to develop a one-max solver that can find the optimal solution of the 15-bit one-max problem as late as possible within 1000 generations. There are two conflicting issues in developing such a one-max solver. One is to slow down the evolution of solutions toward the optimal solution (i.e., not to find the optimal solution in early generations). The other is to find the optimal solution in a very late generation. In this paper, we examine the effect of using a non-geometric binary crossover operator through computational experiments on the worst one-max solver competition task.