{'fraction_non_alphanumeric': 0.013157894736842105, 'fraction_numerical': 0.0, 'mean_word_length': 4.805084745762712, '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}}
Analysis of ant colony algorithm for finding the optimal circuitous route in the communication network of power system

The communication network of power system is often damaged after a disaster. To solve this problem, this paper uses ant colony algorithm to find the optimal circuitous route. Simulation results show that the method is fast, which can accelerate the recovery of the communication network. Besides, this paper does some research on the dead end problem, and analyses relationship between degree of adjacency and ratio of coming to a dead end. The result shows that the efficiency of ant colony algorithm can be improved only if it tries to avoid coming to dead ends.