{'fraction_non_alphanumeric': 0.022935779816513763, 'fraction_numerical': 0.0, 'mean_word_length': 5.56390977443609, '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}}
An improved hybrid algorithm for traveling salesman problem

An improved artificial bee colony (ABC&VNS) to settle the traveling salesman problem (TSP) is described in this paper. This hybrid algorithm's principal character is to incorporate the solution construction mechanism of the artificial bee colony (ABC) with variable neighborhood search (VNS) to exploit the intrinsic structure of the solutions to acquire the high quality solution. Besides, three novel neighborhood structures are present, in which problem-specific knowledge is utilized respectively, to improve both the search efficiency and quality of VNS. Finally, the experiments for benchmark TSP instances are carried out to verify that the proposed algorithm is capable of maintaining high performance to solve the TSP, which is compared with the best existing approaches in the way of solution quality.