An intelligent rule-based decision-making system for preliminary truck dispatching within open-pit mines
Bibliographic record
Abstract
Preliminary truck dispatching involves directing trucks to appropriate destinations before addressing specific optimization objectives such as maximizing ore production or minimizing waiting times. While rule-based systems are commonly used for preliminary dispatching, they lack adaptability to unforeseen scenarios. This study presents an intelligent rule-based system that integrates reinforcement learning to generate labeled data and supervised learning to train a deep neural network on the collected data. A modified Q-learning algorithm, RapidQ, was introduced to expedite the data collection process. The system was implemented in a simulated open-pit mine case study, which incorporated a broader range of dispatching features that are underexplored but essential compared to previous studies. The simulation was designed to handle uncertainties such as weather conditions, blasting needs, truck and shovel failures, and maintenance schedules. When evaluated against a conventional rule-based system, the proposed intelligent dispatching system achieved 10 times fewer incorrect dispatches, 4% fuel savings, a 10% reduction in queuing time, and a 14% increase in ore production. The developed system can be positioned as a potential upper-stage solution in future multi-stage intelligent dispatching systems, complemented by specific dispatching algorithms at the lower stage.
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.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".