Discovering Electric Vehicle Charging Locations Based on Clustering Techniques Applied to Vehicular Mobility Datasets
Bibliographic record
Abstract
With the proliferation of vehicular mobility traces because of inexpensive on-board sensors and smartphones, utilizing them to further understand road movements have become easily accessible. These huge numbers of vehicular traces can be utilized to determine where to enhance road infrastructures such as the deployment of electric vehicle (EV) charging stations. As more EVs are plying today’s roads, the driving anxiety is minimized with the presence of sufficient charging stations. By correctly extracting the various transportation parameters from a given dataset, one can design an adequate and adaptive EV charging network that can provide comfort and convenience for the movement of people and goods from one point to another. In this study, we determined the possible EV charging station locations based on an urban city’s vehicular capacity distribution obtained from taxi and ride-hailing mobility GPS traces. To achieve this, we first transformed the dynamic vehicular environment based on vehicular capacity into its equivalent urban single snapshot. We then obtained the various traffic zone distributions by initially utilizing k-means clustering to allow flexibility in the total number of wanted traffic zones in each dataset. In each traffic zone, iterative clustering techniques employing Density-based Spatial Clustering of Applications with Noise (DBSCAN) or clustering by fast search and find of density peaks (CFS) revealed various area separation where EV chargers were needed. Finally, to find the exact location of the EV charging station, we last ran k-means to locate centroids, depending on the constraint on how many EV chargers were needed. Extensive simulations revealed the strengths and weaknesses of the clustering methods when applied to our datasets. We utilized the silhouette and Calinski–Harabasz indices to measure the validity of cluster formations. We also measured the inter-station distances to understand the closeness of the locations of EV chargers. Our study shows how CFS + k-means clustering techniques are able to pinpoint EV charger locations. However, when utilizing DBSCAN initially, the results did not present any notable outcome.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
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".