Real-Time Delivery Time Forecasting and Promising in Online Retailing: When Will Your Package Arrive?
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
Problem definition: Providing fast and reliable delivery services is key to running a successful online retail business. To achieve a better delivery time guarantee policy, we study how to estimate and promise delivery time for new customer orders in real time. Academic/practical relevance: Delivery time promising is critical to managing customer expectations and improving customer satisfaction. Simply overpromising or underpromising is undesirable because of the negative impacts on short-/long-term sales. To the best of our knowledge, we are the first to develop a data-driven framework to predict the distribution of order delivery time and set promised delivery time to customers in a cost-effective way. Methodology: We apply and extend tree-based models to generate distributional forecasts by exploiting the complicated relationship between delivery time and relevant operational predictors. To account for the cost-sensitive decision-making problem structure, we develop a new split rule for quantile regression forests that incorporates an asymmetric loss function in split point selection. We further propose a cost-sensitive decision rule to decide the promised delivery day from the predicted distribution. Results: Our decision rule is proven to be optimal given certain cost structures. Tested on a real-world data set shared from JD.com, our proposed machine learning–based models deliver superior forecasting performance. In addition, we demonstrate that our framework has the potential to provide better promised delivery time in terms of sales, cost, and accuracy as compared with the conventional promised time set by JD.com. Specifically, our simulation results indicate that the proposed delivery time promise policy can improve the sales volume by 6.1% over the current policy. Managerial implications: Through a more accurate estimation of the delivery time distribution, online retailers can strategically set the promised time to maximize customer satisfaction and boost sales. Our data-driven framework reveals the importance of modeling fulfillment operations in delivery time forecasting and integrating the decision-making problem structure with the forecasting model.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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