PyVRP$^+$: LLM-Driven Metacognitive Heuristic Evolution for Hybrid Genetic Search in Vehicle Routing Problems

2026-04-09

AI Summary

This study addresses the challenge that high-performing metaheuristic algorithms for the Vehicle Routing Problem (VRP) often rely heavily on manual parameter tuning and domain-specific expertise. To overcome this limitation, the authors propose a Metacognitive Evolutionary Programming (MEP) framework, which introduces a large language model as a strategic discovery agent. Within a Reason–Act–Reflect loop, this agent actively diagnoses, hypothesizes, and refines core heuristic components of the Hybrid Genetic Search (HGS) algorithm. Unlike conventional approaches that employ passive feedback mechanisms, MEP enables explicit reasoning about the exploration–exploitation trade-off and facilitates heuristic innovation. Experimental results across multiple complex VRP variants demonstrate that MEP improves solution quality by up to 2.70% compared to the original HGS while reducing runtime by more than 45%.

Abstract

Designing high-performing metaheuristics for NP-hard combinatorial optimization problems, such as the Vehicle Routing Problem (VRP), remains a significant challenge, often requiring extensive domain expertise and manual tuning. Recent advances have demonstrated the potential of large language models (LLMs) to automate this process through evolutionary search. However, existing methods are largely reactive, relying on immediate performance feedback to guide what are essentially black-box code mutations. Our work departs from this paradigm by introducing Metacognitive Evolutionary Programming (MEP), a framework that elevates the LLM to a strategic discovery agent. Instead of merely reacting to performance scores, MEP compels the LLM to engage in a structured Reason-Act-Reflect cycle, forcing it to explicitly diagnose failures, formulate design hypotheses, and implement solutions grounded in pre-supplied domain knowledge. By applying MEP to evolve core components of the state-of-the-art Hybrid Genetic Search (HGS) algorithm, we discover novel heuristics that significantly outperform the original baseline. By steering the LLM to reason strategically about the exploration-exploitation trade-off, our approach discovers more effective and efficient heuristics applicable across a wide spectrum of VRP variants. Our results show that MEP discovers heuristics that yield significant performance gains over the original HGS baseline, improving solution quality by up to 2.70\% and reducing runtime by over 45\% on challenging VRP variants.

Problem

• Vehicle Routing Problem
• Metaheuristics
• Combinatorial Optimization
• Algorithm Design
• NP-hard

Innovation

• Metacognitive Evolutionary Programming
• Large Language Models
• Hybrid Genetic Search
• Vehicle Routing Problem
• Heuristic Evolution