Energy-Efficient Optimal Scheduling of Renewable Energy Sources in Power Systems Using Genetic Algorithms and Support Vector Machines
Bibliographic record
Abstract
Abstract As global energy demand is on the rise and so is the need for sustainable solutions, it has become imperative for RES scheduling to ensure grid reliability, minimize operation costs, and de-fossilize sources. This paper proposes a combined hybrid approach in using genetic algorithm (GA) to bestow renewable energy forecasting and scheduling into power systems alongside Support Vector Machine (SVM). The GA seeks the optimum scheduling decisions based on total operational cost minimization, while SVM provides precise short-term predictions of RES generation using historical and real-time meteorological data. The integrated model thus facilitates dynamic adaptation to environmental variability and system changes, which enhance energy system responsiveness. Performance evaluation indicated that the model achieves 92% mean absolute percentage error (MAPE) forecasting accuracy, allows up to 25% reduction in total operational costs, and increases by 20% renewable energy integration. It also achieves economic dispatch performance at less than 5% from optimal benchmark models with an overall average system efficiency of 95%. All these findings prove the model's ability to better predictive accuracy, efficiency in decision-making, and energy-saving improvements in the management system. Solar irradiance and wind velocity data of the National Renewable Energy Laboratory (NREL) of Tamil Nadu, India, 2015–2022 (42,560 hourly samples) along with regional load demand and electricity prices were used to validate the model, as well as load demand in the region and electricity prices. The GA–SVM achieved 92% MAPE forecasting accuracy for combined solar and wind generation, 25% cost reduction, and 20% increase in renewable energy integration. In addition to technical benefits, the model has economic benefits of cutting down on fossil fuel costs, decreasing operating costs to utilities, and enhancing tariff competitiveness to end-users.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".