Reaction Time Optimization Based on Sensor Data-Driven Simulation for Snow Removal Projects
Bibliographic record
Abstract
Reaction time of a snow removal project, which is defined as the duration between the time that snow begins accumulating at a road section and the time that snow is plowed, is a project performance indicator that can be used to evaluate the effectiveness of truck allocation strategies. While sensors, such as truck GPS (global positioning system) and weather RWIS (road weather information system), which track working hours and weather conditions, respectively, are used to collect large amounts of data, these data are not fully utilized to optimize reaction times of snow removal projects. In this research, the relationship between truck performance and weather information was analyzed. Sensor data were extracted, clustered, and refined; stochastic truck travelling speed and stochastic plowing speed were then mined and associated with the weather conditions of corresponding road sections. A data-driven, simulation-based optimization approach, which uses this mined data as input, was also developed to minimize reaction time. A practical case study of a project in Alberta, Canada, was conducted to validate and demonstrate the functionality of the proposed approach, which was simulated and optimized using the in-house simulation software, Simphony.NET. The resultant model allows project managers to predict the impact various truck allocation strategies on project time and cost to ensure that maximum project reaction time is minimized.
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.001 |
| 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.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".