

















Abstract:Designing effective heuristics for NP-hard combinatorial optimization problems remains challenging and often requires substantial domain expertise. Recent LLM-guided evolutionary methods have shown promise for automated heuristic generation, but most existing approaches refine heuristics independently or through limited pairwise feedback. We propose ReVEL: Multi-Turn Reflective LLM-Guided Heuristic Evolution via Structured Performance Feedback, a framework for group-wise multi-turn heuristic refinement. ReVEL organizes heuristics into behavior-aware reflective groups, including similarity-driven groups for localized refinement and diversity-driven groups for exploratory search. Within each group, the LLM performs iterative multi-turn refinement using accumulated performance feedback, enabling related heuristics to be jointly analyzed and progressively improved across evolutionary iterations. Experiments on standard combinatorial optimization benchmarks show that ReVEL generally improves optimization performance over existing LLM-guided evolutionary baselines across multiple settings and LLM backbones. Additional analyses suggest that behavior-aware grouping contributes to more consistent refinement trajectories during iterative heuristic evolution.
| Subjects: | Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2604.04940 [cs.AI] |
| (or arXiv:2604.04940v2 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2604.04940 arXiv-issued DOI via DataCite |
From: Cuong Van Duc [view email]
[v1]
Thu, 5 Mar 2026 04:52:11 UTC (8,221 KB)
[v2]
Tue, 26 May 2026 16:58:22 UTC (1,075 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。