{'fraction_non_alphanumeric': 0.014340344168260038, 'fraction_numerical': 0.0009560229445506692, 'mean_word_length': 5.423312883435583, '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}}
Sensitivity-Based Security-Constrained OPF Market Clearing Model

This paper proposes a novel technique for representing system security constraints that properly include voltage stability limits in the operation of competitive electricity markets. The market-clearing algorithm is modeled as a voltage stability constrained optimal power flow (OPF) problem, while the distance to the closest critical power flow solution is represented by means of a loading parameter and evaluated using a continuation power flow (CPF) technique. Sensitivities obtained at the OPF step are used to estimate power directions for the CPF method, while the CPF analysis provides the loading parameter to be used in the OPF problem based on an N-1 contingency criterion. The OPF and the CPF steps are repeated until the maximum loading parameter is found, thus providing optimal solutions considering both proper market conditions and security margins. Two benchmark systems with both supply and demand bidding are used to illustrate and test the proposed technique