Optimization Models for Snowplow Routes and Depot Locations: A Real-World Implementation
Bibliographic record
Abstract
This study developed a series of strategies to reassess the service level of winter road maintenance (WRM) operations on the road network in Perth County, Ontario, Canada. These strategies include rearranging plow routes by sharing the material storage yards and optimizing their numbers and locations while considering operational and legislative constraints such as total circuit time, operating speeds, and the number of available trucks. A methodological framework was then formulated and solved by tackling four practical, yet challenging, tasks in a sequential manner. The first task was to identify existing plow routes and construct a detailed GIS database that was later used for benchmarking the current WRM operations. The second task involved the optimization of existing plow routes, while the third task focused on the optimization of plow routes and depot locations by amalgamating WRM operations of different municipalities within Perth County. The final task was to conduct a clean slate optimization to see the benefits of combining depots and route sharing. The optimization models developed were implemented to transform the existing maintenance operations networks to an optimized, integrated, and unified network of routes, with improved land use utilization for road maintenance yards. The framework then captured the impact of the service order of maintenance routes and arranged routing priority efficiently using the tabu search algorithm. The findings also revealed that, by sharing depots, the county could retire three depots and eight trucks while still meeting legislative requirements, thereby suggesting the potential for substantial monetary savings.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".