Increasing distributed generation hosting capacity in distribution systems via optimal coordination of electric vehicle aggregators
Bibliographic record
Abstract
Abstract This work presents a novel strategy, designed from the distribution system operator viewpoint, aimed at estimating the hosting capacity in electric distribution systems when controllable plug‐in electric vehicles are in place. The strategy seeks to determine the maximum wind‐based distributed generation penetration by coordinating, on a forecast basis, the dispatch of electric vehicle aggregators, the operation of voltage regulation devices, and the active and reactive distributed generation power injections. Different from previous works, the proposed approach leverages controllable features of electric vehicles taking into account technical electric vehicle characteristics, driving behaviour of electric vehicle owners, and electric vehicle energy requirements to accomplish their primary purpose. The presented strategy is formulated as a two‐stage stochastic mixed‐integer linear programming problem. The first stage maximises the distributed generation installed capacity, while the second stage minimises the energy losses during the planning horizon. Probability density functions are used to describe the uncertainties associated with renewable distributed generation, conventional demand, and electric vehicle driving patterns. Obtained results show that controlling the power dispatched to electric vehicle aggregators can increase the distributed generation hosting capacity by up to 15% (given a 40% electric vehicle penetration), when compared to an uncontrolled electric vehicle approach.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".