{'fraction_non_alphanumeric': 0.01744186046511628, 'fraction_numerical': 0.0, 'mean_word_length': 5.7795275590551185, '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}}
Comparison of evolutionary algorithms used to solve the optimization problem of information security of distributed systems

The article considers algorithms for determination of a model of selection of optimal information security strategy of the distributed system, taking into account the equivalence of means of protection. The analysis of the following algorithms for solving model is provided: the ant colony algorithm and the Holland's genetic algorithm, in which different laws of probability distribution of chromosomal mutations are used. In particular, we consider a normal, uniform, exponential distribution and the Poisson distribution. In addition, the Whitley's genetic algorithm and Eshelman's genetic algorithm are considered. A comparison of these algorithms on the criteria of search for an optimal solution and time expenditure is provided.