Service Restoration through Coordinated Operation of Soft Open Points and Distributed Generation Units in Distribution Networks
Bibliographic record
Abstract
The Soft Open Point (SOP) is an emerging power electronics device in distribution networks to replace normally open points (NOPs). During faulty conditions, service restoration can be effectively conducted by coordinating SOPs and distributed generation (DG) units. In this paper, a novel two-stage service restoration method is proposed for a distribution network by coordinating multiple SOPs and DGs. In Stage 1, a dynamic load-shedding scheme is applied during a fault at the upstream grid or distribution substation of a distribution network, and power supply to priority loads is kept uninterrupted as much as possible with DGs. Considering the ramp rate constraints of controllable/dispatchable DGs (CDGs) in Stage 1, their active power generation is kept at the same set points as they were before the fault. In Stage 2, CDGs are dispatched to maximize restoration in the outage area. In both stages, active and reactive power of SOPs are regulated to maximize restoration. A mixedinteger nonlinear programming (MINLP) model is developed using AC power flow to formulate the proposed restoration method. The centralized (coordinated) and decentralized (uncoordinated) optimization of SOPs and DGs are conducted and compared to validate the proposed restoration method using the modified IEEE 33-node test system.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".