A Smart Approach to Electric Vehicle Optimization via IoT-Enabled Recommender Systems
Bibliographic record
Abstract
Electric vehicles (EVs) are becoming of significant interest owing to their environmental benefits; however, energy efficiency concerns remain unsolved and require more investigation. A major issue is a lack of EV charging infrastructure, which can lead to operational difficulties. Effective infrastructure development, including well-placed charging stations (CS), is critical to enhancing connectivity. To overcome this, consumers want real-time data on charging station availability, neighboring station locations, and access times. This work leverages the Distance Vector Multicast Routing Protocol (DVMRP) to enhance the information collection process for charging stations through the Internet of Things (IoT). The evolving IoT paradigm enables the use of sensors and data transfer to give real-time information. Strategic sensor placement helps forecast server access to neighboring stations, optimize vehicle scheduling, and estimate wait times. A recommender system is designed to identify stations with more rapidly charging rates, along with uniform pricing. In addition, the routing protocol has a privacy protection strategy to prevent unauthorized access and safeguard EV data during exchanges between charging stations and user locations. The system is simulated with MATLAB 2020a, and the data are controlled and secured in the cloud. The predicted algorithm’s performance is evaluated using several kinds of standards, including power costs, vehicle counts, charging costs, energy consumption, and optimization values.
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.003 |
| 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".