Maximizing the Electricity Cost-Savings for Local Distribution System Using a New Peak-Shaving Approach Based on Mixed Integer Linear Programming
Bibliographic record
Abstract
The objective of this study is to perform peak load shaving at a virtual power plant (VPP) to maximize the electricity cost-saving for local distribution companies (LDCs) while satisfying the necessary operational constraints. It can be achieved by implementing an efficient algorithm to control the conservation voltage reduction technique (CVR) with embedded energy resources (EERs) to optimize electricity costs during peak hours. EERs consist of distributed energy resources (DERs) such as solar and diesel generators and energy storage systems (ESSs) such as utility-scale and residential batteries. An objective function of mixed integer linear programming is formulated as the electricity cost function. Different operational constraints of EERs are formulated to solve the peak shaving optimization problem. The proposed algorithm is tested using data from a real Australian power distribution network. This paper discusses four cases to demonstrate the performance and economic benefits of the control algorithm. Each of these cases illustrates how EERs contribute differently each year, month, and day. Results showed that the proposed algorithm offers significant cost savings and can shave up to three daily peaks.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".