Research on computationally optimized distribution network topology reconfiguration method combining Levy flight and electric eel foraging algorithm
Bibliographic record
Abstract
Energy level fluctuations in Distributed Generation (DG) systems and Electric Vehicles (EVs) sometimes exceed the carrying capacity of typical distribution network topologies, which may lead to inefficiencies and lack of reliability.Based on this, this paper introduces a new Levy flight-electric eel foraging optimization (LF-EEFO) method for adapting network topology reconfiguration for new power systems.The DG output power, EV charging power, distribution network loss power, and switch lifetime cost cost are taken as the objectives, and the tidal current, voltage, branch power, network topology, and switching action are set as the constraints, in order to construct a multi-objective optimization model for distribution network topology reconfiguration.In the optimization phase, a Levy flight strategy is used to optimize the local search capability of the EEFO algorithm to obtain the optimal solution of the multi-objective optimization model for distribution network topology reconfiguration.In order to ensure the efficiency of the LF-EFO algorithm in optimizing the distribution network topology reconstruction model, an IEEE-33 node test system was established for simulation analysis.The results show that this research can significantly reduce the operating cost and improve the operational reliability of distribution networks, while promoting the development of electric vehicles.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".