{'fraction_non_alphanumeric': 0.01791713325867861, 'fraction_numerical': 0.0, 'mean_word_length': 5.340425531914893, '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 Modification

Ant algorithm is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristic, like evolutionary methods, Ant algorithms often- show good optimization behavior but are slow when compared to classical heuristics. This problem happened due to the large number of control parameters used. Those parameters, that produce best performance, may be selected hand-tuned or using a systematic procedure. In this paper, we discuss how to evolve the ant algorithm by reducing the number of those parameters and improve their performance. This modification result in speeding up ant algorithm compared to classical one. A simple implementation of this approach tested on the traveling salesman problem (TSP) and many other problems. The results show that the modified ant algorithms have good performance compared to the original ant algorithm