{'fraction_non_alphanumeric': 0.015224358974358974, 'fraction_numerical': 0.0, 'mean_word_length': 5.71505376344086, '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}}
Research on Distribution Network Optimization using Improved Ant Colony Algorithm

The planning problem of electrical distribution, stated as a mixed, large scale and nonlinear optimization problem, is important in power planning. Ant colony algorithm as a new general-purpose meta-heuristic one has a good application to distribution network optimization. But the original ant colony algorithm has problems such as training inefficiency and easily falling into the local optimal minimum. To solve these problems, this paper presents improved ant colony optimization from transition probability and pheromone trail update mechanism. The transition probability control over two linkage parameters. The pheromone trail update mechanism design adaptive controls the relative importance of trail while the changes are increased. It realizes searching to the whole feasible region completely and easily falling into the local optimal minimum. This algorithm greatly improves the ability that search for the optimum result, and is favorably compared to other solution approaches such as genetic algorithms (GAs) and simulated annealing (SA) techniques. The application to the distribution network planning shows that this method is feasible and efficient