Optimal Sizing, Gear Ratios, and Shifting Schedule of Battery‐Electric Mining Haul Trucks to Enhance Energy Efficiency
Bibliographic record
Abstract
At present, mining haul trucks (MHTs) directly deploy the on‐road heavy‐duty trucks’ battery‐electric powertrain, as they can cut down costs and emissions in mining. However, the operating patterns of MHT are different, e.g., ultraduty, low‐speed, and continuous road slopes, resulting in a mismatch between the dynamic and economic performance of mining required and the MHT achieved. The powertrain design and control influence the dynamic and economic performance, which can be quantitatively measured by top speed, gradeability, and energy consumption. This study uses an improved differential evolutionary algorithm to develop an integrated optimization platform to obtain the components sizing, gear ratio, and shifting schedule for the dedicated battery‐electric MHT. Mathematical models are established and validated using on‐site experiment data. An integrated optimization platform is initiated by concurrently formulating the motor sizing, gear ratio, and shifting schedule and solved by the improved differential evolutionary algorithm. Optimization results indicate that the economic performance is enhanced by 10.82%, 11.08%, 11.18%, and 11.20%, respectively, while maintaining or slightly improving the dynamic performance. Besides, the achievable maximum speed at the most common grade is boosted by 11.82%, 6.52%, 7.44%, and 6.52%, respectively. The study provides an approach to developing a battery‐electric powertrain for MHT.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".