{'fraction_non_alphanumeric': 0.015315315315315315, 'fraction_numerical': 0.0, 'mean_word_length': 5.241573033707865, '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}}
A parallel tabu search based method for reconfigurations of distribution systems

This paper presents an efficient meta-heuristic method for reconfigurations of distribution systems. In this paper, parallel tabu search is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. The loss minimization problem is one of the most important problems to save the operational cost in distribution systems. As a result, more efficient approaches are required to handle a combinatorial problem. This paper focuses on tabu search (TS) that introduces the adaptive memory called tabu list into the hill-climbing method of local search to escape from local minima. This paper proposes parallel tabu search to reduce computational effort and enhance solution accuracy. A couple of strategies are introduced into TS. One is to decompose the solution neighborhood of TS into the subneighborhood. The other is to consider different tabu lengths that make the solution more diverse. The proposed method is successfully applied to sample systems.