{'fraction_non_alphanumeric': 0.020618556701030927, 'fraction_numerical': 0.0, 'mean_word_length': 5.166666666666667, '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 common interval guided ACO algorithm for permutation problems

Ant Colony Optimization (ACO) has been successfully applied to many combinatorial optimization problems. In this work we propose a new solution construction scheme for ACO. This scheme uses the common intervals of the current iteration's best solutions to guide the ants during solution construction. Firstly, we compared the performance of ACO and the proposed algorithm Common Interval ACO (CIACO). Secondly, we conducted an in-depth study for the CIACO algorithm to investigate the influence of the common interval guidance. For both experiments a large parameter space was used. The results show, that common intervals can be used to improve the solution quality in comparison to the standard ACO algorithm.