{'fraction_non_alphanumeric': 0.013513513513513514, 'fraction_numerical': 0.0, 'mean_word_length': 5.694915254237288, '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}}
Branch-and-bound dispatching for feeder capacitors on distribution system

A new branch-and-bound algorithm for the placed capacitors dispatch on a distribution feeder in daily system operation is presented in this paper. An efficient branching method based on the heap data structure and a simple intuitive bounding rule based on the forecast hourly loads are proposed to reach an optimum capacitor dispatching schedule and minimize the total feeder losses. The operation constraints, including bus voltage limits and maximum allowable number of switching operations for each switchable capacitor, have been taken into account to optimize the real-time scheduling problem under varying loading conditions. The feature of the devised solution algorithm is their numerically fast computation and mathematically justified optimality. To demonstrate the effectiveness of the proposed approach, capacitors dispatch on a distribution feeder of the Taiwan Power Company (TPC) is studied. Numerical computation gives satisfactory results and illustrates that the devised approach locates the optimum schedule in greater loss reduction and less computation time than many existing techniques.