{'fraction_non_alphanumeric': 0.015350877192982455, 'fraction_numerical': 0.007675438596491228, 'mean_word_length': 5.384615384615385, '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 solution of unit commitment with transmission and voltage constraints by heuristic method and optimal power flow

In this paper, a heuristic algorithm combined with OPF is proposed for short-term unit commitment problem with transmission and voltage constraints. Being a very complicated combinatorial optimization problem, unit commitment is very difficult to solve, especially, for large-scale power system with network constraints. We have proposed a heuristic algorithm based on the average full load cost without network constraints. In this study, we propose a solution of unit commitment problem with network constraints using combination of heuristic algorithm and OPF. The proposed algorithm has been applied to the IEEE 118 test system with 36 generators over a 24-h period. The result shows that the proposed algorithm is capable of obtaining satisfactory schedules without any constraint violation.