{'fraction_non_alphanumeric': 0.01925254813137033, 'fraction_numerical': 0.0033975084937712344, 'mean_word_length': 5.405797101449275, '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}}
Improving the AC Transmission Expansion Planning by Using Initial Solutions Algorithms

Initial Solutions (IS) are decisive in meta-heuristics based optimization problems since they impact the performance of the optimization process. This research work proposes and compares some random and deterministic algorithms to create initial solutions based on existing expansion planning criteria to solve the AC Transmission Expansion Planning (TEP) problem. The TEP is formulated as a full non-convex optimization problem using the AC network representation. A local version of the Particle Swarm Optimization (LPSO) technique is employed to solve the TEP problem. The Garver 6-bus and IEEE 24-bus test systems are used to evaluate the IS algorithms performance. It is shown that these algorithms have great potential to improve the robustness and computational effort of meta-heuristics.