Electricity load identification model construction and adjustable capacity optimization based on improved support vector machine algorithm
Bibliographic record
Abstract
As a small-scale power generation and distribution system, microgrid, by virtue of its high efficiency and clean power generation, has been taken by scholars around the world as a key research object for the sustainable development of national energy. Taking microgrid as the main research object, this paper explores the construction of power load identification model and optimization of scheduling capacity of microgrid. The improved Least Squares Support Vector Machine (LS-SVM) algorithm is used to construct the power load identification model, which realizes the accurate prediction of power load data. The optimal scheduling model of the microgrid is constructed based on the nonlinear planning method, and the co-evolutionary genetic algorithm (DCGA) with the improved difference strategy is used to solve and find the optimal model.The curve of the predicted value of the power load of the LS-SVM is basically fitted to the curve of the real value, and its prediction of the power load is more accurate than that of the BP neural network model. The daily running costs of the genetic algorithm, CCGA algorithm and DCGA algorithm are 1750.34 yuan, 1730.59 yuan and 1709.83 yuan, respectively. The daily running cost of the improved DCGA algorithm in this paper is 1763.59 yuan, which is reduced by 2.31% and 1.20% compared with the genetic algorithm and co-evolutionary genetic algorithm, respectively, and the DCGA algorithm has the fastest convergence speed, which indicates that it has the strongest ability to search for optimization, and it can effectively reduce the operating cost of microgrids, and it has a high practical value.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.002 | 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".