Neural-Network Security-Boundary Constrained Optimal Power Flow
Bibliographic record
Abstract
This paper proposes a new approach to model stability and security constraints in optimal power flow (OPF) problems based on a neural network (NN) representation of the system security boundary (SB). The novelty of this proposal is that a closed form, differentiable function derived from the system's SB is used to represent security constraints in an OPF model. The procedure involves two main steps: First, an NN representation of the SB is obtained based on back-propagation neural network (BPNN) training. Second, a differentiable mapping function extracted from the BPNN is used to directly incorporate this function as a constraint in the OPF model. This approach ensures that the operating points resulting from the OPF solution process are within a feasible and secure region, whose limits are better represented using the proposed technique compared to typical security-constrained OPF models. The effectiveness and feasibility of the proposed approach is demonstrated through the implementation, as well as testing and comparison using the IEEE two-area and 118-bus benchmark systems, of an optimal dispatch technique that guarantees system security in the context of competitive electricity markets.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".