{'fraction_non_alphanumeric': 0.011111111111111112, 'fraction_numerical': 0.0, 'mean_word_length': 5.352112676056338, '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}}
ANT ALGORITHM FOR SOLVING TRAVELLING SALESMAN PROBLEM

The paper provides a brief theoretical overview of existing approaches to solving travelling salesman problem. The software implementation of the problem solution using the ant algorithm is performed. The analysis of the time efficiency of the algorithm on different volumes of input data is carried out. Dependency graph is plotted. Further directions of studying this algorithm are determined.