New encoding based on the minimum spanning tree for distribution feeder reconfiguration using a genetic algorithm
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Power distribution networks are typically structured in a radial topology with extra tie switches to allow for a manual reconfiguration in case of unexpected failure or scheduled maintenance. With the implementation of the smart grid, it is now realistic to also consider the power demand fluctuation and have real-time reconfiguration of the network to always operate in the optimal topology, minimizing distribution losses. In this paper, we propose the use of a genetic algorithm to find the optimal configuration of the network. The algorithm uses a unique solution encoding based on branch weights and computes the minimum spanning tree to decode the candidate solutions. This novel encoding ensures that the radial topology of the network is maintained without the need for complex operators resulting in an efficient and powerful solver. Finally, the solver is tested on distribution networks ranging from 16 to 4400 buses. The quality of the final solutions is equal or better, the maximum network size considered is much larger and the execution time is significantly shorter than that of state-of-the-art methods.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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 it