- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes HeurEvo, an agentic evolutionary framework for automatically designing hybrid solver-augmented heuristics under strict runtime constraints. Unlike existing approaches that optimize individual heuristic components or evolve entire programs without explicit structural representations, HeurEvo jointly evolves three levels: algorithmic plans, executable code, and reusable components.
Critical strengths
Novel and practically meaningful co-evolution framework. HeurEvo explicitly separates and jointly evolves algorithmic plans, executable implementations, and reusable components, extending beyond conventional program evolution or fixed-framework heuristic optimization. Its adaptive plan revision and runtime-aware composition address an important practical challenge in time-constrained optimization, making the contribution both methodologically interesting and broadly applicable.
Critical weaknesses
Insufficient accounting for offline evolutionary search costs. Although HeurEvo achieves impressive solution quality under a two-minute execution budget, discovering these heuristics requires substantial offline computation, including numerous LLM calls and program evaluations. The comparison against Gurobi's 48-hour solutions emphasizes inference-time efficiency without fully characterizing the total computational cost or its amortization across problem instances. This weakens the practical efficiency claims and makes it difficult to assess the framework's cost-effectiveness.
Questions for authors
-
Can the authors quantify the total offline evolutionary search cost, including LLM calls, token consumption, debugging, and program evaluations? How does HeurEvo compare with existing baselines under matched end-to-end computational budgets? This would help establish whether the reported performance gains justify the additional evolutionary complexity.
-
Are the reported results based on single evolutionary runs or multiple independent runs? Can the authors provide performance variance or confidence intervals across independent evolutionary runs, rather than only across problem instances? This is important for assessing whether the improvements are robust to stochastic search behavior.
-
For nonlinear geometry problems, how are the extremely small improvements over previously reported best-known solutions validated, particularly when reference values are rounded? Can the authors clarify the feasibility tolerances and numerical verification procedures used to substantiate these claims?