{'fraction_non_alphanumeric': 0.01761252446183953, 'fraction_numerical': 0.0, 'mean_word_length': 5.320987654320987, '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}}
A Single-parameter intelligent algorithm for the traveling salesman problem

In this paper, A Single-parameter intelligent algorithm is proposed for approximating a solution of the traveling salesman problem. The algorithm based on improving the Weighting Matrix, takes advantage of some ideas of genetic algorithm and ant colony algorithm. Several numerical tests from the library of TSPLIB are discussed. Results show that the Single-parameter intelligent algorithm can get a satisfied result in a short time.