Automatic Heuristic Design (AHD) has emerged as a transformative approach for solving combinatorial optimization problems. While recent Large Language Model (LLM)-based methods have shown promise, they predominantly rely on fixed evolutionary operators and struggle to effectively accumulate and reuse historical search experience.
arXiv:2608. 10795v1 Announce Type: new Abstract: 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.
By Viktor Volkov, Valentin Khrulkov, Andrey V. Galichin, Danil Sivtsov, Nikita Glazkov, Olga Volkova, Konstantin Pchelin, Iaroslav Bespalov, Dmitry V. Dylov, Petr Anokhin, Ivan Oseledets
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:2610.14736v1 Announce Type: new
Abstract: Optimization by PROmpting (OPRO) directly leverages Large Language Models (LLMs) to generate candidate solutions through natural-language prompting. Ho...
By Zhongnian Li, Shi Xu, Peng Ying, Weikang Gong, Zhixiao Wang, Xinzheng Xu
arXiv:2509. 08269v5 Announce Type: replace-cross Abstract: Large language models (LLMs) are increasingly integrated with evolutionary computation to support optimization tasks.
By Yisong Zhang, Ran Cheng, Guoxing Yi, Kay Chen Tan
The paper introduces LLM-EBG, an evolutionary framework that uses a large language model as a generative operator to automatically create optimization benchmarks. By generating unconstrained single-objective continuous minimization problems expressed as mathematical formulas, the framework can produce benchmarks that consistently favor a target algorithm over a comparison algorithm in over 80% of trials. Landscape analysis shows that these generated problems exhibit distinct geometric traits, such as sensitivity to variable scaling, reflecting the search behaviors of different optimization methods.
By Yuhiro Ono, Tomohiro Harada, Yukiya Miura