Large Language Model-Driven Full-Component Evolution of Adaptive Large Neighborhood Search
Not on the map. Why?
Abstract (arXiv)
Adaptive Large Neighborhood Search (ALNS) is a prominent metaheuristic and a widely adopted approach for production and logistics optimization. However, it has long relied on hand-crafted components built on expert experience, which makes development slow and costly to adapt to new problems. This paper proposes a closed-loop, large-language-model-driven evolutionary framework that decouples ALNS and automatically rebuilds all of its components. We break ALNS into seven key modules: destroy, repair, operator selection, weight update, initial solution construction, acceptance rule, and destroy-rate control, and evolve each module through a dedicated task. By incorporating the Multi-dimensional Archive of Phenotypic Elites mechanism, the framework maintains a multi-dimensional elite archive to simultaneously drive the evolution of solution quality and strategic diversity. In addition, we design multiple mechanisms, including parallel and sequential multi-module evolution as well as single-expert-driven and multi-expert-driven evolution, to systematically evaluate the impact of different evolutionary paradigms on algorithm generation performance. Evaluations on Traveling Salesman Problem and Capacitated Vehicle Routing Problem benchmarks demonstrate that evolved algorithms consistently outperform optimized classic ALNS baselines under both fixed-iteration and fixed-time limits. The framework also shows a degree of generalizability and cross-problem transferability. Code analysis also uncovers several counterintuitive yet meaningful design patterns that emerged naturally during evolution, offering practical and theoretical insights for future ALNS design. Finally, comparisons across multiple language models highlight clear differences in their ability to support evolutionary algorithm design, helping guide model selection for real-world engineering use.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Mar 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026What Makes an LLM a Good Optimizer? A Trajectory Analysis of LLM-Guided Evolutionary Searchcited by 5
- 2026SpecAHD: Localize to Specialize for Automated Heuristic Design in Large-Scale Routing Problemscited by 1
- 2026SPO: Discovering Adaptive Large Neighborhood Search Operators via Stackelberg Program Optimizationcited by 0
- 2026SPO: Discovering Adaptive Large Neighborhood Search Operators via Stackelberg Program Optimization25 Sep 2026
- 2026SpecAHD: Localize to Specialize for Automated Heuristic Design in Large-Scale Routing Problems26 Jul 2026
- 2026What Makes an LLM a Good Optimizer? A Trajectory Analysis of LLM-Guided Evolutionary Search21 Apr 2026