{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0110803324099723, 'mean_word_length': 5.3023255813953485, '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}}
Heuristic Determination of Distribution Trees

Electrical distribution networks develop configurations that deviate from the original long-term plan. The Distribution Trees Problem (DTP) is one means of measuring this development, which finds the deviation between long-term planning and the optimal topology for the actual conditions of the network. Each feasible solution corresponds to a set of directed out-trees rooted at the substations. DTP takes into account characteristics of the substations and consumer demand. It also determines the optimal topology of the network to distribute electrical energy at minimum cost. In this paper, we use two search techniques to solve this problem: 1) simulated annealing and 2) tabu search. Nine different problems within 500 to 30 000 consumer points and 20 substations were used to calibrate the parameters of both methods and to compare their efficiency. The numerical results indicate that the efficiency of simulated annealing decreases as the problem size increases, and that tabu search is more efficient than simulated annealing.