{'fraction_non_alphanumeric': 0.023054755043227664, 'fraction_numerical': 0.0, 'mean_word_length': 4.889830508474576, '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}}
Optimal One-Max Strategy with Dynamic Island Models

In this paper, we recall the dynamic island model concept, in order to dynamically select local search operators within a multi-operator genetic algorithm. We use a fully-connected island model, where each island is assigned to a local search operator. Selection of operators is simulated by migration steps, whose policies depend on a learning process. The efficiency of this approach is assessed in comparing, for the One-Max Problem, theoretical and ideal results to those obtained by the model. Experiments show that the model has the expected behavior and is able to regain the optimal local search strategy for this well-known problem.