Algorithm Evolution Using Large Language Model
About
Optimization can be found in many real-life applications. Designing an effective algorithm for a specific optimization problem typically requires a tedious amount of effort from human experts with domain knowledge and algorithm design skills. In this paper, we propose a novel approach called Algorithm Evolution using Large Language Model (AEL). It utilizes a large language model (LLM) to automatically generate optimization algorithms via an evolutionary framework. AEL does algorithm-level evolution without model training. Human effort and requirements for domain knowledge can be significantly reduced. We take constructive methods for the salesman traveling problem as a test example, we show that the constructive algorithm obtained by AEL outperforms simple hand-crafted and LLM-generated heuristics. Compared with other domain deep learning model-based algorithms, these methods exhibit excellent scalability across different problem sizes. AEL is also very different from previous attempts that utilize LLMs as search operators in algorithms.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Bin Packing Problem | BPP Online | Normalized Score100 | 5 | |
| Capacitated Vehicle Routing Problem | CVRP-POMO | Normalized Score100 | 5 | |
| Orienteering Problem | OP-ACO | Normalized Score0.916 | 5 | |
| Traveling Salesman Problem | TSP-POMO | Normalized Score0.975 | 5 | |
| Capacitated Vehicle Routing Problem | CVRP-LEHD | Normalized Score0.285 | 5 | |
| Traveling Salesman Problem | TSP-Constructive | Normalized Score0.878 | 5 | |
| Bin Packing Problem | BPP-Offline-ACO | Normalized Score0.27 | 5 | |
| Capacitated Vehicle Routing Problem | CVRP-ACO | Normalized Score0.403 | 5 | |
| DPP (Optimization Problem) | DPP-GA | Normalized Score0.00e+0 | 5 | |
| Multi-dimensional Knapsack Problem | MKP-ACO | Normalized Score0.00e+0 | 5 |