New optimal planning strategy for plug‐in electric vehicles charging stations in a coupled power and transportation network
Bibliographic record
Abstract
Abstract The use of plug‐in electric vehicles (PEV) and their developing technology can create new challenges to the smart power system. The type, method, and time of charging electric vehicles are also other issues. Allocating and determining the optimal capacity of electric vehicle charging stations (EVCS) is related to the technical requirements of the distribution network. This is economically important for the construction of charging stations. This paper proposes a new approach for optimal siting and sizing of PEV charging stations in a coupled electrical and transportation network. This work presents the problem from a techno‐economic point of view of the electrical network as a multi‐objective problem with the objectives of simultaneously reducing the cost of building EVCSs and active power losses. The Pareto method is used to solve the problem and to display optimal points. In order to carry out the simulation, the proposed method is tested on a case study of the standard IEEE 37‐bus network with a 25‐node transport system and the proposed solution in the subject environment. The Floyd–Warshall method is utilized to determine the shortest travel routes for PEVs. The obtained results confirm the effectiveness of the optimal planning of PEV charging stations.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.004 | 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".