IoV-Based Deployment and Scheduling of Charging Infrastructure in Intelligent Transportation Systems
Bibliographic record
Abstract
Internet of vehicles (IoV) is an emerging paradigm to exchange and analyze information collected from sensors using wireless technologies between vehicles and people, vehicles and infrastructure, and vehicles-to-vehicles. With the recent increase in the number of electric vehicles (EVs), the seamless integration of IoV in EVs and charging infrastructure can offer environmentally sustainable and budget-friendly transportation. In this paper, we propose an IoV-based framework that consists of deployment and scheduling of a mobile charging infrastructure. For the deployment, we formulate an optimization problem to minimize the total cost of mobile charging infrastructure placement while considering constraints on the number of EVs that can be charged simultaneously. The formulated problem is mixed-integer programming and solved by using the branch and bound algorithm. We then propose an IoV-based scheduling scheme for EVs charging to minimize travel distance and charging costs while satisfying the constraints of charging time requirement of EVs and resources of a charging station. We consider passive road sensors and traffic sensors in the proposed IoV-based scheduling scheme to enable EV users for finding a charging station that can fulfill their requirements, as well as to enable service providers to know about the demand in the area. Simulation results illustrate the significant impact of the optimal deployment of charging infrastructure and scheduling optimization on the efficiency of EVs charging.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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.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".