AutoEP: LLMs-Driven Automation of Hyperparameter Evolution for Metaheuristic Algorithms
About
Dynamically configuring algorithm hyperparameters is a fundamental challenge in computational intelligence. While learning-based methods offer automation, they suffer from prohibitive sample complexity and poor generalization. We introduce AutoEP, a novel framework that bypasses training entirely by leveraging Large Language Models (LLMs) as zero-shot reasoning engines for algorithm control. AutoEP's core innovation lies in a tight synergy between two components: (1) an online Exploratory Landscape Analysis (ELA) module that provides real-time, quantitative feedback on the search dynamics, and (2) a multi-LLM reasoning chain that interprets this feedback to generate adaptive hyperparameter strategies. This approach grounds high-level reasoning in empirical data, mitigating hallucination. Evaluated on three distinct metaheuristics across diverse combinatorial optimization benchmarks, AutoEP consistently outperforms state-of-the-art tuners, including neural evolution and other LLM-based methods. Notably, our framework enables open-source models like Qwen3-30B to match the performance of GPT-4, demonstrating a powerful and accessible new paradigm for automated hyperparameter design. Our code is available at https://github.com/YiZheZhang12/AutoEP.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Capacitated Vehicle Routing Problem | VRPLIB N=50 | Optimality Gap (%)0.05 | 18 | |
| Capacitated Vehicle Routing Problem | VRPLIB N=100 | Optimality Gap (%)0.13 | 18 | |
| Capacitated Vehicle Routing Problem | VRPLIB N=200 | Optimality Gap (%)1.07 | 18 | |
| Capacitated Vehicle Routing Problem | VRPLIB N=500 | Optimality Gap (%)3.15 | 18 | |
| Traveling Salesman Problem | Rd100 | Optimality Gap (%)0.01 | 18 | |
| Traveling Salesman Problem | Kroa150 | Optimality Gap0.01 | 18 | |
| Traveling Salesman Problem | rd300 | Optimality Gap0.09 | 18 | |
| Traveling Salesman Problem | rat575 | Optimality Gap (%)0.07 | 18 | |
| Traveling Salesman Problem | dsj1000 | Optimality Gap (%)3.58 | 18 | |
| Capacitated Vehicle Routing Problem | VRPLIB N=20 | Optimality Gap (%)0.01 | 18 |