- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper focuses on the multi-agent workflow for routing problems. They design a geometric distance prior for the attention logits that is helpful for the decision makings of the next action. Extensive experiments also validate the power of fine-tunning stage.
Critical strengths
-
The frozen-transfer results are promising: at N=100, the mean gap on unseen variants decreases from CCL’s 34.89% to 17.19%, with the lowest gap on 28/32 variants.
-
The three-seed comparison provides useful evidence that pretrained initialization improves downstream performance under same training paradigm.
-
The whole arch is easy to follow.
Critical weaknesses
The authors may miss one important reference: Wang Y, Jia Y H, Chen W N, et al. Distance-aware attention reshaping: Enhance generalization of neural solver for large-scale vehicle routing problems. This paper also proposes a very similar geometric distance prior to the neural solver. I think you should somehow compare with it in the formulation and experiments if possible.
Questions for authors
- Why does the N=50 full model have an unseen gap of 11.740% in Table 4 but 13.965% in Table 8, with 400 candidates in both cases? Please identify any differences in datasets, checkpoints,or evaluators.
5 comments
Response to Reviewer dxBH (2/2): Q1, Table 4 vs. Table 8
Q1. Table 4 (11.740%) vs. Table 8 (13.965%). Thank you for catching this. The dataset, checkpoint and candidate budget are identical; the difference comes from our evaluation script: the multi-depot (MD) slot layout (2.1 pp) and the way our gap was computed (0.1 pp).
- Dataset. Both use the same 32 unseen variants × 1,000 test instances at N=50.
- Checkpoint. Both use the same N=50 source checkpoint (Table 6; best validation epoch 295, Appendix B.3).
- Candidates. Both use 8 × 50 = 400 candidates.
- Evaluator. Our N=50 values in Table 8 were produced by an earlier version of our evaluation script that predates the MD slot layout specified in Section 4.4 and Appendix A.2. That version assigned slots to depots in contiguous blocks and clamped the active-slot count below at 1 rather than at the number of depots D. Because a rollout activates a prefix of slots, rollouts with few active slots could leave a depot without any vehicle. For example, an N=50 MD instance has D=3 depots and K=8 slots. The earlier script assigned them as (0,0,0,1,1,1,2,2), so a rollout that activates M=5 slots (e.g., c≈1.5 for an instance of average demand) uses depots 0 and 1 only, and customers near depot 2 must be served from a farther depot. Under the specified layout (0,1,2,0,1,2,0,1), every M≥3 activates all three depots. Training is unaffected, since all 16 training variants are single-depot, where both layouts coincide.
- Gap computation. In the submitted Table 8, our gap was computed from our mean cost and the reference cost implied by the CCL row. Our N=50 gaps are now averaged per instance, as in Table 4 and the baseline columns.
To separate the two effects, we re-ran the earlier layout with the same checkpoint, candidates and evaluation seed:
| Mean gap (%), N=50 | Earlier layout, gap as in Table 8 (submitted) | Earlier layout, per-instance gap | Current layout, per-instance gap (Table 4) |
|---|---|---|---|
| Single-depot MB (8) | 7.59 | 7.66 | 7.66 |
| Multi-depot (24) | 16.09 | 15.92 | 13.10 |
| All unseen (32) | 13.97 | 13.86 | 11.74 |
Re-running the earlier layout and computing the gap as in the submission gives 13.98% (Table 8: 13.97%). Averaging per-instance gaps changes this by 0.1 pp, and the slot layout accounts for the remaining 2.1 pp, all of it on MD variants. One single-depot variant, VRPMBL, differs from the submitted cost by more than seed noise (10.242 in this re-run and 10.245 in the current evaluation, vs. 10.216 submitted); we could not trace this value. Across five evaluation seeds of the current script, the standard deviation of each group mean is at most 0.01 pp. Baselines use their official environments and are unaffected.
Revision. Our N=50 column of Table 8 and the N=50 per-variant unseen table now report the current script with per-instance gaps, from the same evaluation as Table 4: 11.74% (CCL 27.59% with its published inputs, 18.73% with all depots encoded). OVRPMBTW, a near-tie in the submission (4.64% vs. CCL's 4.66%), is now 4.73%, so our gap is the lowest of the compared systems on 27/32 variants instead of 28/32, and lower than CCL's on 31/32. Both counts are the same with all depots encoded in the baselines. Tables 4 and 8 now agree on the N=50 unseen mean of the full model. We also corrected the statement that all unseen evaluations use 400 candidates; at N=100 every method uses 800 (§5, Appendix C). Appendix C now describes the earlier slot layout and gap computation.
All changes in the revised PDF are listed in the General Response. We hope this addresses the relation to DAR and the difference between Tables 4 and 8, and we are happy to answer further questions during the discussion.
Dear Reviewer dxBH
Thank you for your time and feedback. We have responded to your comments and questions and would appreciate it if you could take a look at our responses when you have a chance.
Please let us know if any concerns remain or if additional clarification would be helpful. We would be grateful for your updated assessment before the discussion period ends.
Thank you for your consideration.
Response to Reviewer dxBH (1/2): W1, relation to DAR
We thank the reviewer for the careful review and for the two precise points. Both led to changes in the revised PDF, which are listed in the General Response.
W1. Relation to DAR (Wang et al.). Thank you for pointing us to DAR. The revised PDF cites it and adds the comparison below.
Formulation. DAR adds a distance score to the decoder compatibility of a single-vehicle POMO decoder: b = −log d for the K nearest nodes and −d otherwise (K=100, C=50). Its goal is to reduce attention dispersion when a CVRP solver trained at N=100 is applied to larger instances. Our term in Eq. (2) is the case of the same score in which K covers every scored target (with C=10): every candidate receives −log d. We therefore do not claim the distance term as a contribution, and the revised PDF states this next to Eq. (2) in §4. In our model, the distance is measured from each route slot's own current position, and the term enters a single softmax over all route–customer and route–depot pairs, both in multi-variant pretraining and in frozen transfer to unseen constraints.
Does the prior explain our gains? It helps both models but does not explain the difference between them. For instances with at most 100 customers, DAR's score is the same −log d branch as ours (the clipping constant and the decoder differ), so the controls reported for Reviewer jAXk (Q1) also measure a DAR-type prior. Mean gap (%) on the 32 unseen variants (N=50, all depots encoded):
The prior helps both models, which supports DAR's idea. Our model is 14.2 pp below RF-TE without the prior and 9.8 pp below with it, and our model without the prior is already below RF-TE with it.
DAR's large-instance component. DAR's −d branch acts only on instances with more than K=100 customers. On CVRPLib-X (100–1,000 customers) we replaced our term with DAR's at inference (K=100), keeping the checkpoint, the 400 candidates and the seed fixed. The mean gap rose by 0.67 pp on N ≤ 250 and by 0.30 pp on N ≥ 500, and was higher on 47 of the 65 instances (lower on 12, equal on 6). This does not evaluate DAR trained end to end with our decoder: our model was trained with −log d over all candidates, so it shows only that the inference-only swap worsens both group means. We add DAR to the related work and this comparison to Appendix C.