{'fraction_non_alphanumeric': 0.024033437826541274, 'fraction_numerical': 0.0020898641588296763, 'mean_word_length': 5.429530201342282, '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 three-stage optimization method for dynamic optimal power flow

A progressively optimizing strategy for solving large-scale optimization problems is proposed in this paper. Based on this strategy, a three-stage optimization method for dynamic optimal power flow (DOPF) is presented. In the method, security-constrained economic dispatch (SCED), OPF and DOPF models are solved successively and progressively. The SCED model here is formulated as a quadratically constrained quadratic programming model, and hence it is capable of considering the reactive power and transmission losses. By solving related SCED and OPF models, a high-quality initial solution can be rapidly obtained to significantly improve the computational efficiency for solving the DOPF model without loss of accuracy. Data from a realistic power system are used in case studies to demonstrate the effectiveness and efficiency (nearly 90% computation time saved) of the proposed method.