Research on Fault Reconstruction Technology for Distribution Networks With a High Proportion of New Energy
Bibliographic record
Abstract
Traditional mineral energy sources can no longer meet the current human demand for electricity. Distributed power generation has been vigorously developed due to its advantages such as cleanliness, reliability, and cost-effectiveness. As the proportion of new energy in distribution networks continues to increase, the large-scale integration of distributed power into the distribution network makes load and power flow analysis more complex. At the same time, faults in distribution networks can have a significant impact on users' electricity consumption, and fault reconstruction technology for new energy distribution networks directly affects power supply reliability, making it one of the key research topics for power enterprises. This paper explores fault reconstruction technology for distribution networks with a high proportion of new energy. First, the output characteristics of distributed power sources were studied in depth, and a distributed power output model was built using MATLAB. Secondly, a comparative analysis of the advantages and disadvantages of genetic algorithms, differential evolution algorithms, and particle swarm algorithms was conducted, with a focus on genetic algorithms and simulation analysis of various algorithms. Finally, using the IEEE 33-bus distribution network as an example, the problem was solved using improved genetic algorithms and particle swarm algorithms. The analysis of calculation results shows that the improved genetic algorithm can better enhance the fault reconstruction performance of new energy distribution networks.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".