Integrating EV Charging Stations as Smart Loads for Demand Response Provisions in Distribution Systems
Bibliographic record
Abstract
This paper presents a mathematical model for representing the total charging load at an electric vehicle charging station (EVCS) in terms of controllable parameters; the load model developed using a queuing model followed by a neural network (NN). The queuing model constructs a data set of plug-in electric vehicle (PEV) charging parameters which are input to the NN to determine the controllable EVCS load model. The queuing model considers arrival of PEVs as a non-homogeneous Poisson process, while the service time is modeled considering detailed characteristics of battery. The smart EVCS load is a function of number of PEVs charging simultaneously, total charging current, arrival rate, and time; and various class of PEVs. The EVCS load is integrated within a distribution operations framework to determine the optimal operation and smart charging schedules of the EVCS. Objective functions from the perspective of the local distribution company and EVCS owner are considered for studies. A 69-bus distribution system with an EVCS at a specific bus, and smart load model is considered for the studies. The performance of a smart EVCS vis-à-vis an uncontrolled EVCS is examined to emphasize the demand response contributions of a smart EVCS and its integration into distribution operations.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".