{'fraction_non_alphanumeric': 0.015132408575031526, 'fraction_numerical': 0.0, 'mean_word_length': 5.251968503937008, '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}}
An Experimental Study of the Genetic Algorithm Convergence

Genetic algorithm is a well-known heuristic search algorithm, typically used to generate valuable solutions to optimization and search problems. The most important operation in a genetic algorithm is crossover, as it has the greatest effect on its convergence rate. Therefore, in order to achieve the most optimal results in a reasonable time, one has to decide on the crossover type, as well as make a selection of a crossover point. In order to explore the effect of the crossover point selection methods on the convergence rate, we conducted experiments based on different crossover point selection criteria, whereby the results indicate the high importance of controlling the randomization of the crossover point selection range.