{'fraction_non_alphanumeric': 0.01943198804185351, 'fraction_numerical': 0.0, 'mean_word_length': 5.036036036036036, '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}}
A new artificial life algorithm to solve time-varying optimization problem

In the application of optimization problems, there are a lot of time-varying problems whose parameters are shifting with time. The standard evolutionary algorithms can't trace the leap of system peaks because of the loss of genotype diversity. In the model of artificial life, the system evolution is displayed through the interactions of individuals, and the loss of diversity can be avoided. A new evolutionary algorithm is designed by this principle. The species competition rule is applied to this algorithm to solve time-varying problem. The conclusion is proved by the experiment result.