Skip to content

Partition to Evolve: Niching-enhanced Evolution with LLMs for Automated Algorithm Discovery

2025 · Neural Information Processing Systems · 10 citations · ⚡ 3 influential · 70 references
Computer Science

TL;DR

This work proposes a general LES framework that incorporates feature-assisted niche construction within abstract search spaces, enabling the seamless integration of niche-based search strategies from evolutionary computation and introduces PartEvo (Partition to Evolve), an LES method that combines niche collaborative search and advanced prompting strategies to improve algorithm discovery efficiency.

Abstract

Large language model-assisted Evolutionary Search (LES) has emerged as a promising approach for Automated Algorithm Discovery (AAD). While many evolutionary search strategies have been developed for classic optimization problems, LES operates in abstract language spaces, presenting unique challenges for applying these strategies effectively. To address this, we propose a general LES framework that incorporates feature-assisted niche construction within abstract search spaces, enabling the seamless integration of niche-based search strategies from evolutionary computation. Building on this framework, we introduce PartEvo (Partition to Evolve), an LES method that combines niche collaborative search and advanced prompting strategies to improve algorithm discovery efficiency. Experiments on both synthetic and real-world optimization problems show that PartEvo outperforms human-designed baselines and surpasses prior LES methods. In particular, on resource scheduling tasks, PartEvo generates meta-heuristics with low design costs, achieving up to 90.1% performance improvement over widely-used baseline algorithms, highlighting its potential for real-world applications.

View source

Similar papers

Book Open access Jul 2026

QDEvo: A Multi-Objective Quality-Diversity Framework for Automated Heuristic Design

Large Language Models (LLMs) are opening new directions for automated heuristic design (AHD), allowing evolutionary methods to create and enhance heuristics for constrained optimization problems (COPs). However, most existing approaches face the challenge of the exploration-exploitation balance, where the evolution nee...

Nam Do Khanh, Nhat Nguyen Tran Minh, Dat Pham Vu Tuan et al. · 1 citation
Jul 2026

LLM-Guided Evolutionary Search for Constraint Model Reformulation to Improve Solver Efficiency

Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural...

Kostis Michailidis, Dimos Tsouros, Dang Nguyen et al. · 0 citations
Preprint Jul 2026

GAE: Graph-Augmented Evolution for Scientific Discovery via Reinforcement Optimization

Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery. However, current approaches are fundamentally constrained by three bottlenecks: structurally blind parent selection, sparse whole-program evaluation rewards, and static mutation oper...

Xuanzhou Chen, Taoli Cheng · 0 citations
Jun 2026

Semantics-Aware Bilevel Co-Evolution: Towards Automated Multicomponent Algorithm Design

LLM-assisted evolutionary search (LES) has emerged as a promising paradigm for automated algorithm design. However, existing methods usually suffer from two inherent limitations when facing the automated design of real-world complex algorithms that usually consist of multiple components. The first limitation is that th...

Zhiyao Zhang, Sheng-Hao Wu, Xingyu Wu et al. · 0 citations
Preprint Aug 2026

Beyond Average Performance: Dynamic Instance Clustering and Specialized Algorithm Design in LLM-Assisted Evolutionary Search

DyCA treats instance clustering as a co-evolving component within the search process, reusing accumulated evaluation data as feature-free signals to progressively partition instances with similar algorithmic response patterns, thereby enabling finer-grained and more adaptive guidance for specialized algorithm design.

Qinglong Hu, Qingfu Zhang, Fei Liu et al. · 0 citations
Preprint Aug 2026

MuEvo: LLM-Driven Evolution of Multi-Heuristic Ensemble

Large language model-based automated heuristic design (LLM-AHD) has shown strong potential in discovering effective heuristics for combinatorial optimization problems. However, existing methods primarily optimize a single heuristic, whereas practical optimization frameworks often rely on multiple interacting components...

Haoze Lv, Ning Lu, Shengcai Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.