Feasibility of Solar Grid-Based Industrial Virtual Power Plant for Optimal Energy Scheduling: A Case of Indian Power Sector
Bibliographic record
Abstract
The increased popularity of small-scale DER has replaced the well-established concept of conventional generating plants around the world. In the present energy scenario, a significant share of energy production now comes from the grid integrated DERs installed at various consumer premises. These DERs are being renewable-based generates only intermittent power, which in turn makes the scheduling of electrical dispatch a tough task. The Virtual Power Plant (VPP) is a potential solution to this challenge, which coordinates and aggregates the DERs generation into a single controllable profile. In this paper, a modified PSO-based multi-objective optimization is proposed for the VPP scheduling in distribution network applications such as energy cost minimization, peak shaving, and reliability improvement. For feasibility analysis of the VPP, a case study of state power utility is taken, which includes a 90 bus industrial feeder with grid integrated PVs as DER. The optimized results are computed in both grid-connected and autonomous mode reveal that the operating cost, peak demand, and EENS are declined by 31.70%, 23.59%, and 62.30% respectively. The overall results obtained are compared by the results obtained from other well-established optimization techniques and it is found that the proposed technique is comparatively more cost-effective than others.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".