{'fraction_non_alphanumeric': 0.01001669449081803, 'fraction_numerical': 0.0, 'mean_word_length': 5.315789473684211, '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}}
Evolutionary Method for Solving the Traveling Salesman Problem

An evolutionary method for solving the traveling salesman problem in the field of pharmacy business by optimizing the work of the drug delivery device is proposed in this paper. Modifications of three methods of initialization of the initial population of the genetic algorithm are developed. The software based on the proposed evolutionary method is created. It allows changing the initial parameters of the genetic algorithm, observe the process of solving the salesman problem graphically, obtain a result in text and graphic forms.