Bibliographic record
Abstract
We study a courier dispatching problem in an on-demand delivery system in which customers are sensitive to delay. Specifically, we evaluate the effect of temporal pooling by comparing systems using the dedicated strategy, with which only one order is delivered per trip, versus the pooling strategy, with which a batch of consecutive orders is delivered on each trip. We capture the courier delivery system’s spatial dimension by assuming that, following a Poisson process, demand arises at a uniformly generated point within a service region. With the same objective of revenue maximization, we find that the dispatching strategy depends critically on customers’ patience level, the size of the service region, and whether the firm can endogenize the demand. We obtain concise but informative results with a single courier and assuming that customers’ underlying arrival rate is large enough, meaning a crowded market, such as rush hour delivery. In particular, when the firm has a growth target and needs to achieve an exogenously given demand rate, using the pooling strategy is optimal if the service area is large enough to fully exploit the pooling efficiency in delivery. Otherwise, using the dedicated strategy is optimal. In contrast, if the firm can endogenize the demand rate by varying the delivery fee, using the dedicated strategy is optimal for a large service area. The reason is that it is optimal for the firm to sustain a relatively low demand rate by charging a high fee for a large service radius: within this large area, the pooling strategy leads to a long wait because it takes a long time for multiple orders to accumulate. Moreover, with an exogenous demand rate to meet, customers’ patience level has no impact on the dispatch strategy. However, when the demand rate can be endogenized, the dedicated strategy is preferable if customers are impatient. Furthermore, we extend our model to account for social welfare maximization, a hybrid contingent delivery policy, a general arrival rate that does not have to be large, a nonuniform distribution of orders in the service region, and multiple couriers. We also conduct numerical analysis and simulations to complement our main results and find that most insights in our base model still hold in these extensions and numerical studies. This paper was accepted by Jeannette Song, operations management. Funding: This work was supported by the Natural Sciences and Engineering Research Council of Canada [Grants RGPIN-2015-06757 and RGPIN-2021-04295]. Supplemental Material: The online appendix and data are available at https://doi.org/10.1287/mnsc.2023.4858 .
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.003 | 0.010 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.011 | 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".