{'fraction_non_alphanumeric': 0.010332950631458095, 'fraction_numerical': 0.001148105625717566, 'mean_word_length': 5.411764705882353, '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}}
Transmission system expansion planning by simulated annealing

This paper presents a simulated annealing approach to the long term transmission expansion planning problem which is a hard, large scale combinatorial problem. The proposed approach has been compared with a more conventional optimization technique based on mathematical decomposition with a zero-one implicit enumeration procedure. Tests have been performed on three different systems. Two smaller systems for which optimal solutions are known have been used to tune the main parameters of the simulated annealing process. The simulated annealing method has then been applied to a larger example system for which no optimal solutions are known: as a result an entire family of interesting solutions have been obtained with costs about 7% less than the best solutions known for that particular example system.