Failure Prediction and Intelligent Maintenance of a Transportation Company’s Urban Fleet
Bibliographic record
Abstract
The present work deals with intelligent vehicle fleet maintenance and prediction. We propose an approach based primarily on the history of failures data and on the geographical data system. The objective here is to predict the date of failures for a fleet of vehicles in order to allow the maintenance department to efficiently deploy the proper resources; we further provide specific details regarding the origins of failures, and finally, give recommendations. This study used the Société de transport de Montréal (STM)’s historical bus failure data as well as weather data from Environment Canada. We thank Facebook’s Prophet, Simple Feed-forward, and Beats algorithms (Uber), we proposed a set of computer codes that allow us to identify the 20% of buses that are responsible for the 80% of failures by mean of the failure history. Then, we deepened our study on the unreliable equipments identified during the diffusion of our computer code This allowed us to propose probable predictions of the dates of future failures. To ensure the validity of the proposed algorithm, we carried out simulations with more than 250,000 data. The results obtained are similar to the predicted theoretical 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.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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".