A Framework for an Optimization Process to Locate Electric Vehicle Charging Stations
Bibliographic record
Abstract
To reduce the huge amounts of harmful gases emitted from vehicles emissions and to improve the environmental conditions, countries need to start planning and encouraging the use of electric vehicles (EVs).However, before extensively using EVs, charging stations need to be planned to meet the changing needs of electric vehicles.These charging stations need to be placed at various locations so that they can serve the maximum number of EVs, without significant delays.In this paper, a procedure for optimizing the locations of EVs charging stations is presented.The proposed approach uses the simulation software DYNASMART to simulate different percentages of EVs under different traffic congestion levels.To be able simulate EVs in DYNASMART, two main components have to be coded in the software.First, a subroutine is added to simulate EVs (i.e., tracking the battery charge level).The second component considers the operations within the charging stations.Additionally, an optimization procedure is proposed to optimize the location of EVs charging stations.The problem considers predefined possible locations of the charging stations based on the electric grid system (m possible locations).The optimization procedure seeks to determine the best location for a set of (n) charging stations (n ≤ m).The objective function of this model includes two components, which are the waiting and traveling time to the charging station and it is subject to several constrain.
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.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.009 | 0.002 |
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".