A Comprehensive Review of Transmission and Distribution Optimal Power Flow Problems for the Integration of Distributed Energy Resources
Bibliographic record
Abstract
This paper presents a comprehensive review of coordination methods for addressing large-scale transmission and distribution optimal power flow (TDOPF) problems involving distributed energy resources. With distinct objectives, each transmission and distribution system operator (TSO/DSO) independently seeks to solve its own optimal power flow (OPF) instance. First, iterative methods are reviewed, in which the central OPF is solved recursively by decomposing the full problem into smaller, more manageable sub-problems or by replacing peripheral portions of the network within the central OPF with reduced equivalent grids. Generally, the convergence to an optimal solution of the full problem when all sub-OPFs are coordinated is not guaranteed as iterative methods repeat procedures until the changes in control variables of the central OPF are minimal. Second, sequential methods are reviewed, in which the central OPF is solved sequentially in a fixed, nonrepeating procedure by considering previous results. Achieving a fair balance between TSO and DSO interests in sequential methods might adversely affect the performance of a largescale central OPF. The advantages and the limitations of the two coordination methods are presented based on the operation mode of TSO-DSO network. Future research opportunities for coordination methods of TSO-DSO network are drawn using the Kron reduction method and mean-field games.
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.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
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".