{'fraction_non_alphanumeric': 0.01664025356576862, 'fraction_numerical': 0.0, 'mean_word_length': 5.718085106382978, '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}}
Multistage Distribution System Expansion Planning with many Alternatives of Conductors

Distribution system expansion planning models generally do not limit the number of conductors’ alternatives that can be used in planning, and Distribution Companies may be faced with a scenario of many alternatives as they expand their systems. However, Distribution Companies are interested in few stocking alternatives for the conductors that will be installed during the expansion. In this context, this paper proposed an algorithm based on Chu-Beasley’s genetic operators for selecting a reduced number of conductors’ alternatives and Branch & Cut to solve the distribution expansion planning problem. The algorithm uses genetic operators to create a set of conductors’ alternatives that are used in the distribution system expansion planning model. The mixed-integer planning model addresses the inclusion or replacement of substation, conductors, and transformers, and the inclusion or increase of substation capacity. Conductor alternatives are generated from the alternatives found in the literature. The results show that the proposed method is promising in the search for valid conductors’ alternatives to reduce the investment costs in the distribution expansion.