- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents ViSO, a framework that uses distilled visual skills to guide subproblem selection in large-scale routing optimization. Offline, a vision-language model compares successful and unsuccessful region selections using solver feedback, then consolidates the resulting selection rules across instances into a reusable skill bank. During inference, these skills guide the model to identify promising regions in images of the current routing solution. The selected regions are converted into smaller optimization problems by compressing fixed route segments into hypernodes, solved using conventional solvers, and incorporated only when they yield feasible improvements. The framework supports symmetric, asymmetric, and capacitated routing without updating model parameters.
Critical strengths
- The framework supports a wide-range of routing problems, including symmetric, asymmetric, and capacitated routing. Feasibility checks and improvement-only acceptance keep the global solution valid despite imperfect VLM proposals. This strengthens its practical relevance: the approach applies across several routing settings, and unreliable proposals cannot degrade the incumbent solution.
- ViSO turns solver feedback into explicit, reusable selection rules. Comparing successful and unsuccessful regions provides a sensible basis for extracting skills without updating model parameters. The reported held-out improvements support the usefulness of this mechanism and strengthen the empirical case for the approach.
Critical weaknesses
- The central contribution is insufficiently isolated. Visual selection and segment contraction build on prior work, making skill distillation the main novelty. Comparisons against handwritten rules, simple trajectory summaries, and individual distillation stages are needed to establish why the proposed procedure matters.
- The overall contribution of this paper is a bit limited. If I understand it correctly, the overall contribution of this paper is to apply the existing skill-distillation to identify which subregions of the solution should be optimized. I think that is not quite enough for a top-tier machine learning conference.
Questions for authors
- Can the learned skills transfer across problem families, size tiers, or solver frameworks without re-distillation? Since separate skill banks are constructed for each setting, including DRAGON, could the authors evaluate an existing bank directly in a different setting to distinguish skill transfer from the portability of the distillation procedure?
- Could the authors compare ViSO with strong conventional solvers under matched computational or monetary budgets to assess whether its modest absolute gap reductions justify the additional cost of hosted VLM inference and parallel solver calls?
6 comments
Response to Reviewer PwQs (Part 2)
W2. The contribution appears limited, since the paper seems to apply existing skill distillation to decide which subregions of the solution to optimize.
Ans. We sincerely thank the Reviewer for raising this important concern. We respectfully clarify that the contribution of this paper goes beyond applying an existing skill-distillation method. ViSO contributes a constraint-aware visual decomposition framework and a mechanism for turning solver feedback into reusable guidance for allocating optimization effort. We describe these technical advances and their supporting evidence below. Please also refer to General Response (2/3) for a comparison with existing methods.
- A unified decomposition interface that extends visual optimization beyond symmetric Euclidean TSP.
ViTSP establishes the effectiveness of visual selection for symmetric Euclidean TSP. Extending this approach to asymmetric and capacitated routing introduces additional requirements: matrix-only instances lack native coordinates, and reconnecting selected regions must preserve directed segment costs and resource constraints. ViSO addresses these requirements through a common interface. MDS provides a layout for visual selection, while constraint-aware hypernodes retain each fixed segment’s entry and exit nodes, internal cost, and aggregate demand. Connections between hypernodes use the original endpoint costs. After re-optimization, the segments are expanded and the complete solution is checked for feasibility and improvement against the original instance (Secs. 3.2, 3.5–3.6; Appendix A). Thus, visual selection can operate across different routing families while optimization and verification retain their original costs and constraints.
This framework has value independently of skill distillation: the skill-free variant achieves a mean CVRP gap of 0.243%, compared with 0.261% for HGS under the same runtime budget (Tables 1 and 9).
2. Skill acquisition and deployment specifically designed for visual subproblem selection.
We acknowledge that learning reusable insights from successful and failed experiences is established by methods such as ExpeL. The technical contribution lies in how ViSO constructs and applies this knowledge for visual decomposition. Specifically, ViSO builds on this principle to learn where solver effort produces useful improvements in a visualized solution. Its learning examples associate selected regions with the solver-measured change in the global objective. Because regions differ in their size and optimization difficulty, ViSO compares successful and unsuccessful selections within the same instance, pairing regions with similar numbers of selected nodes. This reduces differences in instance difficulty and neighborhood size when identifying visual patterns associated with productive selections (Sec. 3.4).
Our distillation procedure also separates independent evidence extraction from collective refinement. Whereas ExpeL sequentially updates a shared insight list, ViSO uses independent visual critics to generate proposals before hierarchical merging. The merged bank is then audited against successful selections from distinct training instances. This allows each comparison to be examined without conditioning its initial interpretation on earlier insight edits. The resulting Cue / Action / Avoid rules state when a rule applies (Cue), which region to select (Action), and which failure to avoid (Avoid), while excluding instance identifiers and absolute coordinates.
Deployment also accounts for the visual instance: an image-conditioned scheduler weights the skill bank according to the initial solution. This design has direct empirical support. With the same skill bank, initialization, and number of solved subproblems, image-conditioned scheduling reduces the mean gap from 0.293% to 0.271%, a 7.5% relative reduction, compared with uniform skill sampling (Fig. 4(c)). This demonstrates the value of conditioning skill use on the instance, beyond simply supplying a bank of advice.
3. ViSO outperforms strong solvers on large-scale routing, and its skills generalize beyond ViSO. On 200+ instances with up to 85,900 nodes across four routing variants and under the same wall-clock limit, the mean gap of ViSO is 10.5% lower than that of LKH-3 on TSP and 11.5% lower than that of HGS on CVRP, and its mean objective is 2.72% below PyVRP on ACVRP (Tables 1 and 2). The same procedure also improves DRAGON, a text-only framework (Appendix I), and carries over to 2D bin packing (see General Response (3/3)).
Overall, ViSO contributes a generalized vision-guided decomposition framework for routing and a skill distillation procedure specifically designed for visual subproblem selection. Together, they outperform strong solvers on large-scale routing and generalize beyond ViSO.
Response to Reviewer PwQs (Part 3)
Q1. Can existing skill banks be used in other problem families, size tiers, or frameworks without re-distillation, to separate skill transfer from the portability of the distillation procedure?
Ans. We thank the Reviewer for this insightful question. Following the Reviewer’s suggestion, we evaluated existing banks directly in a different setting to test the transferability of the skills themselves, without any re-distillation, in two ways.
- Across problem families. The bank distilled from ATSP trajectories is used to solve TSP instances. Each TSP instance receives the ATSP bank of its own size tier.
- Across size tiers. The two TSP banks are swapped. The large TSP instances use the bank distilled on the small tier, and the small instances use the bank distilled on the large tier.
Setup. We use the ten TSP instances and the protocol of Table 11. All variants start from the same LKH-3 warm start and stop after solving the same number of subproblems, with three runs per instance. Only the bank is changed.
Mean final gap (%) on TSP, lower is better:
| Bank used | All | Small | Large |
|---|---|---|---|
| Baseline TSP results (TSP bank of the same tier, Table 11) | 0.271 | 0.191 | 0.305 |
| Across problem families (ATSP bank used on TSP) | 0.279 | 0.241 | 0.295 |
| Across size tiers (small-tier and large-tier TSP banks swapped) | 0.329 | 0.293 | 0.345 |
Results. With the ATSP bank, the mean gap on TSP is 0.279%, compared with 0.271% with the TSP bank itself. With the TSP banks swapped between tiers, the gap rises to 0.329%. The skills therefore transfer across problem families with little loss, whereas a bank distilled on small instances is less suited to large instances, and vice versa. Because instances of different scales have different visual characteristics and call for different skills, ViSO distills one bank per size tier (Sec. 3.4).
Overall, an existing bank can be reused across problem families without re-distillation and with little loss, while one bank per size tier remains preferable. The distillation procedure itself also carries over to other frameworks, as shown for DRAGON. (Appendix I) We have added these results as Table R6 in Appendix E of the revised manuscript.
Response to Reviewer PwQs (Part 1)
We thank the Reviewer for the careful reading and the constructive comments. We respond to each comment as follows and hope our responses properly address your concerns. All changes are highlighted in blue in the revised manuscript.
W1. Visual selection and segment contraction build on prior work, so skill distillation is the main novelty. Comparisons with handwritten rules, simple trajectory summaries, and individual distillation stages are needed.
Ans. We thank the Reviewer for this constructive suggestion. We agree that new comparisons are required to isolate the contribution of the skill distillation procedure, and we report them below. Before presenting the new results, we would like to clarify the scope of our contribution.
The contribution of ViSO is not limited to skill distillation. It has two parts.
The novelty of the framework and the technical contributions are further discussed in General Response (2/3) and in the response to W2. Below we isolate the skill distillation procedure with the three comparisons the Reviewer asks for.
The full two-stage distillation outperforms handwritten rules, simple trajectory summaries, and its own first stage (new experiment). We replaced the distilled bank with four alternatives and kept the rest of ViSO unchanged.
Setup. We use the ten TSP instances and the protocol of Table 11. All variants start from the same LKH-3 warm start (mean starting gap 1.23%) and stop after solving the same number of subproblems, with three runs per instance.
Mean final gap (%), lower is better:
Results. The full two-stage bank attains the lowest gap on all instances and on both tiers. The handcrafted rules reach 0.325%, the VLM prior-knowledge bank 0.299%, and the simple trajectory summary 0.572%. With the first stage alone the gap is 0.347%, and adding the second stage lowers it to 0.271%.
Overall, these comparisons isolate the contribution of the skill distillation procedure. Neither handwritten rules, prior knowledge, a simple summary of the same trajectories, nor the first stage of the distillation alone matches the full two-stage distillation. We have added these comparisons as Table R5 in Appendix E of the revised manuscript.
References
Stefan Voigt. A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems. European Journal of Operational Research, 322(2):357–375, 2025.