cs.NEMar 7, 2026

Large Language Model-Driven Full-Component Evolution of Adaptive Large Neighborhood Search

Authors: Shaohua Yu, Tianyu Chen, Linyan Liu, Jakob Puchinger

Organizations: School of Intelligent Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China · School of Mechanical Engineering, Nanjing University of Science and Technology, Nanjing 210094, China · Université Paris-Saclay, CentraleSupélec, Laboratoire Génie Industriel, 91190, Gif-sur-Yvette, France · EM Normandie Business School, Métis Lab, 92110, Clichy, France

Abstract

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.

Figures & tables

Explore similar work

CardsList
  1. Latent Heuristic Search: Continuous Optimization for Automated Algorithm Design

    May 16, 2026Cheikh Ahmed, Mahdi Mostajabdaveh, Zirui ZhouSurrogate-Assisted OptimizationAutomated Algorithm Discovery

  2. AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization

    Feb 23, 2026Mert Cemri, Shubham Agrawal, Akshat Gupta +9Large Language Model-Guided OptimizationLLMs for Evolutionary Optimization

  3. ES-AHD: An Evolution Strategy Framework for Automatic Heuristic Design

    Aug 26, 2026Yutao Lai, Kezhao Lai, Hai-Lin Liu +2Automated Heuristic DesignLarge Language Model-Guided Optimization