New tight expression of network radiality constraints using constant commodity flow equipped with the parent–child supply chain
Bibliographic record
Abstract
Preserving radiality is essential in distribution networks and Microgrid (MG) formation to ensure cost efficiency, reliability, and resiliency. However, maintaining radiality poses significant challenges due to the complexity of large-scale networks. Most existing models rely on Mixed-Integer Linear Programming (MILP) formulations, which suffer from low tightness, limiting their optimality and scalability. This paper addresses these limitations by introducing highly compact and tight radiality constraints designed to enhance computational performance and accuracy in reconfiguration and MG formation problems. The proposed approach is built on the novel Parent–Child Supply Chain (PCSC) framework, which, combined with a Constant Commodity Flow (CCF) model, ensures binary-like behavior for radiality variables without enforcing integer constraints. This innovation reduces the complexity of the problem, requiring binary variables only for line-switching decisions. Implementations of the model demonstrate significant improvements in computational performance, achieving a reduction of up to 72.61% in solution time and 14.7% in error margin compared to conventional MILP formulations. Moreover, the high tightness of the proposed constraints enables the use of second-order conic programming for highly accurate Distribution Power Flow (DistFlow) modeling. This advancement empowers operators to make realistic and informed decisions. The findings highlight the model’s potential to transform industry practices by offering a robust and scalable solution for network reconfiguration and MG formation.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".