arXiv:2606. 07603v1 Announce Type: cross Abstract: Large language models (LLMs) exhibit strong reasoning capabilities, yet most LLM-based agents are statically deployed and unable to improve through task interactions.
By Bowen Ren, Heyan Huang, Yinghao Li, Yang Gao
arXiv:2609.37172v1 Announce Type: new
Abstract: Large language models (LLMs) have emerged as powerful tools for automated heuristic design (AHD), enabling iterative generation and refinement of heuri...
By Jianghan Zhu, Cong Zhang, Rongjie Zhu, Chi Zhang, Zhiguang Cao
arXiv:2607. 21971v1 Announce Type: new Abstract: Test-time scaling through iterative self-evolution with environment feedback, as demonstrated by AlphaEvolve, shows remarkable performance gains.
By Shujin Wu, Cheng Qian, Xiusi Chen, Heng Ji
Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains. However, existing LLM-driven evolutionary frameworks largely discard such knowledge, repeatedly rediscovering similar ideas and limiting opportunities for cross-run and cross-task learning.
arXiv:2608. 07544v1 Announce Type: cross Abstract: Automated heuristic design (AHD) with large language models (LLMs) has produced strong heuristics for combinatorial optimization problems (COPs).
By Oguzhan Gungordu, Siheng Xiong, Faramarz Fekri
OR-Agent is a multi‑agent research framework that automates heuristic design for optimization problems by structuring heuristic search as a tree‑based workflow with explicit hypothesis generation and systematic backtracking. It introduces a hierarchical, optimization‑inspired reflection system that uses short‑term reflections as verbal gradients, long‑term reflections as verbal momentum, and memory compression as semantic weight decay to guide research dynamics. Experiments on classical combinatorial optimization tasks and simulation‑based cooperative driving scenarios show that OR‑Agent outperforms strong evolutionary search baselines, with all code and data publicly available.
By Qi Liu, Ruochen Hao, Can Li, Wanjing Ma