Volt-VAR Control Through Joint Optimization of Capacitor Bank Switching, Renewable Energy, and Home Appliances
Bibliographic record
Abstract
Today, the evolution of smart grid, electric vehicles (EVs) with voltage to the grid mode, and deployment of renewable energy sources (RESs) are bringing revolutionary changes to the existing electrical grid. Volt-VAR optimization (VVO) is a well-studied problem, for bringing solutions to reduce the losses and demand along the distribution lines. The current VVO, however, does not acknowledge the role of elastic and inelastic loads, EVs, and RESs to reduce the reactive power losses and hence the cost of generation. We propose a mathematical model Volt-VAR and CVR optimization (VVCO)/optimal energy consumption model (OECM) to solve the VVO problem by considering load shifting, EV as the storage and carrier of the energy, and use of RES. The VVCO/OECM not only reduces the reactive load but also flatten the load curve to reduce the uncertainty in the generation and to decrease the cost. The system also considers the efficiency of the electrical equipment to enhance the lifetime of the devices. We develop a non-cooperative game to solve the VVCO/OECM problem. To evaluate the performance, we simulate the VVCO/OECM model and compare with the existing VVO solution. We found that our method took almost a constant time to produce a solution of VVO regardless of the size of the network. The proposed method also outperform the existing VVO solution by reducing the generation cost and flatten the load and minimizes the uncertainty in the power generation. Results have shown that exploiting RES will reduce the voltage drop through reducing the injection of reactive power to the system.
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.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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.003 | 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".