{'fraction_non_alphanumeric': 0.015124555160142349, 'fraction_numerical': 0.0, 'mean_word_length': 5.4655172413793105, '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}}
THEORY OF GENETIC ALGORITHMS WITH α-SELECTION

Genetic algorithms are random heuristic search (RHS) algorithms for adaptive systems with a wide range of applications in search, optimisation, pattern recognition and machine learning as well as signal processing. Despite their widespread use a general theory is still lacking. A promising approach is offered by the dynamical system model which describes the stochastic trajectory of a population under the dynamics of a genetic algorithm with the help of an underlying deterministic heuristic function and its fixed points. However, even for the simple genetic algorithm (SGA) with fitnessproportional selection, crossover and mutation the determination of the population trajectory and the fixed points of the heuristic function is unfeasible for practical problem sizes. In order to simplify the mathematical analysis α-selection is introduced in this paper. Based on this strong selection scheme it is possible to derive the dynamical system model and the respective fixed points in closed form. In addition to the theoretical analysis experimental results are presented.