- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper presents DORA, an LLM-based framework for learning courier routing behavior from historical delivery traces and routing advice. Rather than minimizing geometric distance, DORA seeks to reproduce observed delivery sequences. The framework integrates candidate routes from existing routing models, historical information, supervised fine-tuning, and route-level reinforcement learning. Experiments on LaDe and Amazon demonstrate the potential of combining learned routing advice with executable language-model decisions.
Critical strengths
The authors correctly identify the discrepancy between distance-minimizing routes and observed courier behavior. Learning behavioral routing patterns is an interesting direction beyond classical distance-based optimization.
Critical weaknesses
-
The framework mainly combines existing components, including Qwen3, LoRA, GRPO-style learning, candidate routing proposals, and action masking. Although the integration is useful, the paper does not introduce a fundamentally new learning architecture or optimization objective.
-
The overall methodological narrative is difficult to follow. In particular, the LaDe and Amazon settings involve substantially different input representations, output spaces, training procedures, and execution mechanisms, yet the rationale behind these different designs and their connection under a unified framework are not sufficiently explained. Moreover, the method section introduces several technical components, particularly in the Amazon pipeline, without sufficient intuitive examples, making the overall workflow difficult to understand.
-
The paper emphasizes the potential efficiency of compact LLMs, but does not provide a fair end-to-end runtime comparison with specialized routing methods.Appendix F reports approximately 10.6–11.1 minutes of A100 decoding time for 300 LaDe tasks per model, excluding Graph2Route proposal generation and historical retrieval. Amazon additionally requires candidate generation, multiple LLM samples, voting, and LKH execution. The reported measurements come from different hardware and experimental configurations, so they cannot support a reliable cost-effectiveness conclusion.
Questions for authors
See Weaknesses
Response to Reviewer vkhF
Thank you for the review. We address each point below.
Novelty
We agree. The contribution we claim is a formulation of route prediction in which a policy reads the outputs of existing routing systems as advice and acts through an interface that makes every output an executable route, with two such interfaces evaluated on two real delivery datasets. On LaDe, the policy restructures its advice. 253 to 274 of its 300 routes match none of the nine proposals it reads (Section 5.2), and its rewrites cut returns to an already visited area by 0.87 per route (95% CI [0.73, 1.02]). On Amazon, the relational interface improves on a full rerun of the challenge winner (Section 5.4). The revised introduction will state the contributions at this level.
One framework for both settings
Both settings follow the formulation in Section 3 (Eq. 1). Fixed advisers produce advice, a Qwen3-4B-Instruct policy with a LoRA adapter emits an action, and a fixed executor turns it into a complete route. The two datasets come from delivery operations in two countries, and the settings differ as follows.
The policy acts at the granularity of its advice and leaves the rest to the executor. A LaDe route is short and its proposals are complete stop orders, so the policy writes the whole route. An Amazon route is about sixteen times longer and its candidates are zone orders, so the policy writes relations among zones and LKH places the stops. The task's geometry enters through the executor, so the Amazon prompt carries no coordinates. The revision will state this rule in Section 3 with this table.
An example of the Amazon pipeline
We agree that an example was missing. Schematically, take an Amazon route with 150 stops in 18 zones.
The revision will add this example to Section 4.
End-to-end runtime
We agree. At inference, DORA keeps its advisers and adds its own step on top of them. On LaDe, that step is about 2.1 to 2.2 A100-seconds of decoding per task, on top of the nine G2R proposals it reads, which take about 0.08 CPU-seconds per task to generate. On Amazon, it adds about 6.7 A100-seconds per route for eight policy samples and about 0.9 for generating the candidate zone orders, both in batched inference, and a two-second LKH solve to the champion pipeline (about 42.8 CPU-seconds per route). We will remove the abstract's sentence on cost-effective deployment. The revision will report these stage costs, with their hardware, in one table in Appendix F.
We are happy to discuss any remaining concern.