{'fraction_non_alphanumeric': 0.020253164556962026, 'fraction_numerical': 0.0, 'mean_word_length': 4.859259259259259, '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 approach to transmission network expansion planning

This paper proposes a new method for transmission network expansion planning in power systems. The proposed method is based on tabu search (TS) that is effective for solving a complicated combinatorial problem. However, TS is inclined to deteriorate the performance in handling a large scale problem. In this paper, parallel tabu search (PTS) is used to improve the performance of TS. PTS has a couple of strategies. One is to decompose the neighborhood of TS into subneighborhoods while the other is introduce the multiple tabu lengths into TS. The proposed method is successfully applied to sample systems. A comparison is made of SA, GA, TS and PTS to demonstrate the effectiveness of the proposed method.