- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
GEAR uses large language models to write heuristic programs for combinatorial optimization problems. These programs first construct an initial solution and then improve it. GEAR modifies the code for both steps together. It selects programs with different strengths and uses them as references for the language model to generate new programs. To find what still needs improvement in the programs, GEAR also uses an Analyst to write and run analysis code. GEAR feeds the results back to the language model to guide further changes. The experiments cover eight types of problems.
Critical strengths
- The method considers the different strengths of programs. The case study and ablation experiments suggest that selecting programs in this way is useful.
- The Analyst writes and runs analysis code to help the language model find what needs improvement in the programs.
- The experiments cover eight types of problems, and the paper reports how performance varies across three runs.
- The paper also examines the role of each component.
Critical weaknesses
- The final test results lack comparisons under equal time or token budgets.
GEAR uses more time and tokens per iteration than most of the baseline methods.
- Some tasks have few test samples.
For example, PVRP has only 4 test instances, Crew Pairing has only 7 test files, and PDPTW has only 14 test instances. Performance on these tasks still needs to be checked using more test samples.
Questions for authors
-
If all methods use the same amount of time or the same number of tokens, do the final programs produced by GEAR still perform better on the test set?
-
Tasks such as PVRP have few test samples. Are results on more test samples available to support the current conclusions?
Response Part I (comparison with EoH-S and necessity of evolving initialization)
We thank the reviewer for the thoughtful feedback. We have clarified GEAR’s relationship to EoH-S and added comparisons addressing its methodological differences, evolving initialization, and practical performance. We hope these results address your concerns and would be happy to discuss any remaining questions.
(Q1/W1) Comparison with EoH-S and EoH-S + analyst
We thank the reviewer for this suggestion. We added comparisons with EoH-S and EoH-S + Analyst, with matched search space and computation budget. EoH-S + Analyst uses our Analyst feedback while retaining EoH-S’s parent-selection and population-survival rules. The test AF results are:
GEAR achieves higher test AF than EoH-S on all eight domains and EoH-S + Analyst on seven of eight domains. Adding the Analyst improves EoH-S on most domains, but a performance gap remains. These comparisons support the effectiveness of GEAR’s complete design.
We agree with the reviewer that GEAR’s survival gain shares the marginal-improvement structure of EoH-S under a common score convention. Building on this shared principle, GEAR uses directional complementary gain for both parent selection and survival. In comparison, EoH-S favors crossover parents with larger Manhattan distance and starts greedy survival from the single heuristic with the highest average fitness. At the framework level, GEAR combines this strategy with executable Analyst feedback to jointly evolve construction and refinement. We have updated manuscript to clarify these differences and explicitly acknowledge the shared marginal-gain survival principle.
(Q2/W2) Necessity of evolving initialization
We thank the reviewer for suggesting this comparison. We added experiments with fixed initialization and separately evolved refinement across all eight domains. The initializer remains fixed throughout discovery, while refinement is evolved specifically for it, with the Analyst and population-management components enabled. Example initialization include nearest-neighbor construction for CVRP, greedy schedule and route construction for PVRP, and multi-start job orderings for flow shop.
We additionally measured initialization quality, feasibility, construction time, and final quality for saved full-GEAR programs. Both configurations use the same total solving limits, including construction and refinement.
Full GEAR achieves better final AF in this comparison. It also achieves better final quality in cases where the fixed initializer has higher initial feasibility. This suggests that the benefit of evolving initialization extends beyond producing feasible starting solutions and is consistent with better coordination between jointly evolved construction and refinement.