- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates the application of vision-language models to end-to-end combinatorial optimization, covering six problem types: TSP, CVRP, MIS, MVC, PFSP, and JSSP. The proposed method renders structured problem instances as images and optimizes their visual representation via evolutionary search. It employs supervised fine-tuning and reinforcement learning based on verifiable rewards for the Qwen2.5-VL-7B model, while enhancing solution quality through multi-candidate sampling and visual augmentation. Experimental results demonstrate effective constraint satisfaction capabilities.
Critical strengths
- The research direction is significant, and the task coverage is broad. Directly mapping visual inputs to combinatorial optimization solutions is a valuable area of exploration; the framework encompasses routing, graph optimization, and scheduling tasks without requiring architectural modifications for different problems.
- The training process is supported by empirical evidence. Table 1 demonstrates that reinforcement learning significantly improves feasibility rates across multiple tasks—for instance, the CVRP feasibility rate rose from 62% (with SFT) to 88%, reaching 100% when combined with the "Best-of-8" strategy—while ablation studies confirm the practical utility of visual prompts.
- The experimental scope is comprehensive. In addition to general-purpose models and traditional heuristics, the study incorporates text-based solvers, various VLM backbones, joint training, and standard benchmarks, facilitating a better understanding of the method's applicability.
Critical weaknesses
- There are inconsistencies between the numerical values and the metric definitions regarding key results. In Table 2, the average BoN gap for large-scale MIS is 3.29%, yet the Gap@1/@5/@10 figures are 84%, 94%, and 100%, respectively; mathematically, these proportions imply an average gap of less than 1.94%, meaning the two sets of figures are mutually incompatible. Furthermore, while §3 defines the gap of infeasible solutions as infinite, Table 1 reports finite mean values for methods with feasibility rates below 100%, and the evolutionary evaluation in Equation (6) adopts this same metric; the actual calculation method requires clarification.
- The independent benefits of the core contribution are not sufficiently substantiated. The ablation study on visual prompts primarily compares "with prompts" versus "without prompts" but lacks comparisons against manual designs or random search under equal computational budgets, making it difficult to confirm that the gains stem from the evolutionary search process itself. Additionally, Table 3 shows that the visual-based approach yields higher gaps than the text-based approach across all six tasks (e.g., 5.97% vs. 1.07% for TSP); consequently, its value requires further justification through an analysis of the trade-off between efficiency and solution quality.
- Conclusions regarding out-of-distribution (OOD) generalization lack clear support. The "OOD Uniform" and "OOD Gaussian" distributions mentioned in Appendix E.7 utilize parameters that already appear in the training data generation settings in Appendix A.1.2, meaning they cannot serve as valid evidence for OOD generalization. The scope of the standard benchmarks is also limited, with gaps exceeding 30% on larger JSSP instances.
- There are conflicting descriptions regarding data and training settings that hinder reproducibility. The main text states that 500,000 SFT instances are used per task, whereas Appendix C.2 specifies 50,000; furthermore, Appendix A.2.2 sets the CVRP capacity equal to the average customer demand, a configuration under which customers with demands exceeding the average cannot be served. The actual data generation and training configurations need to be clarified.
Questions for authors
See Weaknesses.
3 comments
Thank you for your response. I will maintain a positive score.
Thank you for your response and maintain a positive score. We deeply appreciate the time and effort you have devoted to reviewing our work. If you have any additional questions or need further clarification, please let us know. We will do our best to address them promptly. Thank you again for your thoughtful feedback.
Q1:Thank you for your question, which helps us further improve the paper. We apologize for the error in our statistical analysis. We have carefully rechecked all other results in the paper to prevent similar errors, rerun the evaluation, and repeated the analysis across instance-size ranges (10–30, 40–60, and 70–100 nodes). The corrected results are shown below:
Ours (BoN)
Ours (VA)
Q2: Thank you for this insightful question. “Without visual prompts” refers to the original, manually designed images, while “with visual prompts” refers to the evolved images. Please refer to our response to Reviewer s9yG for detailed explanations and experimental results. In particular, Experimental Section 5.5 provides a detailed analysis of how visual evolution reduces constraint violations across problems. Figure 12 in Appendix C.1 of the revised manuscript also illustrates examples of the image evolution process for CVRP, MIS, and JSSP. In Section 5.5, we compare the performance of our visual solver with that of the text-based solver. Although our visual solver has a slight gap in solution quality, it achieves faster inference. Some experimental results are also provided in our response to Reviewer s9yG. We hope these clarifications address your concerns.
Q3: Thank you for your question. Since our training data combine multiple distributions, we also evaluate our model on purely uniform and Gaussian distributions. In addition, we introduce a new out-of-distribution test set with a mixed distribution, combining uniform and clustered characteristics by sampling half of the nodes uniformly and the other half from the clustered distribution. The results are shown below:
Q4: Thank you for your questions and suggestions. Our approach uses two-stage learning: SFT followed by RL. During SFT, 500,000 instances per problem are used for training, and “5,000” refers to the separate visual self-evolution training stage. We have corrected this in Appendix C.2 of the manuscript.
For CVRP, vehicle capacity is determined by multiplying the mean customer demand by a random factor:
Q=⌊r⋅qˉ⌋,r∼Triangular(3,6,25)
where q̄ is the mean demand across all customers in the instance, and r follows a triangular distribution with a lower bound of 3, a mode of 6, and an upper bound of 25. The floor operation rounds the result down to the nearest integer. This setting is identical to that used in the CVRP dataset for the text-based solver.
We have updated the Appendix C.2 of the revised manuscript accordingly and highlighted the changes in blue.