- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes a framework for dynamic multi-objective routing that uses a learned controller to selectively branch out at each step to roll out to the end of the route to find candidate routes. The framework is evaluated on multi-objective traveling salesman and capacitated vehicle routing tasks.
Critical strengths
Selectively allocating compute via a learned controller is a useful design for expanding candidate search while maintaining inference efficiency
Critical weaknesses
- The world model operates on the fixed graph and does not predict future events, making the claim about the world model an overstatement.
- The generality and efficiency of the framework are insufficiently demonstrated. Only one base solver is considered in the manuscript. See questions below.
Questions for authors
- The authors claim that the framework can "extend to other autoregressive NCO solvers". Could the author provide results using at least one additional base solver? This could further solidify the claim of the proposed framework's effectiveness and generality.
- The runtime of WECA-WM can be significantly higher than that of Static WECA. Could the author provide a more systematic quality-computation analysis with the additional base solvers?
6 comments
Response to R3-CW2: Generality and Efficiency
We thank the reviewer for this important observation. We have conducted additional experiments to address both the generality and computational efficiency of our framework.
Generality (Q1): We extended WECA-WM to a second autoregressive NCO backbone, CNH, and evaluated it on Bi-TSP and Bi-CVRP across different problem sizes and dynamic settings. The results demonstrate that our framework is not limited to the original WECA solver. Please see our response to R3-Q1 for detailed results.
Efficiency (Q2): We added systematic quality–runtime comparisons against Fixed-K4, uncertainty-triggered rollout (UT), and SGBS, together with HV–runtime Pareto plots. These results demonstrate the computational advantages of adaptive allocation, particularly on larger instances. Please see our response to R3-Q2 for detailed comparisons.
Together, these additional experiments provide evidence of both backbone generality and computational effectiveness beyond the original experiments.
R3-Q1: Generality Across Autoregressive NCO Solvers
We thank the reviewer for asking whether our framework can generalize beyond the original WECA backbone. Yes. We have conducted additional experiments using Conditional Neural Heuristic (CNH; Fan et al., 2025) as a second autoregressive NCO backbone. The results demonstrate consistent improvements across both dynamic and static environments, supporting the transferability of our framework across different NCO architectures.
1. Integration with an additional NCO backbone.
We integrated our framework with CNH without modifying its original encoder–decoder architecture. Specifically:
-
Candidate generation: We construct candidate actions from CNH's feasible-action probability distribution.
-
Lookahead evaluation: The frozen CNH policy completes each candidate into a full route under the currently observed graph.
-
Adaptive allocation: The learned controller determines whether to invoke lookahead and how many candidates to evaluate.
-
Online execution: Only the selected next action is executed. Subsequent environmental events are observed and incorporated before the next decision.
This integration demonstrates that our framework is not restricted to WECA and can operate with another autoregressive NCO solver through its action-distribution interface.
2. Results across dynamic and static environments.
We evaluated both backbones on Bi-TSP and Bi-CVRP with 20, 50, and 100 nodes. Dynamic experiments cover D1–D3, while static experiments evaluate the framework without environmental events.
The following table summarizes the results. Dynamic HV values are averaged over D1–D3. Each entry reports baseline → WM, with the absolute HV improvement in parentheses.
| Problem | Dynamic CNH → CNH-WM | Static CNH → CNH-WM |
|---|---|---|
| Bi-TSP20 | 0.7073 → 0.7173 (+0.0100) | 0.6270 → 0.6275 (+0.0005) |
| Bi-TSP50 | 0.7921 → 0.8056 (+0.0134) | 0.6387 → 0.6410 (+0.0023) |
| Bi-TSP100 | 0.8039 → 0.8211 (+0.0173) | 0.7019 → 0.7055 (+0.0036) |
| Bi-CVRP20 | 0.4432 → 0.4497 (+0.0065) | 0.4287 → 0.4301 (+0.0014) |
| Bi-CVRP50 | 0.4493 → 0.4595 (+0.0103) | 0.4087 → 0.4100 (+0.0013) |
| Bi-CVRP100 | 0.4741 → 0.4813 (+0.0072) | 0.4065 → 0.4077 (+0.0012) |
The results show that:
-
Dynamic environments: CNH-WM improves over CNH in all 18 task–size–profile configurations, with absolute HV gains ranging from 0.0018 to 0.0234.
-
Static environments: CNH-WM improves over CNH in all six configurations. Importantly, WECA-WM also improves over WECA in all six configurations.
-
Cross-scale consistency: Improvements are observed across both routing tasks and all three problem sizes, rather than being limited to a particular problem scale or backbone.
Notably, the static results provide additional evidence that the benefit of lookahead does not depend on environmental changes. Even when no events occur, evaluating alternative route completions can improve current action selection.
3. Implications for generality.
These additional experiments provide empirical evidence that the proposed adaptive lookahead mechanism is transferable across two autoregressive NCO backbones, WECA and CNH. The consistent improvements across two routing tasks, three problem sizes, and both dynamic and static environments support the generality of the proposed framework.
We have added the CNH integration details and the complete dynamic and static experimental results to Appendix K (Tables 10 and 11) of the revised manuscript.
References
[1] Fan, M., Wu, Y., Cao, Z., Song, W., Sartoretti, G., Liu, H., & Wu, G. (2025). Conditional Neural Heuristic for Multiobjective Vehicle Routing Problems. IEEE Transactions on Neural Networks and Learning Systems, 36(3), 4677–4689. https://doi.org/10.1109/TNNLS.2024.3371706
Response to R3-CW1: Clarification of the World Model Formulation
We thank the reviewer for highlighting this concern. We agree that our World Model does not learn environmental transition dynamics or predict future exogenous events. However, it explicitly models the downstream consequences of candidate decisions to guide current action selection. We clarify this distinction below.
1. Regarding the World Model formulation. Our approach adopts a task-specific, decision-oriented World Model, motivated by the use of imagined future outcomes to guide present decisions (Ha & Schmidhuber, 2018; Hafner et al., 2019). Rather than predicting environmental changes, our formulation focuses on action-conditioned solution consequences, which are directly relevant to neural combinatorial optimization.
2. Regarding the fixed-graph rollout. Although the observed graph remains fixed during imagination, the routing state evolves as candidate routes are constructed, including visited nodes, feasibility masks, and remaining capacity. Specifically, the frozen NCO policy completes the route conditioned on each candidate action, and the resulting terminal objective estimates its downstream consequence (Eq. 5). These imagined outcomes guide the current decision, while subsequent environmental changes are incorporated through graph updates and replanning. Thus, our formulation provides decision-level foresight rather than environmental-event prediction.
3. Regarding the potential overstatement. We acknowledge that our formulation is narrower than conventional learned-dynamics world models. We will explicitly clarify its task-specific, rollout-based scope, distinguish it from environmental dynamics prediction, and emphasize that the primary methodological novelty lies in the learned controller that adaptively determines when and how extensively to perform lookahead.
References
[1] Ha, D., & Schmidhuber, J. (2018). World Models. Advances in Neural Information Processing Systems (NeurIPS). https://doi.org/10.5281/zenodo.1207631
[2] Hafner, D., Lillicrap, T., Ba, J., & Norouzi, M. (2019). Dream to Control: Learning Behaviors by Latent Imagination. International Conference on Learning Representations (ICLR).