Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

AHD Agent: Agentic Reinforcement Learning for Automatic Heuristic Design

About

Automatic heuristic design (AHD) has emerged as a promising paradigm for solving NP-hard combinatorial optimization problems (COPs). Recent works show that large language models (LLMs), when integrated into well-designed frameworks (i.e., LLM-AHD), can autonomously discover high-performing heuristics. However, existing LLM-AHD frameworks typically treat LLMs as passive generators within fixed workflows, where the model generates heuristics from manually designed, limited context. Such context may fail to capture state-dependent information (e.g., specific failure modes), leading to inefficient trial-and-error exploration. To overcome these limitations, we propose AHD Agent, a novel tool-integrated, multi-turn framework that empowers LLMs to proactively decide whether to generate heuristics or invoke tools to retrieve targeted evidence from the solving environment. To effectively train such a dynamic decision-making agent, we introduce an agentic reinforcement learning (RL) system, which leverages a novel environment synthesis pipeline to optimize a compact model's generalizable AHD capabilities. Experiments across eight diverse domains, including four held-out tasks, demonstrate that our 4B-parameter agent matches or surpasses state-of-the-art baselines using much larger models, while requiring significantly fewer evaluations. Model and inference scaling analysis further reveals that AHD Agent offers an effective trajectory toward truly autonomous heuristic design.

Haoze Lv, Ning Lu, Ziang Zhou, Shengcai Liu• 2026

Related benchmarks

TaskDatasetResultRank
Capacitated Vehicle Routing Problem (ACO)CVRP-ACO N=100 (val)
Mean Objective Value15.634
13
Capacitated Vehicle Routing Problem (ACO)CVRP-ACO N=200 (val)
Mean Objective Value28.1
13
Capacitated Vehicle Routing Problem (Constructive)CVRP-Constructive N=100 (val)
Mean Cost21.442
13
Capacitated Vehicle Routing Problem (Constructive)CVRP-Constructive N=200 (val)
Mean Objective Value38.155
13
Combinatorial OptimizationOP-ACO
Mean (N=50)13.732
13
Combinatorial OptimizationOVRP-Constructive
Mean Objective (N=50)12.083
13
Traveling Salesperson Problem (ACO)TSP-ACO N=100 (val)
Mean Tour Length8.342
13
Traveling Salesperson Problem (ACO)TSP-ACO N=200 (val)
Mean Cost12.015
13
Traveling Salesperson Problem (Constructive)TSP-Constructive N=100 (val)
Mean Tour Length8.795
13
Traveling Salesperson Problem (Constructive)TSP-Constructive N=200 (val)
Mean Objective Value12.314
13
Showing 10 of 17 rows

Other info

Follow for update