{'fraction_non_alphanumeric': 0.012070566388115135, 'fraction_numerical': 0.0, 'mean_word_length': 5.613496932515337, '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}}
Dynamic Parameters Ant Colony Algorithm with Particle Swarm Characteristic

To improve the convergence time of Ant Colony Algorithm, avoid falling in local best and enhance the quality of solution, a novel dynamic parameters ant colony algorithm with particle swarm characteristics is proposed. Learning the multi-information instruction characteristic of Particle Swarm Optimization Algorithm, the global pheromone update rule with particle swarm characteristic is introduced to improve the directive function of pheromone and the speed of convergence. At the same time, solution multiplicity is guaranteed as far as possible. Using the function of current condition to update particle speed and position, parameters of Ant Colony Algorithm is used to reflect the current condition. Hyperbola Tangent function is imported to dynamic adjust parameters so that the relation between local search and global search could be balanced. Comparing with basic Ant Colony Algorithm, the simulation result on TSP shows that new algorithm has higher convergence speed and better solution.