Two-Stage Solution for Meal Delivery Routing Optimization on Time-Sensitive Customer Satisfaction
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
The online-to-offline (O2O) meal delivery mode in which takeout meals are ordered online and delivered offline is recently emerging. The fast delivery of huge meal orders for time-sensitive customers imposes great challenges on O2O meal delivery platforms. This study establishes a two-stage solution for meal delivery routing optimization with the objective of maximizing time-sensitive customer satisfaction. In the first stage, a large number of meal orders are hierarchically classified and merged into delivery bundles based on the nearest pickup location rule by applying the hierarchical agglomerative clustering (HAC) algorithm, to increase fast meal delivery efficiency. In the second stage, a genetic algorithm (GA) is applied to solve the cluster-based delivery routing optimization model to find an optimal delivery route for meal orders in each delivery bundle. The numerical simulation results verify that the two-stage routing optimization solution is effective to schedule timely meal delivery and improve customer time satisfaction. The comparison of the results indicates the superiority of the proposed two-stage solution with HAC and GA on customer satisfaction while ensuring the delivery of all orders within 60 minutes. The sensitivity analysis shows the impact of time-sensitive customer heterogeneity on meal delivery satisfaction. This research has significant managerial insights for fast delivery services of O2O meal delivery platforms.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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