突破有效性诱导边界以扩展算法搜索空间:一种基于AST的双阶段算子用于LLM驱动的自动启发式进化
Breaking Validity-Induced Boundaries to Expand Algorithm Search Space: A Two-Stage AST-Based Operator for LLM-Driven Automated Heuristic Evolution
AI总结:
本文提出一种双阶段基于AST的算子,通过生成无效结构并利用LLM修复,提升LLM驱动自动启发式进化算法的搜索能力,在TSP和OBP上验证了其优化性能和收敛速度的提升。
摘要:
通过生成无效结构并利用LLM修复,提升LLM驱动自动启发式进化算法的搜索能力,在TSP和OBP上验证了其优化性能和收敛速度的提升。
英文摘要:
Large Language Model (LLM) based automated heuristic design (AHD) has shown great potential in discovering efficient heuristics. Most existing LLM-AHD frameworks use semantic evolutionary operators that rely entirely on the LLM's pre-trained knowledge. These one-stage methods strictly require the generated code to be valid during the operation and often rely on a ``thought-code'' representation. We argue that this end-to-end generation fundamentally limits the exploration ability within the algorithm search space. In this paper, we propose a two-stage, structure-based evolutionary operator for LLM-AHD. In the first stage, our approach directly performs crossover and mutation on the Abstract Syntax Trees (ASTs) of the heuristic code, intentionally generating diverse but often invalid structural variants. In the second stage, the LLM is employed to repair these invalid heuristics into executable, high-quality code. Depending on the underlying framework, either the raw invalid variants or the repaired heuristics are integrated into the population to preserve potential structural patterns. We demonstrate that the proposed operator can significantly enhance the search ability of state-of-the-art LLM-AHD algorithms, such as EoH-S. Experimental results on the Traveling Salesman Problem (TSP) and the Online Bin Packing Problem (OBP) show that our method effectively improves both optimization performance and convergence speed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。