AN ANALYSIS OF THE ASSIGNMENT OF DELIVERY ROUTES TO VEHICLE DRIVERS IN STOCHASTIC VEHICLE ROUTING OPERATIONS
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Random day-to-day fluctuations in customer demands extend the range of decisions to be made by managers of vehicle routing/dispatch operations. For one, dispatch/routing managers must decide how responsive the delivery routes should be to the stochastic demands. But even with that decision settled –often by using daily route reoptimization to maximize responsiveness– the assignment of drivers to the reoptimized delivery routes must also be determined. In the interest of customer service, managers may use driverto-route assignment rules that ensure that the driver who is historically most familiar with a given customer will most likely be chosen to continue serving the route that that customer is on. Using data from several vehicle routing scenarios, this paper presents a statistical analysis of one such decision rule, and uses the analysis to derive managerial implications of rules that seek to maximize customer-driver familiarity. The paper also provides some preliminary insights on the potential for Markov Chains in modeling driver-to-route assignment decisions.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it