AI Navigate

DyACE: Dynamic Algorithm Co-evolution for Online Automated Heuristic Design with Large Language Model

arXiv cs.AI / 3/17/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • DyACE reframes Automated Heuristic Design as a non-stationary bi-level control problem to enable dynamic adaptation of heuristics across different search phases.
  • The framework employs a Receding Horizon Control architecture to co-evolve heuristic logic with the evolving solution population, unlike traditional static solvers.
  • A Look-Ahead Rollout Search extracts Search Trajectory Features, enabling the LLM to act as a grounded meta-controller prescribing phase-specific interventions based on real-time search status.
  • Empirical results on three combinatorial optimization benchmarks show significant performance gains over static baselines, and ablation studies confirm that dynamic adaptation relies on grounded perception for effectiveness.

Abstract

The prevailing paradigm in Automated Heuristic Design (AHD) typically relies on the assumption that a single, fixed algorithm can effectively navigate the shifting dynamics of a combinatorial search. This static approach often proves inadequate for Perturbative Heuristics, where the optimal algorithm for escaping local optima depends heavily on the specific search phase. To address this limitation, we reformulate heuristic design as a Non-stationary Bi-level Control problem and introduce DyACE (Dynamic Algorithm Co-evolution). Distinct from standard open-loop solvers, DyACE use a Receding Horizon Control architecture to continuously co-evolve the heuristic logic alongside the solution population. A core element of this framework is the Look-Ahead Rollout Search, which queries the landscape geometry to extract Search Trajectory Features. This sensory feedback allows the Large Language Model (LLM) to function as a grounded meta-controller, prescribing phase-specific interventions tailored to the real-time search status. We validate DyACE on three representative combinatorial optimization benchmarks. The results demonstrate that our method significantly outperforms state-of-the-art static baselines, exhibiting superior scalability in high-dimensional search spaces. Furthermore, ablation studies confirm that dynamic adaptation fails without grounded perception, often performing worse than static algorithms. This indicates that DyACE's effectiveness stems from the causal alignment between the synthesized logic and the verified gradients of the optimization landscape.