A hierarchical, optimization-inspired reflection system in which short-term reflections act as verbal gradients, long-term reflections as verbal momentum, and memory compression as semantic weight decay are introduced - collectively forming a principled mechanism for governing research dynamics.
Abstract
Automating heuristic design in complex, experiment-driven domains requires more than iterative mutation of solution algorithms. Current LLM-based evolutionary methods often rely on stochastic mutation loops that lack long-term strategic planning and a formal mechanism to learn from historical failures, leading to inefficient exploration and redundant trials. To address this, we present OR-Agent, a multi-agent research framework designed for automated heuristic design in optimization problems with rich experimental environments. OR-Agent organizes heuristic search as tree-based workflow that explicitly models branching hypothesis generation and systematic backtracking. Furthermore, to address the lack of adaptive learning in current agents, we introduce a hierarchical, optimization-inspired reflection system in which short-term reflections act as verbal gradients, long-term reflections as verbal momentum, and memory compression as semantic weight decay - collectively forming a principled mechanism for governing research dynamics. Extensive experiments on classical combinatorial optimization problems (e.g., TSP, CVRP, bin packing) and simulation-based cooperative driving scenarios demonstrate that OR-Agent outperforms strong evolutionary search baselines. All code and experimental data are publicly available at https://github.com/qiliuchn/OR-Agent.
This work investigates a human-directed workflow in which coding agents iteratively propose, implement, evaluate, diagnose, and eventually refine algorithms guided by simulation feedback and explicit correctness verification and shows that this workflow robustly outperformed any manually engineered solutions.
Matthias Eder, Pantelis Emmanouil, V. Farias et al.· 0 citations
Recent advances in agentic heuristic design use AI agents and execution feedback to automate algorithm discovery for challenging optimization problems. In many practical settings, high-quality solutions must be obtained under strict runtime constraints, motivating hybrid approaches that combine problem-specific heurist...
Fei-Jie Wu, Hugo Barbalho, Konstantina Mellou et al.· 0 citations
AlgoEvo is introduced, a unified agentic architecture that transforms automated algorithm discovery into an interactive, knowledge-accumulating process, demonstrating strong intra-task accumulation, cross-task transfer, and the ability to reproduce or exceed the strongest existing methods through flexible skill activat...
Jun-Hao Qiu, Qing-Long Hu, Ji Cheng et al.· 2 citations
This paper characterize in-context evolutionary stagnation and analytically propose the Improvement Chain proposition, showing how learning successive self-generated algorithms can locally increase the likelihood of neighboring algorithms.
Chen-Han Lu, Ke Xue, Si-Yuan Xu et al.· 0 citations
Designing effective multi-agent systems (MAS) remains a challenging and resource-intensive task. We propose a Bayesian Evolutionary Optimization framework for automatically discovering task-specific MAS topologies. The approach combines evolutionary operators to generate diverse workflow graphs with Bayesian optimizati...
Heuristic algorithms have been widely applied in search‐based software testing (SBST), playing a critical role in the automated generation of high‐coverage test cases. These algorithms often rely on random operations such as initialization, crossover and mutation to provide diverse individuals for search. However, it...