Non-Redundant Transmission Constraints Discovery in Security-Constrained Unit Commitment
Bibliographic record
Abstract
Security-constrained unit commitment (SCUC) is core to operational planning and planning problems in power systems. The computational complexity of these problems has steadily increased over the past decade due to the growing size and complexity of power systems. The proliferation of renewable energy resources has also contributed to this complexity by increasing the number of generation scenarios that need to be considered. This paper presents a method for identifying nonredundant transmission line constraints in SCUC inspired by enhanced umbrella constraint discovery problem formulation. The SCUC problem is formulated using power transfer distribution factors (PTDFs) and line outage distribution factors (LODFs) in this paper, which are widely used in power systems. The proposed method iteratively identifies the transmission line constraints that contribute to form the vertices of the SCUC feasibility region. The SCUC solution remains unchanged by considering only the non-redundant transmission line constraints, which represent a small fraction of the total transmission line constraints in SCUC. The proposed method lends itself well to decomposition and parallel processing. Moreover, demand uncertainty can be incorporated into the problem formulation without adding significant computational complexity. The proposed method is applied to a three-bus test system, and IEEE 24-bus test system. The simulation results demonstrate the merits of the proposed method in identifying non-redundant transmission constraints in SCUC.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".