Intelligent optimization for charging scheduling of electric vehicle using exponential Harris Hawks technique
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The coordination of modern transportation system depends heavily on intelligent techniques, information assortment, and its analysis. Sensors play a crucial role in information assortment in charging scheduling of electric vehicles (EVs). EVs are destined to become inevitable due to their innate economic contribution, climate improvement, and social attributes as per United Nation's sustainable development goals. Innovation in EV has gained the interest of many researchers since it is one of the novel green transportation sectors. Moreover, EVs are essential to preserve conventional fuels and to maximize the utilization of renewable sources. Nevertheless, EVs have short driving ranges due to their battery limitation, which hinders the reliability. The charging stations (CS) for EVs are also unevenly distributed. This paper presents a novel strategy to schedule the charging points in EV CSs. The goal is to determine the convenient CS for EVs through Vehicular Ad-hoc Network (VANET) model. In this model, the CSs are determined and prioritized using four phases, such as driving, charge planning, charging scheduling, and battery charging. Charging scheduling was designed using a newly developed optimization strategy, exponential Harris Hawks optimization (Exponential HHO) algorithm, which combines two algorithms, Harris Hawks optimization (HHO) and exponential weighted moving average (EWMA). Furthermore, the fitness function was also newly devised by considering parameters such as average waiting time, remaining energy, number of EVs, and distance. The proposed Exponential HHO was validated using VANET simulation and the performance was improved with maximum remaining energy of 52.709 Whr, minimal distance of 27.256 km, and a maximum average waiting time of 0.352 min in comparison with existing methods. To be specific, the proposed Exponential HHO yielded better improvement, especially when considering a large number of vehicles.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it