{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0, 'mean_word_length': 5.260273972602739, '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 new ant colony optimization approach for the orienteering problem

In this paper, a novel ant colony optimization algorithm is proposed for the orienteering problem. This algorithm can adaptively choose the lower trail limit to avoid stagnation. To study its performance, we compare the proposed algorithm to max-min ant system with and without re-initialization. The experimental results demonstrate that the performance of our algorithm is competitive.