Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

An Agentic Framework with LLMs for Solving Complex Vehicle Routing Problems

About

Complex vehicle routing problems (VRPs) remain a fundamental challenge, demanding substantial expert effort for intent interpretation and algorithm design. While large language models (LLMs) offer a promising path toward automation, current approaches still rely on external intervention, which restrict autonomy and often lead to execution errors and low solution feasibility. To address these challenges, we propose an Agentic Framework with LLMs (AFL) for solving complex vehicle routing problems, achieving full automation from problem instance to solution. AFL directly extracts knowledge from raw inputs and enables self-contained code generation without handcrafted modules or external solvers. To improve trustworthiness, AFL decomposes the overall pipeline into three manageable subtasks and employs four specialized agents whose coordinated interactions enforce cross-functional consistency and logical soundness. Extensive experiments on 60 complex VRPs, ranging from standard benchmarks to practical variants, validate the effectiveness and generality of our framework, showing comparable performance against meticulously designed algorithms. Notably, it substantially outperforms existing LLM-based baselines in both code reliability and solution feasibility, achieving rates close to 100% on the evaluated benchmarks.

Ni Zhang, Zhiguang Cao, Jianan Zhou, Cong Zhang, Yew-Soon Ong• 2025

Related benchmarks

TaskDatasetResultRank
Augmented Capacitated Vehicle Routing ProblemACVRP A-G and A-U (120 instances)
Best Objective Value580
240
Vehicle Routing ProblemOCVRP 48 standard 100-node benchmark instances
Objective Value9.99
18
Capacitated Vehicle Routing ProblemCVRPLib Set-XXL (1000, 10000)
Optimality Gap (%)8.12
13
Vehicle Routing ProblemCVRP N=50
Computation Time (m)0.18
12
Vehicle Routing ProblemCVRP 48 standard 100-node benchmark instances
Objective Value15.99
12
Vehicle Routing ProblemOCVRP n=100
Objective Value9.99
12
Electric Vehicle Routing Problem (ECVRP)Schneider Large Instances
Objective Value1.04e+3
10
Traveling Salesman ProblemTSPLib (generalization)
Performance Gap (200-500 Nodes)2.68
8
Vehicle Routing Problem48 standard 100-node benchmark instances MDOCVRPMBLTW
Objective Value13.04
6
Vehicle Routing ProblemCVRPTW n=100
Objective Value25.79
6
Showing 10 of 62 rows

Other info

Follow for update