{'fraction_non_alphanumeric': 0.010089686098654708, 'fraction_numerical': 0.0, 'mean_word_length': 5.922480620155039, '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 Continuous Ant Colony Algorithm

The algorithm is introduced briefly.The principle of ant colony algorithm for continuous domains based on mesh strategy which is proposed by Duan H B is discussed.Its main characteristics including their advantages and disadvantages are analyzed.The method for improving the ant colony algorithm is proposed.The basic idea is that the genetic algorithm with its properties of speediness,randomicity and global convergence are adopted to give information pheromone to distribute firstly,and then the ant algorithm with its properties of parallelization,positive feedback mechanism and high efficiency are adopted to enhance the efficiency under the condition of having some initial pheromone distribution.Experimental results show that the proposed ant colony algorithm is an effective algorithm with good time efficiency and optimizing efficiency.