Transactive Demand Side Management Programs in Smart Grids with High Penetration of EVs
Bibliographic record
Abstract
Due to environmental concerns, economic issues, and emerging new loads, such as electrical vehicles (EVs), the importance of demand side management (DSM) programs has increased in recent years. DSM programs using a dynamic real-time pricing (RTP) method can help to adaptively control the electricity consumption. However, the existing RTP methods, particularly when they consider the EVs and the power system constraints, have many limitations, such as computational complexity and the need for centralized control. Therefore, a new transactive DSM program is proposed in this paper using an imperfect competition model with high EV penetration levels. In particular, a heuristic two-stage iterative method, considering the influence of decisions made independently by customers to minimize their own costs, is developed to find the market equilibrium quickly in a distributed manner. Simulations in the IEEE 37-bus system with 1141 customers and 670 EVs are performed to demonstrate the effectiveness of the proposed method. The results show that the proposed method can better manage the EVs and elastic appliances than the existing methods in terms of power constraints and cost. Also, the proposed method can solve the optimization problem quick enough to run in real-time.
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.000 |
| 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".