Demand-Aware Provisioning of Electric Vehicles Fast Charging Infrastructure
Bibliographic record
Abstract
The concept of smart city strives for greener technology to reduce carbon emission to ameliorate the global warming. Following this footprint, the transportation sector is experiencing a paradigm shift and the transition to electric vehicles (EVs) has prodigious plausibility in reducing carbon emission. However, the anticipated EV penetration is hindered by several challenges, among them are their shorter driving range, slower charging rate and the lack of ubiquitous availability of charging locations, which collectively contribute to range anxieties for EVs' drivers. Meanwhile, the expected immense EV load onto the power distribution network may degrade the voltage stability. To reduce the range anxiety, we present a two-stage solution to provision and dimension a DC fast charging station (CS) network for the anticipated energy demand and that minimizes the deployment cost while ensuring a certain quality of experience for charging e.g., acceptable waiting time and shorter travel distance to charge. This solution also maintains the voltage stability by considering the distribution grid capacity, determining transformers' rating to support peak demand of EV charging and adding a minimum number of voltage regulators based on the impact over the power distribution network. We propose, evaluate and compare two CS network expansion models to determine a cost-effective and adaptive CSs provisioning solution that can efficiently expand the CS network to accommodate future EV charging and conventional load demands. We also propose two heuristic methods and compare our solution with them. Finally, a custom built Python-based discrete event simulator is developed to test our outcomes.
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.000 | 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.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".