Deployment and Operation of Battery Swapping Stations for Electric Two-Wheelers Based on Machine Learning
Bibliographic record
Abstract
Battery swapping stations effectively address the challenges of long charging times, lack of charging stations, and safety hazards for electric two-wheelers. With the rapid development of shared electric bicycles and takeaways, the scale of electric two-wheeler users is expanding while generating a huge demand for battery swapping. The research on the planning and operation of battery swapping stations (BSSs) for electric two-wheelers has yet to be widely discussed. This study developed a data-driven optimization model based on machine learning algorithms using Beijing’s battery swapping stations and point of interest (POI) dataset. First, through the spatial features of BSS analyzed by ArcGIS, we found that the coverage of BSSs was mainly concentrated within the fifth ring road, and the utilization rate was unbalanced. Then, on a 3000 m grid scale, a prediction model of BSS quantity with random forest, support vector regression, and gradient-boosting decision tree algorithm was built. The final stacking model was constructed by strengthening three single models with an accuracy of 86.21%. Compared with the original BSSs layout, the machine-learning algorithm proposed in this study can cover more factors and avoid the subjectivity of site selection. Finally, the queuing model for BSSs based on the Monte Carlo simulation was proposed. Through two scenarios, we found that the key parameters m (the number of charging slots) and λ (the user arrival rate) were influential to the outputs of service capability.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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".